Login / Signup

Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph.

Vsevolod ChernyshevAnton Tolchennikov
Published in: Electron. Notes Discret. Math. (2018)
Keyphrases
  • random walk
  • endpoints
  • directed graph
  • nodes of a graph
  • markov chain
  • markov random walk
  • link prediction
  • graph laplacian
  • flow graph
  • average degree
  • distance measure
  • transition probabilities
  • hyper graph
  • graph structure