Balanced Hodge Laplacians optimize consensus dynamics over simplicial complexes

DOI10.1063/5.0080370MaRDI QIDQ6561204zbMATH OpenFDO

Authors Cameron Ziegler, Per Sebastian Skardal, Haimonti Dutta, Dane Taylor

Publication date 24 June 2024

Published in Chaos (Search for Journal in Brave)

zbMATH Keywords

Laplacian matrixnetwork dynamics

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial aspects of simplicial complexes (05E45)

Cites work

• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Consensus formation on a simplicial complex of opinions
• Consensus on simplicial complexes: results on stability and synchronization
• Data-Dependent Convergence for Consensus Stochastic Optimization
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Hodge Laplacians on graphs
• Persistent homology of complex networks
• Random walks on simplicial complexes and harmonics
• Random walks on simplicial complexes and the normalized Hodge 1-Laplacian

Cited in

(5)

• Dirac signal processing of higher-order topological signals
• Ranking edges by their impact on the spectral complexity of information diffusion over networks
• Quantum entropy couples matter with geometry
• Dynamics on networks with higher-order interactions
• Hypergraphon mean field games

This page was built for publication: Balanced Hodge Laplacians optimize consensus dynamics over simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561204)