Finding a marked node on any graph by continuous time quantum walk.
Shantanav ChakrabortyLeonardo NovoJérémie RolandPublished in: CoRR (2018)
Keyphrases
- graph structure
- random walk
- directed graph
- strongly connected
- undirected graph
- maximum clique
- graph representation
- tree structure
- root node
- edge weights
- graph theory
- markov chain
- graph model
- overlapping communities
- markov processes
- path length
- betweenness centrality
- finding the shortest path
- nodes of a graph
- graph theoretic
- spanning tree
- directed acyclic graph
- weighted graph
- graph matching
- connected components
- graphical models
- state space
- dynamic programming
- social networks