A dynamical approach to spanning and surplus edges of random graphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

A dynamical approach to spanning and surplus edges of random graphs

Résumé

Consider a finite inhomogeneous random graph running in continuous time, where each vertex has a mass, and the edge that links any pair of vertices appears with a rate equal to the product of their masses. The simultaneous breadth-first-walk introduced by Limic (2019) is extended in order to account for the surplus edge data in addition to the spanning edge data. Two different graph-based representations of the multiplicative coalescent, with different advantages and drawbacks, are discussed in detail. A canonical multi-graph from Bhamidi, Budhiraja and Wang (2014) naturally emerges. The presented framework will facilitate the understanding of scaling limits with surplus edges for near-critical random graphs in the domain of attraction of general (not necessarily standard) eternal augmented multiplicative coalescent.

Dates et versions

hal-04092273 , version 1 (09-05-2023)

Identifiants

Citer

Josué M. Corujo, Vlada Limic. A dynamical approach to spanning and surplus edges of random graphs. 2023. ⟨hal-04092273⟩
27 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More