inhomogeneous random graphs

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