Change search
ReferencesLink to record
Permanent link

Direct link
Percolation in invariant poisson graphs with i.i.d. degrees
Stockholm University, Faculty of Science, Department of Mathematics.
2012 (English)In: Arkiv för matematik, ISSN 0004-2080, E-ISSN 1871-2487, Vol. 50, no 1, 41-58 p.Article in journal (Refereed) Published
Abstract [en]

Let each point of a homogeneous Poisson process in R-d independently be equipped with a random number of stubs (half-edges) according to a given probability distribution mu on the positive integers. We consider translation-invariant schemes for perfectly matching the stubs to obtain a simple graph with degree distribution mu. Leaving aside degenerate cases, we prove that for any mu there exist schemes that give only finite components as well as schemes that give infinite components. For a particular matching scheme which is a natural extension of Gale-Shapley stable marriage, we give sufficient conditions on mu for the absence and presence of infinite components.

Place, publisher, year, edition, pages
2012. Vol. 50, no 1, 41-58 p.
National Category
URN: urn:nbn:se:su:diva-81710DOI: 10.1007/s11512-010-0139-8ISI: 000307645700003OAI: diva2:563785


Available from: 2012-10-31 Created: 2012-10-30 Last updated: 2012-10-31Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Deijfen, Maria
By organisation
Department of Mathematics
In the same journal
Arkiv för matematik

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 59 hits
ReferencesLink to record
Permanent link

Direct link