2
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Full reconstruction of simplicial complexes from binary contagion and Ising data

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Previous efforts on data-based reconstruction focused on complex networks with pairwise or two-body interactions. There is a growing interest in networks with higher-order or many-body interactions, raising the need to reconstruct such networks based on observational data. We develop a general framework combining statistical inference and expectation maximization to fully reconstruct 2-simplicial complexes with two- and three-body interactions based on binary time-series data from two types of discrete-state dynamics. We further articulate a two-step scheme to improve the reconstruction accuracy while significantly reducing the computational load. Through synthetic and real-world 2-simplicial complexes, we validate the framework by showing that all the connections can be faithfully identified and the full topology of the 2-simplicial complexes can be inferred. The effects of noisy data or stochastic disturbance are studied, demonstrating the robustness of the proposed framework.

          Abstract

          Data-driven recovery of topology is challenging for networks beyond pairwise interactions. The authors propose a framework to reconstruct complex networks with higher-order interactions from time series, focusing on networks with 2-simplexes where social contagion and Ising dynamics generate binary data.

          Related collections

          Most cited references57

          • Record: found
          • Abstract: found
          • Article: not found

          Collective dynamics of 'small-world' networks.

          Networks of coupled dynamical systems have been used to model biological oscillators, Josephson junction arrays, excitable media, neural networks, spatial games, genetic control networks and many other self-organizing systems. Ordinarily, the connection topology is assumed to be either completely regular or completely random. But many biological, technological and social networks lie somewhere between these two extremes. Here we explore simple models of networks that can be tuned through this middle ground: regular networks 'rewired' to introduce increasing amounts of disorder. We find that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. We call them 'small-world' networks, by analogy with the small-world phenomenon (popularly known as six degrees of separation. The neural network of the worm Caenorhabditis elegans, the power grid of the western United States, and the collaboration graph of film actors are shown to be small-world networks. Models of dynamical systems with small-world coupling display enhanced signal-propagation speed, computational power, and synchronizability. In particular, infectious diseases spread more easily in small-world networks than in regular lattices.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Emergence of Scaling in Random Networks

            Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

                Bookmark

                Author and article information

                Contributors
                haifengzhang1978@gmail.com
                Journal
                Nat Commun
                Nat Commun
                Nature Communications
                Nature Publishing Group UK (London )
                2041-1723
                1 June 2022
                1 June 2022
                2022
                : 13
                : 3043
                Affiliations
                [1 ]GRID grid.252245.6, ISNI 0000 0001 0085 4987, The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Mathematical Science, , Anhui University, ; Hefei, 230601 China
                [2 ]GRID grid.252245.6, ISNI 0000 0001 0085 4987, School of Internet, , Anhui University, ; Hefei, 230601 China
                [3 ]GRID grid.252245.6, ISNI 0000 0001 0085 4987, School of Physics and Material Science, , Anhui University, ; Hefei, 230601 China
                [4 ]GRID grid.215654.1, ISNI 0000 0001 2151 2636, School of Electrical, Computer and Energy Engineering, , Arizona State University, ; Tempe, AZ 85287 USA
                Author information
                http://orcid.org/0000-0002-5141-0734
                http://orcid.org/0000-0002-0723-733X
                http://orcid.org/0000-0002-7094-669X
                Article
                30706
                10.1038/s41467-022-30706-9
                9160016
                35650211
                f547a33a-b23c-4569-b132-df95ee35f31b
                © The Author(s) 2022

                Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.

                History
                : 23 August 2021
                : 13 May 2022
                Funding
                Funded by: FundRef https://doi.org/10.13039/501100001809, National Natural Science Foundation of China (National Science Foundation of China);
                Award ID: 61973001, 12005001, 11875069
                Award ID: 61973001
                Award ID: 12005001
                Award ID: 11875069
                Award ID: 61973001
                Award ID: 12005001
                Award ID: 11875069
                Award ID: 61973001
                Award ID: 12005001
                Award ID: 11875069
                Award ID: 61973001, 12005001, 11875069
                Award Recipient :
                Funded by: Natural Science Foundation of Anhui Province (2008085QF299), and the University Synergy Innovation Program of Anhui Province (GXXT-2021-032). The work at Arizona State University was supported by the Office of Naval Research under Grant No. N00014-21-1-2323.
                Funded by: Natural Science Foundation of Anhui Province (2008085QF299), and the University Synergy Innovation Program of Anhui Province (GXXT-2021-032). The work at Arizona State University was supported by the Office of Naval Research under Grant No. N00014-21-1-2323.
                Categories
                Article
                Custom metadata
                © The Author(s) 2022

                Uncategorized
                applied mathematics,complex networks
                Uncategorized
                applied mathematics, complex networks

                Comments

                Comment on this article