IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i11p1160-d559191.html
   My bibliography  Save this article

Cliques Are Bricks for k-CT Graphs

Author

Listed:
  • Václav Snášel

    (Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava, 17. listopadu 15/2172, 708 33 Ostrava, Czech Republic)

  • Pavla Dráždilová

    (Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava, 17. listopadu 15/2172, 708 33 Ostrava, Czech Republic)

  • Jan Platoš

    (Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava, 17. listopadu 15/2172, 708 33 Ostrava, Czech Republic)

Abstract

Many real networks in biology, chemistry, industry, ecological systems, or social networks have an inherent structure of simplicial complexes reflecting many-body interactions. Over the past few decades, a variety of complex systems have been successfully described as networks whose links connect interacting pairs of nodes. Simplicial complexes capture the many-body interactions between two or more nodes and generalized network structures to allow us to go beyond the framework of pairwise interactions. Therefore, to analyze the topological and dynamic properties of simplicial complex networks, the closed trail metric is proposed here. In this article, we focus on the evolution of simplicial complex networks from clicks and k-CT graphs. This approach is used to describe the evolution of real simplicial complex networks. We conclude with a summary of composition k-CT graphs (glued graphs); their closed trail distances are in a specified range.

Suggested Citation

  • Václav Snášel & Pavla Dráždilová & Jan Platoš, 2021. "Cliques Are Bricks for k-CT Graphs," Mathematics, MDPI, vol. 9(11), pages 1-9, May.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:11:p:1160-:d:559191
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/11/1160/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/11/1160/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Hernández Serrano, Daniel & Sánchez Gómez, Darío, 2020. "Centrality measures in simplicial complexes: Applications of topological data analysis to network science," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    2. Iacopo Iacopini & Giovanni Petri & Alain Barrat & Vito Latora, 2019. "Simplicial models of social contagion," Nature Communications, Nature, vol. 10(1), pages 1-9, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Serrano, Daniel Hernández & Villarroel, Javier & Hernández-Serrano, Juan & Tocino, Ángel, 2023. "Stochastic simplicial contagion model," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    2. Huan Wang & Chuang Ma & Han-Shuang Chen & Ying-Cheng Lai & Hai-Feng Zhang, 2022. "Full reconstruction of simplicial complexes from binary contagion and Ising data," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    3. Guilherme Ferraz de Arruda & Giovanni Petri & Pablo Martin Rodriguez & Yamir Moreno, 2023. "Multistability, intermittency, and hybrid transitions in social contagion models on hypergraphs," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
    4. Nie, Yanyi & Li, Wenyao & Pan, Liming & Lin, Tao & Wang, Wei, 2022. "Markovian approach to tackle competing pathogens in simplicial complex," Applied Mathematics and Computation, Elsevier, vol. 417(C).
    5. Keliger, Dániel & Horváth, Illés, 2023. "Accuracy criterion for mean field approximations of Markov processes on hypergraphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    6. Li, WenYao & Xue, Xiaoyu & Pan, Liming & Lin, Tao & Wang, Wei, 2022. "Competing spreading dynamics in simplicial complex," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    7. Nie, Yanyi & Zhong, Xiaoni & Lin, Tao & Wang, Wei, 2022. "Homophily in competing behavior spreading among the heterogeneous population with higher-order interactions," Applied Mathematics and Computation, Elsevier, vol. 432(C).
    8. Mock, Andrea & Volić, Ismar, 2021. "Political structures and the topology of simplicial complexes," Mathematical Social Sciences, Elsevier, vol. 114(C), pages 39-57.
    9. Almiala, Into & Aalto, Henrik & Kuikka, Vesa, 2023. "Influence spreading model for partial breakthrough effects on complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(C).
    10. Li, Wenyao & Cai, Meng & Zhong, Xiaoni & Liu, Yanbing & Lin, Tao & Wang, Wei, 2023. "Coevolution of epidemic and infodemic on higher-order networks," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    11. Zhao, Dandan & Li, Runchao & Peng, Hao & Zhong, Ming & Wang, Wei, 2022. "Higher-order percolation in simplicial complexes," Chaos, Solitons & Fractals, Elsevier, vol. 155(C).
    12. Martina Contisciani & Federico Battiston & Caterina De Bacco, 2022. "Inference of hyperedges and overlapping communities in hypergraphs," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    13. Ramasamy, Mohanasubha & Devarajan, Subhasri & Kumarasamy, Suresh & Rajagopal, Karthikeyan, 2022. "Effect of higher-order interactions on synchronization of neuron models with electromagnetic induction," Applied Mathematics and Computation, Elsevier, vol. 434(C).
    14. Peng, Hao & Zhao, Yifan & Zhao, Dandan & Zhong, Ming & Hu, Zhaolong & Han, Jianming & Li, Runchao & Wang, Wei, 2023. "Robustness of higher-order interdependent networks," Chaos, Solitons & Fractals, Elsevier, vol. 171(C).
    15. Manoranjani, M. & Senthilkumar, D.V. & Chandrasekar, V.K., 2023. "Abrupt desynchronization and abrupt transition to π-state in globally coupled oscillator simplexes with contrarians and conformists," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    16. Hernández Serrano, Daniel & Sánchez Gómez, Darío, 2020. "Centrality measures in simplicial complexes: Applications of topological data analysis to network science," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    17. Hernández Serrano, Daniel & Hernández-Serrano, Juan & Sánchez Gómez, Darío, 2020. "Simplicial degree in complex networks. Applications of topological data analysis to network science," Chaos, Solitons & Fractals, Elsevier, vol. 137(C).
    18. Dai, X. & Kovalenko, K. & Molodyk, M. & Wang, Z. & Li, X. & Musatov, D. & Raigorodskii, A.M. & Alfaro-Bittner, K. & Cooper, G.D. & Bianconi, G. & Boccaletti, S., 2021. "D-dimensional oscillators in simplicial structures: Odd and even dimensions display different synchronization scenarios," Chaos, Solitons & Fractals, Elsevier, vol. 146(C).
    19. Marco Mancastroppa & Iacopo Iacopini & Giovanni Petri & Alain Barrat, 2023. "Hyper-cores promote localization and efficient seeding in higher-order processes," Nature Communications, Nature, vol. 14(1), pages 1-12, December.
    20. Cui, Yajuan & Wei, Ruichen & Tian, Yang & Tian, Hui & Zhu, Xuzhen, 2022. "Information propagation influenced by individual fashion-passion trend on multi-layer weighted network," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:11:p:1160-:d:559191. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.