Results 1  10
of
44
Uniform spanning forests
 Ann. Probab
, 2001
"... Abstract. We study uniform spanning forest measures on infinite graphs, which are weak limits of uniform spanning tree measures from finite subgraphs. These limits can be taken with free (FSF) or wired (WSF) boundary conditions. Pemantle (1991) proved that the free and wired spanning forests coincid ..."
Abstract

Cited by 59 (21 self)
 Add to MetaCart
Abstract. We study uniform spanning forest measures on infinite graphs, which are weak limits of uniform spanning tree measures from finite subgraphs. These limits can be taken with free (FSF) or wired (WSF) boundary conditions. Pemantle (1991) proved that the free and wired spanning forests coincide in Z d and that they give a single tree iff d � 4. In the present work, we extend Pemantle’s alternative to general graphs and exhibit further connections of uniform spanning forests to random walks, potential theory, invariant percolation, and amenability. The uniform spanning forest model is related to random cluster models in statistical physics, but, because of the preceding connections, its analysis can be carried further. Among our results are the following: • The FSF and WSF in a graph G coincide iff all harmonic Dirichlet functions on G are constant. • The tail σfields of the WSF and the FSF are trivial on any graph. • On any Cayley graph that is not a finite extension of Z, all component trees of the WSF have one end; this is new in Z d for d � 5. • On any tree, as well as on any graph with spectral radius less than 1, a.s. all components of the WSF are recurrent. • The basic topology of the free and the wired uniform spanning forest measures on lattices in hyperbolic space H d is analyzed. • A Cayley graph is amenable iff for all ɛ> 0, the union of the WSF and Bernoulli percolation with parameter ɛ is connected. • Harmonic measure from infinity is shown to exist on any recurrent proper planar graph with finite codegrees. We also present numerous open problems and conjectures.
Asymptotic enumeration of spanning trees
 Combin. Probab. Comput
, 2005
"... Note: Theorem numbers differ from the published version. Abstract. We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
Note: Theorem numbers differ from the published version. Abstract. We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call “tree entropy”, which we show is a logarithm of a normalized determinant of the graph Laplacian for infinite graphs. Tree entropy is also expressed using random walks. We relate tree entropy to the metric entropy of the uniform spanning forest process on quasitransitive amenable graphs, extending a result of Burton and Pemantle (1993). §1. Introduction. Methods of enumeration of spanning trees in a finite graph G and relations to various areas of mathematics and physics have been investigated for more than 150 years. The number of spanning trees is often called the complexity of the graph, denoted here by τ(G). The best known formula for the complexity, proved in every basic text on graph
On exchangeable random variables and the statistics of large graphs and hypergraphs
, 2008
"... ..."
Hyperlinear and sofic groups: a brief guide
 Bull. Symbolic Logic
"... Relatively recently, two new classes of (discrete, countable) groups have been isolated: hyperlinear groups and sofic groups. They come from different corners of mathematics (operator algebras and symbolic dynamics, respectively), and were introduced independently from each other, but are closely re ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Relatively recently, two new classes of (discrete, countable) groups have been isolated: hyperlinear groups and sofic groups. They come from different corners of mathematics (operator algebras and symbolic dynamics, respectively), and were introduced independently from each other, but are closely related nevertheless.
Sparse graphs: metrics and random models
"... Recently, Bollobás, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with Θ(n) edges. Roughly speaking, there is one model for each kernel, i.e., each symmetric measurable function from [0,1] 2 to the nonnegative reals, although the d ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Recently, Bollobás, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with Θ(n) edges. Roughly speaking, there is one model for each kernel, i.e., each symmetric measurable function from [0,1] 2 to the nonnegative reals, although the details are much more complicated, to ensure the exact inclusion of many of the recent models for largescale realworld networks. A different connection between kernels and random graphs arises in the recent work of Borgs, Chayes, Lovász, Sós, Szegedy and Vesztergombi. They introduced several natural metrics on dense graphs (graphs with n vertices and Θ(n 2) edges), showed that these metrics are equivalent, and gave a description of the completion of the space of all graphs with respect to any of these metrics in terms of graphons, which are essentially kernels. One of the most appealing aspects of this work is the message that sequences of inhomogeneous quasirandom graphs are in a sense completely
Identities and Inequalities for Tree Entropy
, 2007
"... Abstract. The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy and use one of them to prove that tree entropy respects stochastic ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy and use one of them to prove that tree entropy respects stochastic domination. We also prove that tree entropy is nonnegative in the unweighted case. §1. Introduction. The enumeration of spanning trees in a finite graph is a classical subject dating to the mid 19th century. Asymptotics began to play a role over 100 years later, in the 1960s. When a sequence of finite graphs converges in an appropriate, but very general, sense, Lyons (2005) gave a formula for the limit of the numbers of spanning trees in that sequence