Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs.
Chaoyong LiZhihua QuDonglian QiFeng WangPublished in: Autom. (2019)
Keyphrases
- directed graph
- strongly connected
- random walk
- lower bound
- upper bound
- distributed systems
- undirected graph
- connected components
- distributed environment
- multi agent
- maximum flow
- upper and lower bounds
- directed acyclic graph
- finite number
- peer to peer
- disjoint paths
- accurate estimation
- graph structure
- lower and upper bounds
- error bounds
- estimation algorithm
- density estimation
- computing environments
- computer networks
- parameter estimation
- worst case
- cooperative