arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1212.4281math.PRmath.CO
收藏

指数逼近,随机分配随机图经验邻域测度的类型化方法

Exponential Approximation, Method of types for Empirical Neighbourhood Measures of Random graphs by Random Allocation

K. Doku-Amponsah

摘要:

在这篇文章中,我们发现指数良好的逼近的经验邻域分布的符号随机图的条件下,一个给定的经验符号分布和经验对分布。使用这种近似,我们缩短或简化的证明(Doku-Amponsah和Morters 2010,定理2.5);大偏差原则(LDP)的经验邻域分布的符号随机图。我们还证明了经典Erdens-Rényi图的经验度测度的LDP是(Doku-Amponsah and Moerters,2010,Theorem~2.5)的一个特例。从经验度测度的LDP出发,我们导出了经典Erdens-Rényi图中孤立点比例的LDP.

英文摘要:

In this article we find exponential good approximation of the empirical neigbourhood distribution of symbolled random graphs conditioned to a given empirical symbol distribution and empirical pair distribution. Using this approximation we shorten or simplify the proof of (Doku-Amponsah and Morters 2010, Theorem~2.5); the large deviation principle (LDP) for empirical neigbourhood distribution of symbolled random graphs. We also show that the LDP for the empirical degree measure of the classical Erdős-Rényi graph is a special case of (Doku-Amponsah and Moerters, 2010, Theorem~2.5). From the LDP for the empirical degree measure, we derive an LDP for the the proportion of isolated vertices in the classical Erdős-Rényi graph.

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

↑