uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Random even graphs
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Applied Mathematics.
2009 (English)In: The Electronic Journal of Combinatorics, ISSN 1077-8926, Vol. 16, no 1, R46- p.Article in journal (Refereed) Published
Abstract [en]

We study a random even subgraph of a finite graph G with a general edge-weight p is an element of (0, 1). We demonstrate how it may be obtained from a certain random-cluster measure on G, and we propose a sampling algorithm based on coupling from the past. A random even subgraph of a planar lattice undergoes a phase transition at the parameter-value 1/2p(c), where p(c) is the critical point of the q = 2 random-cluster model on the dual lattice. The properties of such a graph are discussed, and are related to Schramm-Lowner evolutions (SLE).

Place, publisher, year, edition, pages
2009. Vol. 16, no 1, R46- p.
National Category
URN: urn:nbn:se:uu:diva-114324ISI: 000264802300002OAI: oai:DiVA.org:uu-114324DiVA: diva2:293737
Available from: 2010-02-12 Created: 2010-02-12 Last updated: 2010-08-03Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Janson, Svante
By organisation
Analysis and Applied Mathematics
In the same journal
The Electronic Journal of Combinatorics

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

Total: 206 hits
ReferencesLink to record
Permanent link

Direct link