Random Structures & Algorithms

The diameter of inhomogeneous random graphs

Early View

Abstract

In this paper, we study the diameter of inhomogeneous random graphs G ( n , κ , p ) 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ős–Rényi model G(n, p) for several ranges of p. We find upper and lower bounds for the diameter of G ( n , κ , 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 Topics

Related Publications

Related Content

Site Footer

Address:

This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.