Random even graphs
| dc.creator | Grimmett, Geoffrey | |
| dc.creator | Janson, Svante | |
| dc.date | 2007-09-19 | |
| dc.date | 2009-03-25 | |
| dc.date.accessioned | 2026-07-07T12:55:50Z | |
| dc.date.available | 2026-07-07T12:55:50Z | |
| dc.description | We study a random even subgraph of a finite graph $G$ with a general edge-weight $p\in(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 $\frac 12 \pc$, where $\pc$ 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--Löwner evolutions (SLE). | |
| dc.description | Version 2 includes material about random even graphs with general values of the edge-parameter p, together with a coupling-from-the-past algorithm for their simulation. Version 3 includes a treatment of infinite graphs, and is to appear in the Electronic Journal of Combinatorics | |
| dc.identifier | https://arxiv.org/abs/0709.3039 | |
| dc.identifier | http://arxiv.org/abs/0709.3039 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/224386 | |
| dc.subject | Probability | |
| dc.subject | Mathematical Physics | |
| dc.subject | 05C80, 60K35 | |
| dc.title | Random even graphs | |
| dc.type | text |