Title
RANDOM WALKS ON DENSE GRAPHS AND GRAPHONS
Abstract
Graph-limit theory focuses on the convergence of sequences of increasingly large graphs, providing a framework for the study of dynamical systems on massive graphs, where classical methods would become computationally intractable. Through an approximation procedure, the standard ordinary differential equations are replaced by nonlocal evolution equations on the unit interval. In this work, we adopt this methodology to prove the validity of the continuum limit of random walks, a largely studied model for diffusion on graphs. We focus on two classes of processes on dense weighted graphs, in discrete and in continuous time, whose dynamics are encoded in the transition matrix of the associated Markov chain or in the random-walk Laplacian. We further show that previous works on the discrete heat equation, associated to the combinatorial Laplacian, fall within the scope of our approach. Finally, we characterize the relaxation time of the process in the continuum limit.
Year
DOI
Venue
2021
10.1137/20M1339246
SIAM JOURNAL ON APPLIED MATHEMATICS
Keywords
DocType
Volume
Key words, random walk, dense graph, graphon, continuum limit
Journal
81
Issue
ISSN
Citations 
6
0036-1399
0
PageRank 
References 
Authors
0.34
16
3
Name
Order
Citations
PageRank
Petit Julien100.34
Renaud Lambiotte292064.98
T Carletti33714.43