Computing an expected hitting time for the 3-urn Ehrenfest model via electric networks

DOI10.1016/j.spl.2017.03.013zbMath1380.60018OpenAlexW2600100002MaRDI QIDQ2406776

Yung-Pin Chen, Roger B. Nelsen, Isaac Goldstein, Eve D. Lathrop

Publication date: 6 October 2017

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2017.03.013

zbMATH Keywords

electric networkrandom walkhitting timeEhrenfest urn model

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Random walks on graphs (05C81)

Related Items

A New Method for Computing the Expected Hitting Time between Arbitrary Different Configurations of the Multiple–Urn Ehrenfest Model, Hydrodynamics of the generalized \(N\)-urn Ehrenfest model, On the distribution of the hitting time for the \(N\)-urn Ehrenfest model

Cites Work

• Effective graph resistance
• The electrical resistance of a graph captures its commute and cover times
• Mean transition times for the Ehrenfest urn model
• Fluctuation Theory for the Ehrenfest urn
• Another Look at the Ehrenfest Urn Via Electric Networks
• Fluctuation theory for the Ehrenfest urn via electric networks
• Random walks on dual Sierpinski gaskets