Invasion percolation on regular trees : structure, scaling limit and ponds
Invasion percolation is an infinite subgraph of an infinite connected graph with finite degrees, defined inductively as follows. To each edge of the underlying graph, attach a random edge weight chosen uniformly from [0,1], independently for each edge. Starting from a single vertex, a cluster is g...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2010
|
| Online Access: | http://hdl.handle.net/2429/25744 |