Random even graphs
2009 (English)In: The Electronic Journal of Combinatorics, ISSN 1077-8926, Vol. 16, no 1, R46- p.Article in journal (Refereed) Published
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.
IdentifiersURN: urn:nbn:se:uu:diva-114324ISI: 000264802300002OAI: oai:DiVA.org:uu-114324DiVA: diva2:293737