Searcharxiv⌕ Search

arXiv subjects

Russell Lyons

Publications and source records attributed to Russell Lyons.

At least 55 records · Page 3Linked to original sources

Uniform non-amenability, cost, and the first l^2-Betti number

It is shown that $2β_1(\G)\leq h(\G)$ for any countable group $\G$, where $β_1(\G)$ is the first $\ell^2$-Betti number and $h(\G)$ the uniform isoperimetric constant. In particular, a countable group with non-vanishing first $\ell^2$-Betti number is uniformly non-amenable. We then define isoperimetric constants in the framework of measured equivalence relations. For an ergodic measured equivalence relation $R$ of type $\IIi$, the uniform isoperimetric constant $h(R)$ of $R$ is invariant under orbit equivalence and satisfies $$ 2β_1(R)\leq 2C(R)-2\leq h(R), $$ where $β_1(\R)$ is the first $\ell^2$-Betti number and $C(R)$ the cost of $R$ in the sense of Levitt (in particular $h(R)$ is a non-trivial invariant). In contrast with the group case, uniformly non-amenable measured equivalence relations of type $\IIi$ always contain non-amenable subtreeings. An ergodic version $h_e(\G)$ of the uniform isoperimetric constant $h(\G)$ is defined as the infimum over all essentially free ergodic and measure preserving actions $α$ of $\G$ of the uniform isoperimetric constant $h(\R_α)$ of the equivalence relation $R_α$ associated to $α$. By establishing a connection with the cost of measure-preserving equivalence relations, we prove that $h_e(\G)=0$ for any lattice $\G$ in a semi-simple Lie group of real rank at least 2 (while $h_e(\G)$ does not vanish in general).

math.GR↗

Growth of the Number of Spanning Trees of the Erdös-Rényi Giant Component

The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ ($c>1$) grows like $\exp\big\{m\big(f(c)+o(1)\big)\big\}$ as $n\to\infty$, where $m$ is the number of vertices in the giant component. The function $f$ is not known explicitly, but we show that it is strictly increasing and infinitely differentiable. Moreover, we give an explicit lower bound on $f'(c)$. A key lemma is the following. Let $\PGW(λ)$ denote a Galton-Watson tree having Poisson offspring distribution with parameter $λ$. Suppose that $λ^*>λ>1$. We show that $\PGW(λ^*)$ conditioned to survive forever stochastically dominates $\PGW(λ)$ conditioned to survive forever.

math.PR↗

Ladder Sandpiles

We study Abelian sandpiles on graphs of the form $G \times I$, where $G$ is an arbitrary finite connected graph, and $I \subset \Z$ is a finite interval. We show that for any fixed $G$ with at least two vertices, the stationary measures $μ_I = μ_{G \times I}$ have two extremal weak limit points as $I \uparrow \Z$. The extremal limits are the only ergodic measures of maximum entropy on the set of infinite recurrent configurations. We show that under any of the limiting measures, one can add finitely many grains in such a way that almost surely all sites topple infinitely often. We also show that the extremal limiting measures admit a Markovian coding.

math.PR↗

Recurrence of random walk traces

We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.

math.PR↗

Minimal spanning forests

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 FMSF (free minimal spanning forest) and WMSF (wired minimal spanning forest), respectively. The WMSF is also the union of the trees that arise from invasion percolation started at all vertices. We show that on any Cayley graph where critical percolation has no infinite clusters, all the component trees in the WMSF have one end a.s. In $\mathbb{Z}^d$ this was proved by Alexander [Ann. Probab. 23 (1995) 87--104], but a different method is needed for the nonamenable case. We also prove that the WMSF components are ``thin'' in a different sense, namely, on any graph, each component tree in the WMSF has $p_{\mathrm{c}}=1$ a.s., where $p_{\mathrm{c}}$ denotes the critical probability for having an infinite cluster in Bernoulli percolation. On the other hand, the FMSF is shown to be ``thick'': on any connected graph, the union of the FMSF and independent Bernoulli percolation (with arbitrarily small parameter) is a.s. connected. In conjunction with a recent result of Gaboriau, this implies that in any Cayley graph, the expected degree of the FMSF is at least the expected degree of the FSF (the weak limit of uniform spanning trees). We also show that the number of infinite clusters for Bernoulli($p_{\mathrm{u}}$) percolation is at most the number of components of the FMSF, where $p_{\mathrm{u}}$ denotes the critical probability for having a unique infinite cluster. Finally, an example is given to show that the minimal spanning tree measure does not have negative associations.

math.PR↗

A Solidification Phenomenon in Random Packings

