Recurrent networks and a theorem of Nash-Williams

DOI10.1007/BF01046995zbMath0722.60069OpenAlexW2084823916MaRDI QIDQ756280

Sean McGuinness

Publication date: 1991

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01046995

zbMATH Keywords

random walkinfinite particle systemsrecurrent networkDirichlet principle for reversible Markov chains

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (5)

Some potential-theoretic techniques in non-reversible Markov chains ⋮ Delta-functions on recurrent random walks ⋮ The \(L^2\)-strong maximum principle on arbitrary countable networks ⋮ Induced graphs of uniform spanning forests ⋮ Conditions for recurrence and transience of a Markov chain on \(\mathbb Z^ +\) and estimation of a geometric success probability.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resistances and currents in infinite electrical networks
• Critical phenomena for Spitzer's reversible nearest particle systems
• A simple criterion for transience of a reversible Markov chain

This page was built for publication: Recurrent networks and a theorem of Nash-Williams