Minimal spanning forests (Q858976): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: math/0412263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kazhdan Groups, Cocycles and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for Euclidean minimal spanning trees on random points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation and minimal spanning forests in infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation of level sets for two-dimensional random fields with lattice symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation in half-spaces: Equality of critical densities and continuity of the percolation probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical percolation on any nonamenable group has no infinite clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-invariant percolation on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform spanning forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation in the hyperbolic plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density and uniqueness in percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\ell^2\) invariants of equivalence relations and groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant percolation and harmonic Dirichlet functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The supercritical phase of percolation is well behaved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-cluster measures and uniform spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite clusters in dependent automorphism invariant percolation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4379727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of uniqueness for percolation on Cayley graphs: All infinite clusters are born simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical probability of bond percolation on the square lattice equals 1/2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions on nonamenable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOM COMPLEXES AND ℓ<sup>2</sup>-BETTI NUMBERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability of percolation clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The components of the wired spanning forest are recurrent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4380378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ground-state structure in a highly disordered spin-glass model. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing a spanning tree for the integer lattice uniformly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonamenable products are not treeable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of infinite clusters in dynamical percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of infinite clusters in supercritical percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ends in free minimal spanning forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities with applications to percolation and reliability / rank
 
Normal rank

Latest revision as of 11:34, 25 June 2024

scientific article
Language Label Description Also known as
English
Minimal spanning forests
scientific article

    Statements

    Minimal spanning forests (English)
    0 references
    0 references
    0 references
    0 references
    12 January 2007
    0 references
    Minimal spanning forests on infinite graphs are weak limits of minimal spanning trees from finite subgraphs. These limits can be taken with free or wired boundary conditions and are denoted by FMSF (free minimal spanning forest) and WMSF (wired minimal spanning forest). In the paper authors study these forests and compare them with another natural random forests on infinite graphs which are free uniform spanning forest (FSF), constructed by \textit{R. Pemantle} [Ann. Probab. 19, 1559--1574 (1991; Zbl 0758.60010)] and wired uniform spanning forest (WSF). Among others the following properties of WMSF and FMSF are proved. On any Cayley graph where the critical percolation has no infinite clusters, all component trees in the WMSF have one end a.s. This extends the result of \textit{K. S. Alexander} [Ann. Probab. 23, 87--104 (1995; Zbl 0827.60079)] on \(\mathbb Z^d\). On any graph, the percolation threshold of any component of the WMSF, equals one, a.s. This and the previous result can be interpreted as `thinness' of WMSF. On the other hand FMSF is shown to be `thick': on any connected graph, the union of the FMSF and of independent Bernoulli percolation with arbitrarily small parameter is a.s. connected. In conjunction with the result of \textit{D. Gaboriau} [Geom. Funct. Anal. 15, 1004--1051 (2005; Zbl 1099.60070)], this implies that in any Cayley graph, the expected degree of an vertex of FMSF is at least the expected degree of the FSF. Let \(p_u\) be the critical threshold for having a unique infinite cluster in the Bernoulli percolation. On any graph, the number of infinite components of this percolation at \(p_u\) is at most the number of components of the FMSF. On any connected graph, the both measures FMSF and WMSF coincide iff for almost every \(p\) (in the sense of Lebesgue measure) there is a.s. at most one infinite component in the Bernoulli percolation with parameter \(p\). Finally, an example is given to show that the minimal spanning tree measures does not have negative associations.
    0 references
    spanning trees
    0 references
    Cayley graphs
    0 references
    amenability
    0 references
    percolation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references