Random Walks on Graphs

By Peter Gerl. 2020

307 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Ernesto Estrada
2. Ken-ichi Kawarabayashi
3. Stefanie Sabrina Jegelka
4. Keyulu Xu
5. Ivan Gutman

In Geometry and Topology

1. Ernesto Estrada
2. Yonglong Tian

In Mathematical Physics

1. Ernesto Estrada

Citations in the corpus

• Representation Learning on Graphs with Jumping Knowledge Networks (2018, background): “In particular, our more formal analysis connects influence distributions with the spread of a random walk at a given node, a well-understood phenomenon as a function of the graph structure and eigenvalues (Lov´asz, 1993).”
• The ABC Matrix (2016, background): “(3.3) Notice that we consider the kinetic energy of the bond on the basis of assuming that each electron is a random walker that has probability of jumping to a nearest neighbor given by 1 ki (respectively 1 kk ) (Lovász (1993)).”