Generalized K-Core Percolation in Networks with Community Structure

DOI10.1137/19M1290607zbMath1444.91179OpenAlexW3026387016MaRDI QIDQ5113802

Yilun Shang

Publication date: 17 June 2020

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/19m1290607

zbMATH Keywords

percolationcorecomplex networkcommunity structureresilience

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (5)

Generalized \(k\)-cores of networks under attack with limited knowledge ⋮ Generalized \(k\)-core percolation on higher-order dependent networks ⋮ Characterization of expansion-related properties of modular graphs ⋮ On the stability of citation networks ⋮ Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
• The core of a graph
• Asymptotic normality of the \(k\)-core in random graphs
• Core forging and local limit theorems for the \(k\)-core of random graphs
• Saving human lives: what complexity science and information systems can contribute
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Networks
• Community Detection in Networks via Nonlinear Modularity Eigenvectors
• Core-Periphery Structure in Networks (Revisited)
• Core-Periphery Structure in Networks
• Phase Transitions in Combinatorial Optimization Problems
• Elements of Phase Transitions and Critical Phenomena

This page was built for publication: Generalized K-Core Percolation in Networks with Community Structure