Generalized K-core percolation in networks with community structure
From MaRDI portal
Publication:5113802
Recommendations
Cites work
- scientific article; zbMATH DE number 51785 (Why is no real title available?)
- A first course in network theory
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
- Asymptotic normality of the \(k\)-core in random graphs
- Community detection in networks via nonlinear modularity eigenvectors
- Community structure in social and biological networks
- Complex networks. Structure, robustness and function.
- Core forging and local limit theorems for the \(k\)-core of random graphs
- Core-periphery structure in networks
- Core-periphery structure in networks (revisited)
- Elements of phase transitions and critical phenomena
- Networks
- Phase Transitions in Combinatorial Optimization Problems
- Saving human lives: what complexity science and information systems can contribute
- The Structure and Function of Complex Networks
- The core of a graph
Cited in
(9)- Characterization of expansion-related properties of modular graphs
- \(k\)-core organization in complex networks
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks
- Robustness of interdependent higher-order networks
- Generalized \(k\)-core percolation on higher-order dependent networks
- On the stability of citation networks
- Generalized \(k\)-core pruning process on directed networks
- Generalized \(k\)-cores of networks under attack with limited knowledge
This page was built for publication: Generalized \(K\)-core percolation in networks with community structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113802)