The diameter of Inhomogeneous random graphs

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 Erdos-R\'enyi 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…