Multiplicative Coalescent

The number of connected components in sub-critical random graph processes
We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph …
Josué Corujo
Cite HAL arXiv
A dynamical approach to spanning and surplus edges of random graphs
Consider a finite inhomogeneous random graph running in continuous time, where each vertex has a mass, and the edge that links any pair …
Josué Corujo, Vlada Limic
Cite HAL arXiv
A dynamical approach to spanning and surplus edges of random graphs
The standard augmented multiplicative coalescent revisited
The Erdős-Rényi random graph is the fundamental random graph model. In this paper we consider its continuous-time version, where …
Josué Corujo, Vlada Limic
Cite Slides HAL arXiv
The standard augmented multiplicative coalescent revisited