\(k\)-core architecture and \(k\)-core percolation on complex networks

DOI10.1016/j.physd.2006.09.027zbMath1130.94024OpenAlexW2042657449WikidataQ59280472 ScholiaQ59280472MaRDI QIDQ858495

J. F. F. Mendes, S. N. Dorogovtsev, Alexander Goltsev

Publication date: 9 January 2007

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physd.2006.09.027

zbMATH Keywords

complex networksbootstrap percolation\(k\)-cores

Mathematics Subject Classification ID

Percolation (82B43) Applications of graph theory to circuits and networks (94C15)

Related Items (24)

Inhomogeneous site percolation on an irregular Bethe lattice with random site distribution ⋮ Bootstrap percolation in living neural networks ⋮ Based on agent model and \(K\)-core decomposition to analyze the diffusion of mass incident in microblog ⋮ Hierarchical cycle-tree packing model for optimal \(K\)-core attack ⋮ Finding density-based subspace clusters in graphs with feature vectors ⋮ Network-complement transitions, symmetries, and cluster synchronization ⋮ Fast algorithms for determining (generalized) core groups in social networks ⋮ Network Centrality: An Introduction ⋮ Percolation on complex networks: theory and application ⋮ Evolutionary potential games on lattices ⋮ Recent advances in percolation theory and its applications ⋮ The Kuramoto model in complex networks ⋮ Explosive transitions in complex networks' structure and dynamics: percolation and synchronization ⋮ Single polygon counting on Cayley tree of order 3 ⋮ Navigation in spatial networks: a survey ⋮ Identifying and ranking influential spreaders in complex networks by neighborhood coreness ⋮ Interaction in agent-based economics: a survey on the network approach ⋮ Degree sequences of monocore graphs ⋮ Sufficient conditions of endemic threshold on metapopulation networks ⋮ Statistical mechanics of complex systems for pattern identification ⋮ Diagnosing and predicting the Earth's health via ecological network analysis ⋮ Using Epidemic Hoarding to Minimize Load Delays in P2P Distributed Virtual Environments ⋮ Percolation thresholds for robust network connectivity ⋮ Dragging in mutualistic networks

Cites Work

• Unnamed Item
• Unnamed Item
• The asymptotic number of labeled graphs with given degree sequences
• Metric structure of random networks
• Differential equations for random processes and random graphs
• Sudden emergence of a giant \(k\)-core in a random graph
• Community structure in social and biological networks
• A critical point for random graphs with a given degree sequence
• The birth of the infinite cluster: Finite-size scaling in percolation

This page was built for publication: \(k\)-core architecture and \(k\)-core percolation on complex networks