Sökning: id:"swepub:oai:gup.ub.gu.se/163656" >
Percolation in inva...
Percolation in invariant Poisson graphs with i.i.d. degrees
-
- Deijfen, Maria (författare)
- Stockholms universitet,Matematiska institutionen
-
- Häggström, Olle, 1967 (författare)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematisk statistik,Department of Mathematical Sciences, Mathematical Statistics,University of Gothenburg,Chalmers tekniska högskola,Chalmers University of Technology
-
- Holroyd, A. E. (författare)
- University of British Columbia (UBC),Microsoft Research
-
(creator_code:org_t)
- International Press of Boston, 2012
- 2012
- Engelska.
-
Ingår i: Arkiv for Matematik. - : International Press of Boston. - 0004-2080 .- 1871-2487. ; 50:1, s. 41-58
- Relaterad länk:
-
https://doi.org/10.1...
-
visa fler...
-
http://dx.doi.org/10...
-
https://gup.ub.gu.se...
-
https://doi.org/10.1...
-
https://research.cha...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- stationary random graphs
- prescribed iid degrees
- nearest-neighbor
- degree sequence
- prescribed iid degrees
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas