Biased random walks on random graphs

2014/06/19 by Gérard Ben Arous, Arous, Gerard Ben, Alexander Fribergh +1 · 1 citation
Computer Science · Mathematics · #Algorithms and Data Compression #FOS: Mathematics #Limits and Structures in Graph Theory #Probability (math.PR) #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.1406.5076

openalex publication_date 2014/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

These notes cover one of the topics programmed for the St Petersburg School in Probability and Statistical Physics of June 2012. The aim is to review recent mathematical developments in the field of random walks in random environment. Our main focus will be on directionally transient and reversible random walks on different types of underlying graph structures, such as ℤ, trees and ℤ^d for d≥ 2.

Citations

• The stochastic geometry of invasion percolation

Cited by

• Quenched scaling limit for biased random walks on random, heavy tailed conductances: low dimensions

Related

• A random walk among random graphs
• Random Walk in Changing Environment
• Variations on Reinforced Random Walks
• Random walk in random environment and their time-reversed counterpart
• An introduction to the trapping experienced by biased random walk on the trace of biased random walk