Random Walks on Random Graphs

2009 ◽  
pp. 95-106 ◽  
Author(s):  
Colin Cooper ◽  
Alan Frieze
Keyword(s):  
Random Walks ◽  
Random Graphs

scholarly journals Preferential duplication graphs

2010 ◽  
Vol 47 (02) ◽  
pp. 572-585 ◽  
Author(s):  
Netta Cohen ◽  
Jonathan Jordan ◽  
Margaritis Voliotis
Keyword(s):  
Random Walks ◽  
Stochastic Approximation ◽  
Random Graphs ◽  
Reinforced Random Walks ◽  
Special Case

We consider a preferential duplication model for growing random graphs, extending previous models of duplication graphs by selecting the vertex to be duplicated with probability proportional to its degree. We show that a special case of this model can be analysed using the same stochastic approximation as for vertex-reinforced random walks, and show that ‘trapping’ behaviour can occur, such that the descendants of a particular group of initial vertices come to dominate the graph.

scholarly journals On the trace of random walks on random graphs

2017 ◽  
Vol 116 (4) ◽  
pp. 847-877
Author(s):  
Alan Frieze ◽  
Michael Krivelevich ◽  
Peleg Michaeli ◽  
Ron Peled
Keyword(s):  
Random Walks ◽  
Random Graphs

scholarly journals Random Walks with Lookahead on Power Law Random Graphs

2006 ◽  
Vol 3 (2) ◽  
pp. 147-152 ◽  
Author(s):  
Milena Mihail ◽  
Amin Saberi ◽  
Prasad Tetali
Keyword(s):  
Random Walks ◽  
Random Graphs ◽  
Power Law

scholarly journals Large deviations of random walks on random graphs

2019 ◽  
Vol 99 (2) ◽  
Author(s):  
Francesco Coghi ◽  
Jules Morand ◽  
Hugo Touchette
Keyword(s):  
Large Deviations ◽  
Random Walks ◽  
Random Graphs

scholarly journals Cutoff for nonbacktracking random walks on sparse random graphs

2017 ◽  
Vol 45 (3) ◽  
pp. 1752-1770 ◽  
Author(s):  
Anna Ben-Hamou ◽  
Justin Salez
Keyword(s):  
Random Walks ◽  
Random Graphs

scholarly journals Preferential duplication graphs

2010 ◽  
Vol 47 (2) ◽  
pp. 572-585 ◽  
Author(s):  
Netta Cohen ◽  
Jonathan Jordan ◽  
Margaritis Voliotis
Keyword(s):  
Random Walks ◽  
Stochastic Approximation ◽  
Random Graphs ◽  
Reinforced Random Walks ◽  
Special Case

We consider a preferential duplication model for growing random graphs, extending previous models of duplication graphs by selecting the vertex to be duplicated with probability proportional to its degree. We show that a special case of this model can be analysed using the same stochastic approximation as for vertex-reinforced random walks, and show that ‘trapping’ behaviour can occur, such that the descendants of a particular group of initial vertices come to dominate the graph.

Sign in / Sign up

Export Citation Format

Share Document