Name
Abstract | ||
|---|---|---|
The quantities of coefficient of ergodicity and algebraic connectivity have been used to estimate the convergence rates of discrete-time and continuous-time network consensus algorithms respectively. Both of these two quantities are defined with respect to network topologies without the symmetry assumption, and they are applicable to the case when network topologies change with time. We present results identifying deterministic network topologies that optimize these quantities. We will also propose heuristics that can accelerate convergence in random networks by redirecting a small portion of the links assuming that the network topology is controllable. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ISCAS.2007.378145 | ISCAS |
Keywords | Field | DocType |
continuous-time network consensus algorithms,coefficient of ergodicity,algebraic connectivity,topology design,deterministic network topologies,network topology,convergence rates estimation,discrete-time network consensus algorithms,continuous time systems,convergence of numerical methods,discrete time systems,directed graphs,fast convergence,convergence rate,cost function,discrete time,acceleration,control systems,autonomous agents,computer networks,convergence,algorithm design and analysis,concurrent computing | Convergence (routing),Mathematical optimization,Weak topology,Comparison of topologies,Computer science,Compact convergence,Network topology,Algebraic connectivity,Heuristics,Extension topology | Conference |
ISSN | ISBN | Citations |
0271-4302 | 1-4244-0921-7 | 11 |
PageRank | References | Authors |
0.93 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming Cao | 1 | 2343 | 249.61 |
| Chai Wah Wu | 2 | 330 | 67.62 |