Critical random forests
Let F(N, m) denote a random forest on a set of N vertices, chosen uniformly from all forests with m edges. Let F(N, p) denote the forest obtained by conditioning the Erd˝os-R´enyi graph G(N, p) to be acyclic. We describe scaling limits for the largest components of F(N, p) and F(N, m), in the critic...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Instituto Nacional de Matemática Pura e Aplicada
2018
|