Functional Central limit theorems for microscopic and macroscopic functionals of inhomogeneous random graphs

Abstract

We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the infinite vector of microscopic type-densities and characterizations of the limits as infinite-dimensional conditionally Gaussian processes in a certain Banach space. (b) Functional (joint) central limit theorems for macroscopic observables of the giant component in the supercritical regime including size, surplus and number of vertices of various types in the giant component. As a corollary this provides central limit theorems for the size of the largest connected component, its surplus, and its type vector, for percolation on dense graphs obtained from a finite type Graphon. (c) Central limit theorem for the weight of the minimum spanning tree with random i.i.d. Exponential edge weights on dense graph sequences driven by an underlying finite type graphon.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…