Estimating Undirected Graphs Under Weak Assumptions.
Larry A. WassermanMladen KolarAlessandro RinaldoPublished in: CoRR (2013)
Keyphrases
- undirected graph
- directed graph
- approximation algorithms
- directed acyclic graph
- spanning tree
- positive integer
- complex networks
- disjoint paths
- minimum cost
- markov models
- connected components
- multicommodity flow
- vertex set
- random walk
- random graphs
- strongly connected
- np hard
- graph structure
- graphical models
- undirected graphical models
- higher order
- probabilistic model
- average degree
- computational complexity