Percolation threshold for metric graph loop soup
From MaRDI portal
(Redirected from Percolation threshold for metric graph loop soup)
Percolation threshold for metric graph loop soup (scientific article; zbMATH DE number 7898720)
Percolation threshold for metric graph loop soup (scientific article; zbMATH DE number 7898720)
Recommendations
- Loop percolation on discrete half-plane
- Percolation for level-sets of Gaussian free fields on metric graphs
- Supercritical loop percolation on \(\mathbb{Z}^d\) for \(d \geq 3\)
- Infinite graphs with a nontrivial Bond percolation threshold: some sufficient conditions
- scientific article; zbMATH DE number 3998945
Cites work
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- Bounds on the distributions of extremal values of a scanning process
- Cluster capacity functionals and isomorphism theorems for Gaussian free fields
- Conformal loop ensembles: the Markovian characterization and the loop-soup construction
- From loop clusters and random interlacements to the free field
- scientific article; zbMATH DE number 3785894 (Why is no real title available?)
- Loop percolation on discrete half-plane
- Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
- Markovian loop clusters on graphs
- Percolation for the Gaussian free field on the cable system: counterexamples
- Phase transition in loop percolation
- Random walk loop soup
- Supercritical loop percolation on \(\mathbb{Z}^d\) for \(d \geq 3\)
- The Brownian loop soup
- The supercritical phase of percolation is well behaved
Cited in
(2)
This page was built for publication: Percolation threshold for metric graph loop soup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589594)
