Optimal hypothesis testing with combinatorial structure: Detecting random walks on graphs.

Ameya Agaskar Yue M. Lu

Published in: ACSSC (2014)

Keyphrases

random walk
hypothesis testing
directed graph
likelihood ratio
spectral methods
web graph
graph structure
flow graph
average degree
markov chain
optimal solution
robust statistical
transition probabilities
link prediction
upper bound
likelihood ratio test
graph mining
graphical models
data mining
nodes of a graph