arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0607545math.PR
收藏

Large deviation principles for empirical measures of colored random graphs

Kwabena Doku-Amponsah, Peter Mörters

英文摘要:

For any finite colored graph we define the empirical neighborhood measure, which counts the number of vertices of a given color connected to a given number of vertices of each color, and the empirical pair measure, which counts the number of edges connecting each pair of colors. For a class of models of sparse colored random graphs, we prove large deviation principles for these empirical measures in the weak topology. The rate functions governing our large deviation principles can be expressed explicitly in terms of relative entropies. We derive a large deviation principle for the degree distribution of Erdős--Rényi graphs near criticality.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