• Corpus ID: 18329687

Random walks on graphs

@inproceedings{Sodin2004RandomWO,
  title={Random walks on graphs},
  author={Sodin},
  year={2004}
}
  • Sodin
  • Published 2004
  • Mathematics
Most of the material in this handout is taken from: Daniel Spielman, Spectral and Algebraic Graph Theory. Manuscript, 2019. Let A be the adjacency matrix of a graph G. We use α1 ≥ · · · ≥ αn to denote the eigenvalues of A (note that they are ordered in the opposite direction with respect to the eigenvalues λ1 ≤ · · · ≤ λn of the Laplacian matrix L). If G is d-regular, then L = I − 1 dA and therefore λi = 1− αi d . Since λi ∈ [0, 2] for any G (even not regular), we have that αi ∈ [−d, d] for any… 

Figures from this paper

Algorithmic aspects of M -Lipschitz mappings of graphs

  • Jan Bok
  • Mathematics, Computer Science
  • 2018
This work studies two natural problems regarding graph-indexed random walks and presents the first algorithmic treatment of Lipschitz mappings of graphs, which yields a better run-time complexity for a specific family of its instances.

Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties

It is proved that, given a Laplacian matrix, it is possible to perturb the weights of the existing edges in the underlying graph in order to obtain simple eigenvalues and a Fiedler vector composed of only nonzero entries.

Structural Aspects of Graph Homomorphisms

This thesis is about graph-indexed random walks, Lipschitz mappings and graph homomorphisms. It discusses connections between these notions, surveys the existing results, and shows new results. Graph

High Dimensional Random Walks and Colorful Expansion

It is proved that if the $1$-dimensional skeletons of all the links of a complex are spectral expanders, then for $0 \le i < d$ the high order random walk on dimension $i$ converges rapidly to its stationary distribution.

APPROXIMATING GRAPH CONDUCTANCE: FROM GLOBAL TO LOCAL

This expository paper introduces spectral algorithms and random walk based algorithms on graphs through the problem of finding sparse cuts in both global and local settings and discusses how to gain information about conductance from the convergence of random walks, and motivate convergence bounds related to local conductance.

Density Independent Algorithms for Sparsifying k-Step Random Walks

We give faster algorithms for producing sparse approximations of the transition matrices of k-step random walks on undirected and weighted graphs. These transition matrices also form graphs, and

Discrete Quantum Walks on the Symmetric Group

The theory of random walks on finite graphs is well developed with numerous appli-cations. In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the

Algorithmic aspects of graph-indexed random walks

  • Jan Bok
  • Mathematics, Computer Science
    ArXiv
  • 2018
It is shown that while the first problem is $\#$P-complete, the other two problems can be solved in polynomial time.

Random walks on graphs with interval weights and precise marginals

  • D. Škulj
  • Computer Science, Mathematics
    Int. J. Approx. Reason.
  • 2016
...

References

SHOWING 1-5 OF 5 REFERENCES

Random Walks on Graphs: A Survey

Estimates on the important parameters of access time, commute time, cover time and mixing time are discussed and recent algorithmic applications of random walks are sketched, in particular to the problem of sampling.

Random walks and electric networks

The goal will be to interpret Polya’s beautiful theorem that a random walker on an infinite street network in d-dimensional space is bound to return to the starting point when d = 2, but has a positive probability of escaping to infinity without returning to the Starting Point when d ≥ 3, and to prove the theorem using techniques from classical electrical theory.

Motwani and Raghavan

  • Motwani and Raghavan

Wilf

  • Wilf

Grinstead and Snell

  • Grinstead and Snell