Topology and spectral interconnectivities of higher-order multilayer networks
May 10, 2023 Β· Declared Dead Β· π Frontiers in Complex Systems
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
ElkaΓ―oum M. Moutuou, ObaΓ― B. K. Ali, Habib Benali
arXiv ID
2305.05860
Category
math.AT
Cross-listed
cs.SI,
math.SP,
physics.soc-ph
Citations
4
Venue
Frontiers in Complex Systems
Last Checked
3 months ago
Abstract
Multilayer networks have permeated all the sciences as a powerful mathematical abstraction for interdependent heterogenous complex systems such as multimodal brain connectomes, transportation, ecological systems, and scientific collaboration. But describing such systems through a purely graph-theoretic formalism presupposes that the interactions that define the underlying infrastructures and support their functions are only pairwise-based; a strong assumption likely leading to oversimplifications. Indeed, most interdependent systems intrinsically involve higher-order intra- and inter-layer interactions. For instance, ecological systems involve interactions among groups within and in-between species, collaborations and citations link teams of coauthors to articles and vice versa, interactions might exist among groups of friends from different social networks, etc. While higher-order interactions have been studied for monolayer systems through the language of simplicial complexes and hypergraphs, a broad and systematic formalism incorporating them into the realm of multilayer systems is still lacking. Here, we introduce the concept of crossimplicial multicomplexes as a general formalism for modelling interdependent systems involving higher-order intra- and inter-layer connections. Subsequently, we introduce cross-homology and its spectral counterpart, the cross-Laplacian operators, to establish a rigorous mathematical framework for quantifying global and local intra- and inter-layer topological structures in such systems. When applied to multilayer networks, these cross-Laplacians provide powerful methods for detecting clusters in one layer that are controlled by hubs in another layer. We call such hubs spectral cross-hubs and define spectral persistence as a way to rank them according to their emergence along the cross-Laplacian spectra.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.AT
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Persistence Diagrams with Linear Machine Learning Models
R.I.P.
π»
Ghosted
Comparing persistence diagrams through complex vectors
R.I.P.
π»
Ghosted
A Riemannian Framework for Statistical Analysis of Topological Persistence Diagrams
R.I.P.
π»
Ghosted
Path homologies of deep feedforward networks
R.I.P.
π»
Ghosted
From trees to barcodes and back again: theoretical and statistical perspectives
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted