Average consensus on strongly connected weighted digraphs: A generalized error bound.
Eduardo MontijanoAndrea GasparriAttilio PrioloCarlos SagüésPublished in: Autom. (2015)
Keyphrases
- error bounds
- strongly connected
- directed graph
- undirected graph
- theoretical analysis
- worst case
- random walk
- optimum path forest
- finite sample
- machine learning
- graph structure
- directed acyclic graph
- equivalence classes
- wavelet synopses
- parzen window
- special case
- lower bound
- computational complexity
- image segmentation
- social networks