Cited By
View all- Berenbrink PKlasing RKosowski AMallmann-Trenn FUznański P(2018)Improved Analysis of Deterministic Load-Balancing SchemesACM Transactions on Algorithms10.1145/328243515:1(1-22)Online publication date: 16-Nov-2018
Deterministic random walks on finite graphs
Abstract
No abstract available.
References
[1]
H.Akbari and P.Berenbrink, Parallel rotor walks on finite graphs and applications in discrete load balancing, In Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures SPAA 2013, Montreal, QC, Canada, 2013, pp. pp.186-195.
[2]
S.Angelopoulos, B.Doerr, A.Huber, and K.Panagiotou, Tight bounds for quasirandom rumor spreading, Electron J Comb Volume 16 2009, pp.R102.
[3]
E.Bampas, L.Gasieniec, N.Hanusse, D.Ilcinkas, R.Klasing, and A.Kosowski, Euler tour lock-in problem in the rotor-router model, Lect Notes Comput Sci Volume 5805 2009, pp.423-435.
[4]
A. E.Brouwer, A. M.Cohen, and A.Neumaier, Distance-regular graphs, Springer-Verlag, Berlin, 1989.
[5]
J.Cooper, B.Doerr, T.Friedrich, and J.Spencer, Deterministic random walks on regular trees, Random Struct Algorithms Volume 37 2010, pp.353-366.
[6]
J.Cooper, B.Doerr, J.Spencer, and G.Tardos, Deterministic random walks on the integers, Eur J Comb Volume 28 2007, pp.2072-2090.
[7]
J.Cooper and J.Spencer, Simulating a random walk with constant error. Comb Probab Comput Volume 15 Issue 2006, pp.815-822.
[8]
P.Dagum, M.Luby, M.Mihail, and U. V.Vazirani, Polytopes, permanents and graphs with large factors, In Proceedings of the 29th Annual Symposium on Foundations of Computer Science FOCS 1988, White Plains, NY, USA, 1988, pp. pp.412-421.
[9]
B.Doerr, Introducing quasirandomness to computer science, Lect Notes Comput Sci Volume 5760 2009, pp.99-111.
[10]
B.Doerr and T.Friedrich, Deterministic random walks on the two-dimensional grid, Comb Probab Comput Volume 18 2009, pp.123-144.
[11]
B.Doerr, T.Friedrich, M.Künnemann, and T.Sauerwald, Quasirandom rumor spreading: An experimental analysis, ACM J Exp Algorithmics Volume 16 2011, Article 3.3.
[12]
B.Doerr, T.Friedrich, and T.Sauerwald, Quasirandom rumor spreading, In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2008, San Francisco, CA, USA, 2008, pp. 773- pp.781.
[13]
B.Doerr, T.Friedrich, and T.Sauerwald, Quasirandom rumor spreading: Expanders, push vs. pull, and robustness, In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, Rhodes, Greece, 2009, pp. 366- pp.377.
[14]
B.Doerr, T.Friedrich, and T.Sauerwald, Quasirandom rumor spreading on expanders, Electron Notes Discrete Math Volume 34 2009, pp.243-247.
[15]
B.Doerr, A.Huber, and A.Levavi, Strong robustness of randomized rumor spreading protocols, Discrete Appl Math Volume 161 2013, pp.778-793.
[16]
N.Fountoulakis and A.Huber, Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading, SIAM J Discrete Math Volume 23 2009, pp.1964-1991.
[17]
T.Friedrich and T.Sauerwald, The cover time of deterministic random walks, Electron J Comb Volume 17 2010, pp.R167.
[18]
A. E.Holroyd and J.Propp, Rotor walks and Markov chains, In M.Lladser, R. S. Maier, M.Mishna, and A.Rechnitzer, editors, Algorithmic probability and combinatorics, The American Mathematical Society, 2010, pp. pp.105-126.
[19]
S.Kijima, K.Koga, and K.Makino, Deterministic random walks on finite graphs, In Proceedings of Analytic Algorithmics and Combinatorics ANALCO 2012, Kyoto, Japan, 2012, pp. pp.16-25.
[20]
M.Kleber, Goldbug variations, Math Intell Volume 27 2005, pp.55-63.
[21]
G. F.Lawler, Subdiffusive flunctuations for internal diffusion limited aggregation, Ann Probab Volume 23 1995, pp.71-86.
[22]
G. F.Lawler, M.Bramson, and D.Griffeath, Internal diffusion limited aggregation, Ann Probab Volume 20 1992, pp.2117-2140.
[23]
L.Levine and Y.Peres, The rotor-router shape is spherical, Math Intell Volume 27 2005, pp.9-11.
[24]
L.Levine and Y.Peres, Spherical asymptotics for the rotor-router model in, Indiana Univ Math J Volume 57 2008, pp.431-450.
[25]
L.Levine and Y.Peres, Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile, Potential Anal Volume 30 2009, pp.1-27.
[26]
D. A.Levin, Y.Peres, E. L.Wilmer, Markov chains and mixing times, American Mathematical Society, Providence, 2008.
[27]
A.Sinclair, Algorithms for random generation and counting, a Markov chain approach, Birkhäuser, Boston, 1993.
[28]
I.Wagner, M.Lindenbaum, and A.Bruckstein. Distributed covering by ant-robots using evaporating traces, IEEE Trans Robot Autom Volume 15 1999, pp.918-933.
Index Terms
- Deterministic random walks on finite graphs
Index terms have been assigned to the content through auto-classification.
Recommendations
Proppian random walks in Z
The Propp Machine is a deterministic process that simulates a random walk. Instead of distributing chips randomly, each position makes the chips move according to the walk's possible steps in a fixed order. A random walk is called Proppian if at each ...
Short Random Walks on Graphs
The short-term behavior of random walks on graphs is studied, in particular, the rate at which a random walk discovers new vertices and edges. A conjecture by Linial that the expected time to find $\cal N$ distinct vertices is $O({\cal N}^{3})$ is ...
How slow, or fast, are standard random walks?: analysis of hitting and cover times on trees
CATS '11: Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119Random walk is a powerful tool, not only for modeling, but also for practical use such as the Internet crawlers. Standard random walks on graphs have been well studied; It is well-known that both hitting time and cover time of a standard random walk are ...
Comments
Information & Contributors
Information
Published In
Publisher
John Wiley & Sons, Inc.
United States
Publication History
Published: 01 July 2015
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Sep 2024
Other Metrics
Citations
Cited By
View all- Berenbrink PKlasing RKosowski AMallmann-Trenn FUznański P(2018)Improved Analysis of Deterministic Load-Balancing SchemesACM Transactions on Algorithms10.1145/328243515:1(1-22)Online publication date: 16-Nov-2018
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in