Core-Periphery Detection in Hypergraphs
From MaRDI portal
Publication:5885829
DOI10.1137/22M1480926MaRDI QIDQ5885829
Desmond J. Higham, Francesco Tudisco
Publication date: 30 March 2023
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.12769
Related Items (4)
Nonlinear Perron--Frobenius Theorems for Nonnegative Tensors ⋮ Even order uniform hypergraph via the Einstein product ⋮ Comparing the principal eigenvector of a hypergraph and its shadows ⋮ Quantifying the structural stability of simplicial homology
Cites Work
- Networks beyond pairwise interactions: structure and dynamics
- Laplacian eigenvalues and partition problems in hypergraphs
- On the spectrum of hypergraphs
- A graph-theoretical approach for the analysis and model reduction of complex-balanced chemical reaction networks
- A network dynamics approach to chemical reaction networks
- Nonlinear Perron–Frobenius Theory
- On the Laplacian Spectrum and Walk-regular Hypergraphs
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- Detection of core–periphery structure in networks using spectral methods and geodesic paths
- Graph partitions and cluster synchronization in networks of oscillators
- Network partition via a bound of the spectral radius
- The Why, How, and When of Representations for Complex Systems
- Higher-Order Networks
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- Three Hypergraph Eigenvector Centralities
- Consensus Dynamics and Opinion Formation on Hypergraphs
- Hypergraph Cuts with General Splitting Functions
- A framework for second-order eigenvector centralities and clustering coefficients
- Cheeger Inequalities for Submodular Transformations
- Core-Periphery Structure in Networks (Revisited)
This page was built for publication: Core-Periphery Detection in Hypergraphs
