The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

Alternatively, you can also download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link below.

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Download this PDF file Fullscreen Fullscreen Off

References

  1. Coffman, E. G., Jr.; Courtois, P.-J. ; Gilbert, E. N. ; Piret, Ph. A distributed clustering process. J. Appl. Probab. 28 (1991), no. 4, 737--750. MR1500106
  2. van den Berg, J. ; Meester, R. W. J. Stability properties of a flow process in graphs. Random Structures Algorithms 2 (1991), no. 3, 335--341. MR1109700 (92d:90027)
  3. van den Berg, J. ; Ermakov, A. On a distributed clustering process of Coffman, Courtois, Gilbert and Piret. J. Appl. Probab. 35 (1998), no. 4, 919--924. MR1671242 (2000b:60234)
  4. Hilário, M. R. ; Louidor, O. ; Newman, C. M. ; Rolla, L. T. ; Sheffield, S. ; Sidoravicius, V. Fixation for distributed clustering processes. Comm. Pure Appl. Math. 63 (2010), no. 7, 926--934. MR2662427
  5. Pemantle, Robin . Choosing a spanning tree for the integer lattice uniformly. Ann. Probab. 19 (1991), no. 4, 1559--1574. MR1127715 (92g:60014)
  6. Alexander, Kenneth S. Percolation and minimal spanning forests in infinite graphs. Ann. Probab. 23 (1995), no. 1, 87--104. MR1330762 (96c:60114)
  7. Lyons, Russell ; Peres, Yuval ; Schramm, Oded . Minimal spanning forests. Ann. Probab. 34 (2006), no. 5, 1665--1692. MR2271476 (2007m:60299)
Bookmark and Share


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.