Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 13 Jun 2024 in math.PR | (2406.08972v3)

Abstract: In this work we introduce the dynamic $\Theta$-random graph and the associated $\Theta$-coalescent with momentum. Dynamic $\Theta$-random graphs are a subclass of exchangeable and consistent random graph processes, parametrised by a measure $\Theta$ on $[0,1]\times (0,1]$, inspired by the classic $\Lambda$-coalescent from mathematical population genetics. The $\Theta$-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 $\Theta$ 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.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.