Progress in high-dimensional percolation and random graphs
This is a textbook on percolation. The authors consider a lattice -- let us focus on \(\mathbb{Z}^{d}\) here -- where each vertex is adjacent to each of the \(2d\) vertices which differ from it in one coordinate only and then by \(\pm 1\). Percolation is basically the situation where each bond (i.e., edge) is occupied with probability \(p\) and vacant with probability \(1-p\) independent of all other bonds and we study the behaviour of the occupied bonds. For example, for what values of \(p\) is there an infinite cluster of occupied bonds? Letting \(\mathcal{C}(x)\) denote the cluster of a vertex \(x\), we let \(\theta(p)=\mathbb{P}_{p}\left(\vert\mathcal{C}(x)\vert=\infty\right)\). This is clearly independent of \(x\) by transitivity but dependent on \(p\). We let \(p_{c}=\inf \{p: \theta(p)>0\}\) be the critical probability where there is a change from finite clusters to (at least) one infinite cluster. Much of the interest is in values of \(p\) close to \(p_{c}\). For example, a famous question, unsolved in general, is to show that, when \(d\geq 2\), there is no infinite cluster when \(p=p_{c}\). One of the main new contributions of the book under review is to give a self-contained proof that for large enough \(d\) this statement is true (the corresponding result for \(d=2\) is due to \textit{H. Kesten} [Probab. Theory Relat. Fields 73, 369--394 (1986; Zbl 0584.60098)]). It is expected from physical considerations that \(\theta(p)\sim (p-p_{c})^{\beta}\) for some constant \(\beta\) as \(p\downarrow p_{c}\). We might also be interested in \(\chi(p)\), the expected size of the cluster of the origin. Again, physics predicts (but does not prove) the existence of a constant \(\gamma\) such that \(\chi(p)\sim (p-p_{c})^{-\gamma}\). We could further consider \(\chi^{f}(p)\), the size of the cluster of the origin conditional on its being finite, where again it is predicted that \(\chi^{f}(p)\sim (p-p_{c})^{-\delta}\) . (Soma caution in needed about the multiple interpretations of \(\sim\) in this area, see the text for details) . The more detailed description of the first main aim of this book as outlined in the previous paragraph is to prove that in high dimensions we have that \(\beta, \gamma, \delta\) (and another more technical exponent \(\eta\)) exist and take the values \(\beta=\gamma=1\), \(\delta=2\) (and \(\eta=0\)). A secondary main aim is to prove several other, more technical, results on percolation in high dimensions. We do not enumerate these in detail. Here is a somewhat complementary summary of the contents. The case of percolation on a tree is discussed first to help fix ideas, as the lack of cycles makes some aspects technically easier. Chapter 3 proves that \(p_{c}\) is equal to another key probability \(p_{T}=\sup \{p: \chi(p)<\infty\}\). (That \(p_{T}\leq p_{c}\) is obvious, the work is in the other direction). Part II proves the ``mean-field behaviour in high dimensions, including the results mentioned above about exponents: key concepts here include the so-called triangle condition, and the infrared bound which leads to a proof that the triangle condition holds in high dimensions, the main tool in the proof of the infrared bound being the so-called lace expansion which ultimately relies on inclusion-exclusion. So far the aim has been for the text to be self-contained, but Part III on some other recent results in high-dimensional percolation and Part IV on some related models are given with somewhat less detailed proofs. Many open problems are also presented.
- Generalized approach to the non-backtracking lace expansion
- On clusters of Brownian loops in d dimensions
- Percolation on hyperbolic graphs
- Fractal dimension of discrete sets and percolation
- The \(L^2\) boundedness condition in nonamenable percolation
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
- Harry Kesten's work in probability theory
- Power-law bounds for critical long-range percolation below the upper-critical dimension
- Phase transitions and percolation at criticality in enhanced random connection models
- Higher-order fluctuations in dense random graph models
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
- On the derivation of mean-field percolation critical exponents from the triangle condition
- Random walk on barely supercritical branching random walk
- Non-intersection of transient branching random walks
- Invariance principles for random walks in random environment on trees
- Spatial moments for high-dimensional critical contact process, oriented percolation and lattice trees
- Statistical physics on a product of trees
- Correction to: ``Random graph asymptotics on high-dimensional tori. II: Volume, diameter and mixing time
- Scaling limit for the ant in a simple high-dimensional labyrinth
- Critical site percolation in high dimension
- Critical percolation on scale-free random graphs: new universality class for the configuration model
- Mean-field behavior of nearest-neighbor oriented percolation on the BCC lattice above 8 + 1 dimensions
- Critical exponents for a percolation model on transient graphs
- Mean-field bound on the 1-arm exponent for Ising ferromagnets in high dimensions
- Percolation
- scientific article; zbMATH DE number 4076274 (Why is no real title available?)
- Percolation
- The critical 1-arm exponent for the ferromagnetic Ising model on the Bethe lattice
- scientific article; zbMATH DE number 195103 (Why is no real title available?)
- Continuity of percolation probability in ∞ + 1 dimensions
- Homology-changing percolation transitions on finite graphs
- Unwrapped two-point functions on high-dimensional tori
- Anisotropic oriented percolation in high dimensions
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- Restricted percolation critical exponents in high dimensions
- scientific article; zbMATH DE number 4197122 (Why is no real title available?)
- Hypercube percolation
- Expansion of Percolation Critical Points for Hamming Graphs
- Self-avoiding walk, spin systems and renormalization
- Sharp hierarchical upper bounds on the critical two-point function for long-range percolation on Zd
- Subcritical connectivity and some exact tail exponents in high dimensional percolation
- Self‐avoiding walk on the hypercube
- Slightly supercritical percolation on non‐amenable graphs I: The distribution of finite clusters
- Noise sensitivity of percolation via differential inequalities
- Broadcasting‐induced colorings of preferential attachment trees
- The near-critical two-point function and the torus plateau for weakly self-avoiding walk in high dimensions
- Comparison of limit shapes for Bernoulli first-passage percolation
- The critical two-point function for long-range percolation on the hierarchical lattice
- Slightly supercritical percolation on nonamenable graphs. II: Growth and isoperimetry of infinite clusters
- The direct-connectedness function in the random connection model
- High-dimensional near-critical percolation and the torus plateau
- Weakly self-avoiding walk on a high-dimensional torus
- Distances in \(\frac{1}{\|x-y\|^{2d}}\) percolation models for all dimensions
- Spin systems with hyperbolic symmetry: a survey
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- A branching process with deletions and mergers that matches the threshold for hypercube percolation
- Phase transition of disordered random networks on quasi-transitive graphs
- Percolation on irregular high-dimensional product graphs
- Critical exponents for marked random connection models
- Gaussian deconvolution and the lace expansion for spread-out models
- Lace expansion and mean-field behavior for the random connection model
- Mean-field behaviour of the random connection model on hyperbolic space
- Prudent walk in dimension six and higher
- Behavior of the distance exponent for \(\frac{1}{|x-y|^{2d}}\) long-range percolation
- Improved bounds for 1-independent percolation on \(\mathbb{Z}^n\)
- The torus plateau for the high-dimensional Ising model
- Critical and near-critical level-set percolation of the Gaussian free field on regular trees
- Critical cluster volumes in hierarchical percolation
- Decay of connection probability in high-dimensional continuum percolation
- Adelic models of percolation
- Continuity of the critical value and a shape theorem for long-range percolation
- Gaussian deconvolution and the lace expansion
- Pointwise two-point function estimates and a non-perturbative proof of mean-field critical behaviour for long-range percolation
- Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
- A lower bound for point-to-point connection probabilities in critical percolation
- Locality of the critical probability for transitive graphs of exponential growth
- Self-avoiding walk on the complete graph
- Mean-field critical behaviour for percolation in high dimensions
This page was built for publication: Progress in high-dimensional percolation and random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012668)
