Dynamics ofk-core percolation
From MaRDI portal
Publication:3593312
Abstract: In many network applications nodes are stable provided they have at least k neighbors, and a network of k-stable nodes is called a k-core. The vulnerability to random attack is characterized by the size of culling avalanches which occur after a randomly chosen k-core node is removed. Simulations of lattices in two, three and four dimensions, as well as small world networks, indicate that power-law avalanches occur in first order k-core systems, while truncated avalanches are characteristic of second order cases.
Recommendations
- Dynamics ofk-core percolation in a random graph
- scientific article; zbMATH DE number 1195777
- Dynamical percolation
- A survey of dynamical percolation
- The scaling limits of near-critical and dynamical percolation
- Dynamical percolation through the Voronoïtessellations
- Critical percolation and \(\mathrm{A + B \rightarrow 2A}\) dynamics
- scientific article; zbMATH DE number 3974025
- scientific article; zbMATH DE number 4013719
Cited in
(10)- Percolation times in two-dimensional models for excitable media
- Dynamical evolution of a self-organized-critical percolation model
- Percolation on complex networks: theory and application
- k-core organization in complex networks
- scientific article; zbMATH DE number 4013719 (Why is no real title available?)
- Generalized k-core pruning process on directed networks
- Dynamics ofk-core percolation in a random graph
- scientific article; zbMATH DE number 19394 (Why is no real title available?)
- Generalized \(K\)-core percolation in networks with community structure
- \(k\)-core architecture and \(k\)-core percolation on complex networks
This page was built for publication: Dynamics ofk-core percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593312)