Hierarchical cycle-tree packing model for optimal \(K\)-core attack
DOI10.1007/s10955-023-03210-7zbMath1529.05142arXiv2303.01007MaRDI QIDQ6140935
Publication date: 2 January 2024
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.01007
cavity methodirreversible dynamicsoptimal initial condition\(K\)-core attackcycle-tree packing model
Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)
Cites Work
- New bounds for contagious sets
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Optimal segmentation of directed graph and the minimum number of feedback arcs
- Minimal contagious sets in random regular graphs
- Analytical solution to the \(k\)-core pruning process
- Optimizing spread dynamics on graphs by message passing
- A spin glass approach to the directed feedback vertex set problem
- Generalizedk-core pruning process on directed networks
- Information, Physics, and Computation
- Decycling numbers of random regular graphs
- Reducibility among Combinatorial Problems
- Contagious Sets in Expanders
- Spin Glass approach to the feedback vertex set problem
This page was built for publication: Hierarchical cycle-tree packing model for optimal \(K\)-core attack
