The weak limit of Boltzmann random matchings on diluted graphs
Overview & Synopsis
A matching on a finite graph G = (V,E) is a collection of pairwise nonadjacent edges M in E.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | The weak limit of Boltzmann random matchings on diluted graphs |
|---|---|
| Author / Organization | Justin Salez, Charles Bordenave, Marc Lelarge |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2010 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-125381 |
| Original Source Link | Visit Source Page on hal.science » |