scholarly journals Fiedler Vector Approximation via Interacting Random Walks

Author(s):  
Vishwaraj Doshi ◽  
Do Young Eun
2020 ◽  
Vol 48 (1) ◽  
pp. 101-102
Author(s):  
Vishwaraj Doshi ◽  
Do Young Eun

2007 ◽  
pp. 1521-1574
Author(s):  
Francis Comets ◽  
Martin Zerner

2019 ◽  
Vol 175 (1) ◽  
pp. 71-96 ◽  
Author(s):  
Svante Janson ◽  
Vadim Shcherbakov ◽  
Stanislav Volkov

2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Serguei Yu. Popov

International audience We review some recent results for a system of simple random walks on graphs, known as \emphfrog model. Also, we discuss several modifications of this model, and present a few open problems. A simple version of the frog model can be described as follows: There are active and sleeping particles living on some graph. Each active particle performs a simple random walk with discrete time and at each moment it may disappear with probability 1-p. When an active particle hits a sleeping particle, the latter becomes active.


2017 ◽  
Vol 49 (2) ◽  
pp. 327-343 ◽  
Author(s):  
Arka Ghosh ◽  
Steven Noren ◽  
Alexander Roitershtein

Abstract We observe the frog model, an infinite system of interacting random walks, on ℤ with an asymmetric underlying random walk. For certain initial frog distributions we construct an explicit formula for the moments of the leftmost visited site, as well as their asymptotic scaling limits as the drift of the underlying random walk vanishes. We also provide conditions in which the lower bound can be scaled to converge in probability to the degenerate distribution at 1 as the drift vanishes.


Sign in / Sign up

Export Citation Format

Share Document