Proves finiteness of λ_c(μ) for the 1D renewal contact process when interarrival distributions are arithmetic or have uniformly small atomic components on short intervals.
Grimmett,What is Percolation?Berlin, Heidelberg: Springer Berlin Heidelberg, 1999, pp
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Coupled lasers in a 100-site array map percolation to phase locking with a threshold matching classical predictions, but nonlinear mode competition at low pump alters the transition nature.
A hybrid GHZ-BSM routing strategy outperforms pure BSM routing in square grid quantum networks but requires global-information adaptations to beat BSM in complex topologies such as Waxman, scale-free, and SURFnet.
Implicit formula for critical curve α_c(κ) of loop percolation on d-regular trees, positive for κ>κ_c=2√(d-1)/d-1, with mean-field exponents for κ>κ_c and quadratic percolation probability at κ=κ_c.
citing papers explorer
-
Improved Survival Results for the One-Dimensional Renewal Contact Process
Proves finiteness of λ_c(μ) for the 1D renewal contact process when interarrival distributions are arithmetic or have uniformly small atomic components on short intervals.
-
Percolation with coupled lasers: effect of non-linearities on the phase transition
Coupled lasers in a 100-site array map percolation to phase locking with a threshold matching classical predictions, but nonlinear mode competition at low pump alters the transition nature.
-
Routing Entanglement in Complex Quantum Networks Using GHZ States
A hybrid GHZ-BSM routing strategy outperforms pure BSM routing in square grid quantum networks but requires global-information adaptations to beat BSM in complex topologies such as Waxman, scale-free, and SURFnet.
-
Critical curve of loop percolation on the $d$-regular tree
Implicit formula for critical curve α_c(κ) of loop percolation on d-regular trees, positive for κ>κ_c=2√(d-1)/d-1, with mean-field exponents for κ>κ_c and quadratic percolation probability at κ=κ_c.