Balanced Hodge Laplacians optimize consensus dynamics over simplicial complexes
From MaRDI portal
Publication:6561204
DOI10.1063/5.0080370zbMATH Open1542.05188MaRDI QIDQ6561204
P. S. Skardal, Haimonti Dutta, Cameron Ziegler, Dane Taylor
Publication date: 24 June 2024
Published in: Chaos (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Convex programming (90C25) Nonlinear programming (90C30) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Consensus formation on a simplicial complex of opinions
- Random walks on simplicial complexes and harmonics
- Persistent homology of complex networks
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Data-Dependent Convergence for Consensus Stochastic Optimization
- Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian
- Hodge Laplacians on Graphs
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus on simplicial complexes: Results on stability and synchronization
Related Items (5)
Quantum entropy couples matter with geometry ⋮ Dynamics on networks with higher-order interactions ⋮ Dirac signal processing of higher-order topological signals ⋮ Hypergraphon mean field games ⋮ Ranking edges by their impact on the spectral complexity of information diffusion over networks
This page was built for publication: Balanced Hodge Laplacians optimize consensus dynamics over simplicial complexes
