A short proof of the equivalence of left and right convergence for sparse graphs.
László Miklós LovászPublished in: Eur. J. Comb. (2016)
Keyphrases
- theorem proving
- gaussian graphical models
- directed acyclic
- graph matching
- sparse representation
- convergence rate
- sparse data
- spanning tree
- neural network
- high dimensional
- graph representation
- convergence speed
- bipartite graph
- graph clustering
- directed graph
- data sets
- graph mining
- graph structure
- dictionary learning
- random projections
- graph theoretic
- linear logic
- probabilistic model