|
1.
|
Ends in Uniform Spanning Forests
Lyons, Russell; Indiana University - Morris, Benjamin J.; U. Calif., Davis - Schramm, Oded; Microsoft Research
| Formato: |
Peer-reviewed Article, |
| Enlaces: |
 
It has hitherto been known that in a transitive unimodular graph, each tree in the wired spanning forest has only one end a.s. We dispense with the assumptions of transitivity and unimodularity, replacing them with a much broader condition on…
|
| Fecha: |
2008-01-01 |
| Recurso: |
Electronic journal of probability |
|
