English

The diameter of Inhomogeneous random graphs

Probability 2015-11-02 v1 Combinatorics

Abstract

In this paper we study the diameter of Inhomogeneous random graphs G(n,κ,p)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)G(n,p) for several ranges of pp. We find upper and lower bounds for the diameter of G(n,κ,p)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.

Keywords

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}
}
R2 v1 2026-06-22T11:32:36.019Z