Learning on Graphs with Partially Absorbing Random Walks: Theory and Practice
Learning on graphs has been studied for decades with abundant models proposed, yet many of their behaviors and relations remain unclear. This thesis fills this gap by introducing a novel second-order Markov chain, called partially absorbing random walks (ParWalk). Different from ordinary random walk...
Main Author: | Wu, Xiaoming |
---|---|
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | https://doi.org/10.7916/D8JW8F0C |
Similar Items
-
Random walks on graphs
by: Oosthuizen, Joubert
Published: (2014) -
Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory
by: Simmons, Dayton C. (Dayton Cooper)
Published: (1993) -
Markov chains : a graph theoretical approach
by: Marcon, Sinclair Antony
Published: (2013) -
Dimension spectrum and graph directed Markov systems.
by: Ghenciu, Eugen Andrei
Published: (2006) -
On efficient parallel algorithms for solving graph problems /
by: He, Xin
Published: (1987)