Infinite Ergodic Walks in Finite Connected Undirected Graphs.
Dimitri VolchenkovPublished in: Entropy (2021)
Keyphrases
- undirected graph
- connected components
- directed graph
- finite sets
- directed acyclic graph
- approximation algorithms
- real numbers
- spanning tree
- disjoint paths
- vertex set
- binary images
- strongly connected
- complex networks
- minimum cost
- positive integer
- graph structure
- random graphs
- markov chain
- markov models
- random walk
- image processing
- undirected graphical models
- pairwise
- data structure