The diameter of Inhomogeneous random graphs
Probability
2015-11-02 v1 Combinatorics
Abstract
In this paper we study the diameter of Inhomogeneous random graphs that are induced by irreducible kernels . 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 for several ranges of . We find upper and lower bounds for the diameter of in terms of the expansion factor and two explicit constants that depend on the behavior of the kernel over partitions of the metric space.
Cite
@article{arxiv.1510.08882,
title = {The diameter of Inhomogeneous random graphs},
author = {Nicolas Fraiman and Dieter Mitsche},
journal= {arXiv preprint arXiv:1510.08882},
year = {2015}
}