We prove that uniformly random packings of copies of a certain simply-connected figure in the plane exhibit global connectedness at all sufficiently high densities, but not at low densities.

cond-mat.stat-mech↗

Asymptotic Enumeration of Spanning Trees

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 quasi-transitive amenable graphs, extending a result of Burton and Pemantle (1993).

math.CO↗

Conceptual Proofs of L log L Criteria

The Kesten-Stigum Theorem is a fundamental criterion for the rate of growth of a supercritical branching process, showing that an L log L condition is decisive. In critical and subcritical cases, results of Kolmogorov and later authors give the rate of decay of the probability that the process survives at least n generations. We give conceptual proofs of these theorems based on comparisons of Galton-Watson measure to another measure on the space of trees. This approach also explains Yaglom's exponential limit law for conditioned critical branching processes via a simple characterization of the exponential distribution.

math.PR↗

Random Walk in a Random Environment and First-Passage Percolation on Trees

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches per vertex. This generalizes and unifies previous work of the authors. It also shows that the point of phase transition for edge-reinforced random walk is likewise determined by the branching number of the tree. Finally, we show that the branching number determines the rate of first-passage percolation on trees, also known as the first-birth problem. Our techniques depend on quasi-Bernoulli percolation and large deviation results.

math.PR↗

High-Precision Entropy Values for Spanning Trees in Lattices

Shrock and Wu have given numerical values for the exponential growth rate of the number of spanning trees in Euclidean lattices. We give a new technique for numerical evaluation that gives much more precise values, together with rigorous bounds on the accuracy. In particular, the new values resolve one of their questions.

math-ph↗

Determinantal probability measures

Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We study basic combinatorial and probabilistic aspects in the discrete case. Our main results concern relationships with matroids, stochastic domination, negative association, completeness for infinite matroids, tail triviality, and a method for extension of results from orthogonal projections to positive contractions. We also present several new avenues for further investigation, involving Hilbert spaces, combinatorics, homology, and group representations, among other areas.

math.PR↗

Stationary Determinantal Processes: Phase Multiplicity, Bernoullicity, Entropy, and Domination

We study a class of stationary processes indexed by $\Z^d$ that are defined via minors of $d$-dimensional (multilevel) Toeplitz matrices. We obtain necessary and sufficient conditions for phase multiplicity (the existence of a phase transition) analogous to that which occurs in statistical mechanics. Phase uniqueness is equivalent to the presence of a strong $K$ property, a particular strengthening of the usual $K$ (Kolmogorov) property. We show that all of these processes are Bernoulli shifts (isomorphic to i.i.d. processes in the sense of ergodic theory). We obtain estimates of their entropies and we relate these processes via stochastic domination to product measures.

math.PR↗

Change Intolerance in Spanning Forests

Call a percolation process on edges of a graph change intolerant if the status of each edge is almost surely determined by the status of the other edges. We give necessary and sufficient conditions for change intolerance of the wired spanning forest when the underlying graph is a spherically symmetric tree.

math.PR↗

Szego limit theorems

The first Szego limit theorem has been extended by Bump-Diaconis and Tracy-Widom to limits of other minors of Toeplitz matrices. We extend their results still further to allow more general measures and more general determinants. We also give a new extension to higher dimensions, which extends a theorem of Helson and Lowdenslager.

math.CA↗

Markov Chain Intersections and the Loop-Erased Walk

Let X and Y be independent transient Markov chains on the same state space that have the same transition probabilities. Let L denote the ``loop-erased path'' obtained from the path of X by erasing cycles when they are created. We prove that if the paths of X and Y have infinitely many intersections a.s., then L and Y also have infinitely many intersections a.s.

math.PR↗

Coupling and Bernoullicity in random-cluster and Potts models

An explicit coupling construction of random-cluster measures is presented. As one of the applications of the construction, the Potts model on amenable Cayley graphs is shown to exhibit at every temperature the mixing property known as Bernoullicity.

math.PR↗

Explicit isoperimetric constants and phase transitions in the random-cluster model

The random-cluster model is a dependent percolation model that has applications in the study of Ising and Potts models. In this paper, several new results are obtained for the random-cluster model on nonamenable graphs with cluster parameter $q\geq 1$. Among these, the main ones are the absence of percolation for the free random-cluster measure at the critical value, and examples of planar regular graphs with regular dual where $\pc^\f (q) > \pu^\w (q)$ for $q$ large enough. The latter follows from considerations of isoperimetric constants, and we give the first nontrivial explicit calculations of such constants. Such considerations are also used to prove non-robust phase transition for the Potts model on nonamenable regular graphs.

math.PR↗