The weak limit of Boltzmann random matchings on diluted graphs

Justin Salez (1) , Charles Bordenave (2) , Marc Lelarge (1)

1 TREC - Theory of networks and communications
2 IMT - Institut de Mathématiques de Toulouse UMR5219

A matching on a finite graph G = (V,E) is a collection of pairwise nonadjacent edges M in E.

Domaines: Probabilités [math.PR]

Justin Salez, Charles Bordenave, Marc Lelarge. The weak limit of Boltzmann random matchings on diluted graphs. Journées MAS et Journée en l'honneur de Jacques Neveu, Aug 2010, Talence, France. ⟨inria-00509846⟩