On the block size spectrum of a class of exchangeable dynamic random graphs

Abstract

In this work we introduce the dynamic -random graph and the associated -coalescent with momentum. Dynamic -random graphs are a subclass of exchangeable and consistent random graph processes, parametrised by a measure on [0,1]× (0,1], inspired by the classic -coalescent from mathematical population genetics. The -coalescent with momentum accounts for the small connected components of this graph; in contrast to the underlying random graph it is exchangeable but not consistent. Our main results specialise on the case where is the product of a beta measure and a Dirac mass at 1. We prove a dynamic law of large numbers for the block size spectrum, which tracks the numbers of blocks containing 1,...,d elements. On top of that, we provide a functional limit theorem for the fluctuations. The limit process satisfies a stochastic differential equation of Ornstein-Uhlenbeck type.

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…