Hearing the clusters of a graph: A distributed algorithm
From MaRDI portal
Publication:445023
DOI10.1016/j.automatica.2011.09.019zbMath1244.93016arXiv0911.4729OpenAlexW2963662649MaRDI QIDQ445023
Andrzej Banaszuk, Alberto Speranzon, Tuhin Sahai
Publication date: 24 August 2012
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4729
Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15) Large-scale systems (93A15)
Related Items (17)
Admissible output consensualization control for singular multi-agent systems with time delays ⋮ Seeking community structure in networks via biogeography-based optimization with consensus dynamics ⋮ Leader-follower guaranteed-cost consensualization for high-order linear swarm systems with switching topologies ⋮ Fast distributed algebraic connectivity estimation in large scale networks ⋮ Spectral echolocation via the wave embedding ⋮ Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems ⋮ Spectrum Consistent Coarsening Approximates Edge Weights ⋮ Spectral complexity of directed graphs and application to structural decomposition ⋮ An efficient algorithm for the parallel solution of high-dimensional differential equations ⋮ Spectral Identification of Networks Using Sparse Measurements ⋮ Dynamical Systems Theory and Algorithms for NP-hard Problems ⋮ On the advantage of overlapping clusters for minimizing conductance ⋮ Step-size sequence design for finite-time average consensus in secure wireless sensor networks ⋮ Polynomial chaos based uncertainty quantification in Hamiltonian, multi-time scale, and chaotic systems ⋮ Continuous relaxations for the traveling salesman problem ⋮ A Filter‐based Clock Synchronization Protocol for Wireless Sensor Networks ⋮ On Nonintrusive Uncertainty Quantification and Surrogate Model Construction in Particle Accelerator Modeling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm for the parallel solution of high-dimensional differential equations
- Towards a theoretical foundation for Laplacian-based manifold methods
- Wave equations for graphs and the edge-based Laplacian
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
- Gossip Algorithms
- Distributed Kalman Filtering and Sensor Fusion in Sensor Networks
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Communities in Networks
- An Efficient Heuristic Procedure for Partitioning Graphs
- A simple min-cut algorithm
- Community structure in social and biological networks
- Fastest Mixing Markov Chain on a Graph
- Learning Theory
- Uniform Convergence of Adaptive Graph-Based Regularization
- Graph Laplacian Tomography From Unknown Random Projections
- Learning Theory
- Can One Hear the Shape of a Drum?
- A decentralized algorithm for spectral analysis
This page was built for publication: Hearing the clusters of a graph: A distributed algorithm
