Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 67 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 191 tok/s Pro
GPT OSS 120B 461 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Network higher-order structure dismantling (2401.10028v1)

Published 18 Jan 2024 in physics.soc-ph

Abstract: Diverse higher-order structures, foundational for supporting a network's "meta-functions", play a vital role in structure, functionality, and the emergence of complex dynamics. Nevertheless, the problem of dismantling them has been consistently overlooked. In this paper, we introduce the concept of dismantling higher-order structures, with the objective of disrupting not only network connectivity but also eradicating all higher-order structures in each branch, thereby ensuring thorough functional paralysis. Given the diversity and unknown specifics of higher-order structures, identifying and targeting them individually is not practical or even feasible. Fortunately, their close association with k-cores arises from their internal high connectivity. Thus, we transform higher-order structure measurement into measurements on k-cores with corresponding orders. Furthermore, we propose the Belief Propagation-guided High-order Dismantling (BPDH) algorithm, minimizing dismantling costs while achieving maximal disruption to connectivity and higher-order structures, ultimately converting the network into a forest. BPDH exhibits the explosive vulnerability of network higher-order structures, counterintuitively showcasing decreasing dismantling costs with increasing structural complexity. Our findings offer a novel approach for dismantling malignant networks, emphasizing the substantial challenges inherent in safeguarding against such malicious attacks.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (72)
  1. Error and attack tolerance of complex networks. nature, 406(6794):378–382, 2000.
  2. Influence maximization in complex networks through optimal percolation. Nature, 524(7563):65–68, 2015.
  3. Linyuan Lü and T Zhou. Link prediction, 2013.
  4. Immunization and targeted destruction of networks using explosive percolation. Physical review letters, 117(20):208301, 2016.
  5. Vital nodes identification in complex networks. Physics reports, 650:1–63, 2016.
  6. Breakdown of the internet under intentional attack. Physical review letters, 86(16):3682, 2001.
  7. Network dismantling. Proceedings of the National Academy of Sciences, 113(44):12368–12373, 2016.
  8. Mitigation of malicious attacks on networks. Proceedings of the National Academy of Sciences, 108(10):3838–3841, 2011.
  9. Generalized network dismantling. Proceedings of the National Academy of Sciences, 116(14):6554–6559, 2019.
  10. Valdis E Krebs. Mapping networks of terrorist cells. Connections, 24(3):43–52, 2002.
  11. Network control principles predict neuron function in the caenorhabditis elegans connectome. Nature, 550(7677):519–523, 2017.
  12. High-order combination effects and biological robustness. Molecular Systems Biology, 4(1):215, 2008.
  13. The k-core as a predictor of structural collapse in mutualistic ecosystems. Nature Physics, 15(1):95–102, January 2019.
  14. Bridges in complex networks. Physical Review E, 97(1):012307, 2018.
  15. Fast fragmentation of networks using module-based attacks. PloS one, 10(11):e0142824, 2015.
  16. F Musciotto and S Miccichè. Exploring the landscape of dismantling strategies based on the community structure of networks. Scientific Reports, 13(1):14448, 2023.
  17. Unveiling explosive vulnerability of networks through edge collective behavior. arXiv preprint arXiv:2310.06407, 2023.
  18. From networks to optimal higher-order models of complex systems. Nature Physics, 15(4):313–320, 2019.
  19. Networks beyond pairwise interactions: Structure and dynamics. Physics Reports, 874:1–92, 2020.
  20. High-order interactions distort the functional landscape of microbial consortia. PLoS Biology, 17(12):e3000550, 2019.
  21. Higher-Order Interactions Characterized in Cortical Activity. Journal of Neuroscience, 31(48):17514–17526, 2011.
  22. Evolutionary dynamics of higher-order interactions in social networks. Nature Human Behaviour, 5(5):586–595, 2021.
  23. Higher-order interactions stabilize dynamics in competitive network models. Nature, 548(7666):210–213, 2017.
  24. Christopher R. Myers. Software systems as complex networks: Structure, function, and evolvability of software collaboration graphs. Physical Review E, 68(4):046116, 2003.
  25. The physics of higher-order interactions in complex systems. Nature Physics, 17(10):1093–1098, 2021.
  26. Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes. Nature Communications, 14(1):1605, 2023.
  27. Network motifs: simple building blocks of complex networks. Science, 298(5594):824–827, 2002.
  28. Protein complexes and functional modules in molecular networks. Proceedings of the national Academy of sciences, 100(21):12123–12128, 2003.
  29. Higher-order organization of complex networks. Science, 353(6295):163–166, 2016.
  30. Cliques and cavities in the human connectome. Journal of computational neuroscience, 44:115–145, 2018.
  31. Clique topology reveals intrinsic geometric structure in neural correlations. Proceedings of the National Academy of Sciences, 112(44):13455–13460, 2015.
  32. More is different: Constructing the most comprehensive human protein high-order interaction dataset. bioRxiv, pages 2023–11, 2023.
  33. Structure, dynamics, assembly, and evolution of protein complexes. Annual review of biochemistry, 84:551–575, 2015.
  34. High-order species interactions shape ecosystem diversity. Nature Communications, 7(1):12285, 2016.
  35. Higher-order interactions capture unexplained complexity in diverse communities. Nature Ecology & Evolution, 1(3):1–7, 2017.
  36. Neighborhood–based models for social networks. Sociological methodology, 32(1):301–337, 2002.
  37. Dynamics on higher-order networks: A review. Journal of the Royal Society Interface, 19(188):20220043, 2022.
  38. Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review, 3(4):199–243, 2009.
  39. Characterizing cycle structure in complex networks. Communications Physics, 4(1):272, 2021.
  40. The characteristics of cycle-nodes-ratio and its application to network classification. Communications in Nonlinear Science and Numerical Simulation, 99:105804, 2021.
  41. Fast and simple decycling and dismantling of networks. Scientific reports, 6(1):37954, 2016.
  42. k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects. Physical Review E, 73(5):056101, 2006.
  43. K-core organization of complex networks. Physical review letters, 96(4):040601, 2006.
  44. Random walks on simplicial complexes and the normalized hodge 1-laplacian. SIAM Review, 62(2):353–391, 2020.
  45. Fitness for synchronization of network motifs. Physica A: Statistical Mechanics and its Applications, 343:279–287, 2004.
  46. Simplicial models of social contagion. Nature communications, 10(1):2485, 2019.
  47. Clique percolation in random networks. Physical review letters, 94(16):160202, 2005.
  48. Hai-Jun Zhou. Spin glass approach to the feedback vertex set problem. The European Physical Journal B, 86(11):455, 2013.
  49. Identifying optimal targets of network attack by belief propagation. Physical Review E, 94(1):012305, 2016.
  50. Computing cliques and cavities in networks. Communications Physics, 4(1):249, 2021.
  51. Enumerating top-k quasi-cliques. In 2018 IEEE international conference on big data (big data), pages 1107–1112. IEEE, 2018.
  52. Clique relaxations in social network analysis: The maximum k-plex problem. Operations Research, 59(1):133–142, 2011.
  53. Searching for optimal network topology with best possible synchronizability. IEEE Circuits and Systems Magazine, 13(1):66–75, 2013.
  54. Network motifs in integrated cellular networks of transcription–regulation and protein–protein interaction. Proceedings of the National Academy of Sciences, 101(16):5934–5939, 2004.
  55. Uri Alon. Network motifs: theory and experimental approaches. Nature Reviews Genetics, 8(6):450–461, 2007.
  56. Modular organization of cellular networks. Proceedings of the national Academy of sciences, 100(3):1128–1133, 2003.
  57. Identification of functional information subgraphs in complex networks. Physical review letters, 100(23):238701, 2008.
  58. Subgraphs and network motifs in geometric networks. Physical Review E, 71(2):026117, 2005.
  59. Decycling numbers of random regular graphs. Random Structures & Algorithms, 21(3-4):397–413, 2002.
  60. Hans A Bethe. Statistical theory of superlattices. Proceedings of the Royal Society of London. Series A-Mathematical and Physical Sciences, 150(871):552–575, 1935.
  61. Rudolf Peierls. Statistical theory of superlattices with unequal concentrations of the components. Proceedings of the Royal Society of London. Series A-Mathematical and Physical Sciences, 154(881):207–222, 1936.
  62. Mark Newman. Networks. Oxford university press, 2018.
  63. Emergence of scaling in random networks. Science, 286(5439):509–512, 1999.
  64. Lethality and centrality in protein networks. Nature, 411(6833):41–42, 2001.
  65. The network data repository with interactive graph analytics and visualization. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1), 2015.
  66. Bridgeness: A Local Index on Edge Significance in Maintaining Global Connectivity. Journal of Statistical Mechanics: Theory and Experiment, 2010(10):P10011, 2010.
  67. Community structure in social and biological networks. Proceedings of the national academy of sciences, 99(12):7821–7826, 2002.
  68. Immunization and Targeted Destruction of Networks using Explosive Percolation. Physical Review Letters, 117(20):208301, 2016.
  69. Hai-Jun Zhou. Cycle-tree guided attack of random K-core: Spin glass model and efficient message-passing algorithm. Science China Physics, Mechanics & Astronomy, 65(3):230511, 2022.
  70. Higher-order percolation in simplicial complexes. Chaos, Solitons & Fractals, 155:111701, 2022.
  71. Communication and networking technologies for uavs: A survey. Journal of Network and Computer Applications, 168:102739, 2020.
  72. Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks. Decision Support Systems, 38(3):473–487, 2004.
Citations (2)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 post and received 15 likes.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube