Weak reachability and strong recurrence for stochastic directed graphs in terms of auxiliary functions.
Corrado PossieriAndrew R. TeelPublished in: CDC (2016)
Keyphrases
- directed graph
- random walk
- stochastic optimization
- co occurrence
- learning automata
- transitive closure
- monte carlo
- directed acyclic graph
- disjoint paths
- data sets
- strongly connected
- web graph
- undirected graph
- graph structure
- social network analysis
- binary images
- collaborative filtering
- information extraction
- case study