Random walks on dense graphs and graphons
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 differentia...
Main Authors: | Petit, J, Lambiotte, R, Carletti, T |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics
2021
|
Similar Items
-
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets
by: Ackerman, NL, et al.
Published: (2024) -
Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets
by: Ackerman, Nate, et al.
Published: (2024) -
Random walk on temporal networks with lasting edges
by: Petit, J, et al.
Published: (2018) -
Centrality measures for graphons: accounting for uncertainty in networks
by: Avella-Medina, M, et al.
Published: (2018) -
Using graphone models in automatic speech recognition
by: Wang, Stanley Xinlei
Published: (2010)