arXiv:1510.08882 [math.PR]AbstractReferencesReviewsResources
The diameter of Inhomogeneous random graphs
Nicolas Fraiman, Dieter Mitsche
Published 2015-10-29Version 1
In this paper we study the diameter of Inhomogeneous random graphs $G(n,\kappa,p)$ that are induced by irreducible kernels $\kappa$. The kernels we consider act on separable metric spaces and are almost everywhere continuous. We generalize results known for the Erd\H{o}s-R\'enyi model $G(n,p)$ for several ranges of $p$. We find upper and lower bounds for the diameter of $G(n,\kappa,p)$ in terms of the expansion factor and two explicit constants that depend on the behavior of the kernel over partitions of the metric space.
Related articles: Most relevant | Search more
arXiv:0905.0437 [math.PR] (Published 2009-05-04)
Susceptibility in inhomogeneous random graphs
arXiv:1210.6259 [math.PR] (Published 2012-10-23)
Connectivity of inhomogeneous random graphs
arXiv:0812.3007 [math.PR] (Published 2008-12-16)
Asymptotics for the size of the largest component scaled to "log n" in inhomogeneous random graphs