1
|
Zambirinis S, Papadopoulos F. (ω_{1},ω_{2})-temporal random hyperbolic graphs. Phys Rev E 2024; 110:024309. [PMID: 39294989 DOI: 10.1103/physreve.110.024309] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/26/2024] [Accepted: 08/01/2024] [Indexed: 09/21/2024]
Abstract
We extend a recent model of temporal random hyperbolic graphs by allowing connections and disconnections to persist across network snapshots with different probabilities ω_{1} and ω_{2}. This extension, while conceptually simple, poses analytical challenges involving the Appell F_{1} series. Despite these challenges, we are able to analyze key properties of the model, which include the distributions of contact and intercontact durations, as well as the expected time-aggregated degree. The incorporation of ω_{1} and ω_{2} enables more flexible tuning of the average contact and intercontact durations, and of the average time-aggregated degree, providing a finer control for exploring the effect of temporal network dynamics on dynamical processes. Overall, our results provide new insights into the analysis of temporal networks and contribute to a more general representation of real-world scenarios.
Collapse
|
2
|
Jankowski R, Allard A, Boguñá M, Serrano MÁ. The D-Mercator method for the multidimensional hyperbolic embedding of real networks. Nat Commun 2023; 14:7585. [PMID: 37990019 PMCID: PMC10663512 DOI: 10.1038/s41467-023-43337-5] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/11/2023] [Accepted: 11/07/2023] [Indexed: 11/23/2023] Open
Abstract
One of the pillars of the geometric approach to networks has been the development of model-based mapping tools that embed real networks in its latent geometry. In particular, the tool Mercator embeds networks into the hyperbolic plane. However, some real networks are better described by the multidimensional formulation of the underlying geometric model. Here, we introduce D-Mercator, a model-based embedding method that produces multidimensional maps of real networks into the (D + 1)-hyperbolic space, where the similarity subspace is represented as a D-sphere. We used D-Mercator to produce multidimensional hyperbolic maps of real networks and estimated their intrinsic dimensionality in terms of navigability and community structure. Multidimensional representations of real networks are instrumental in the identification of factors that determine connectivity and in elucidating fundamental issues that hinge on dimensionality, such as the presence of universality in critical behavior.
Collapse
Affiliation(s)
- Robert Jankowski
- Departament de Física de la Matèria Condensada, Universitat de Barcelona, Martí i Franquès 1, 08028, Barcelona, Spain
- Universitat de Barcelona Institute of Complex Systems (UBICS), Universitat de Barcelona, Barcelona, Spain
| | - Antoine Allard
- Département de Physique, de Génie Physique et d'optique, Université Laval, Québec, Québec, G1V 0A6, Canada
- Centre Interdisciplinaire en Modélisation Mathématique, Université Laval, Québec, Québec, G1V 0A6, Canada
| | - Marián Boguñá
- Departament de Física de la Matèria Condensada, Universitat de Barcelona, Martí i Franquès 1, 08028, Barcelona, Spain
- Universitat de Barcelona Institute of Complex Systems (UBICS), Universitat de Barcelona, Barcelona, Spain
| | - M Ángeles Serrano
- Departament de Física de la Matèria Condensada, Universitat de Barcelona, Martí i Franquès 1, 08028, Barcelona, Spain.
- Universitat de Barcelona Institute of Complex Systems (UBICS), Universitat de Barcelona, Barcelona, Spain.
- ICREA, Pg. Lluís Companys 23, E-08010, Barcelona, Spain.
| |
Collapse
|
3
|
Lecca P, Lecca M. Graph embedding and geometric deep learning relevance to network biology and structural chemistry. Front Artif Intell 2023; 6:1256352. [PMID: 38035201 PMCID: PMC10687447 DOI: 10.3389/frai.2023.1256352] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/10/2023] [Accepted: 10/16/2023] [Indexed: 12/02/2023] Open
Abstract
Graphs are used as a model of complex relationships among data in biological science since the advent of systems biology in the early 2000. In particular, graph data analysis and graph data mining play an important role in biology interaction networks, where recent techniques of artificial intelligence, usually employed in other type of networks (e.g., social, citations, and trademark networks) aim to implement various data mining tasks including classification, clustering, recommendation, anomaly detection, and link prediction. The commitment and efforts of artificial intelligence research in network biology are motivated by the fact that machine learning techniques are often prohibitively computational demanding, low parallelizable, and ultimately inapplicable, since biological network of realistic size is a large system, which is characterised by a high density of interactions and often with a non-linear dynamics and a non-Euclidean latent geometry. Currently, graph embedding emerges as the new learning paradigm that shifts the tasks of building complex models for classification, clustering, and link prediction to learning an informative representation of the graph data in a vector space so that many graph mining and learning tasks can be more easily performed by employing efficient non-iterative traditional models (e.g., a linear support vector machine for the classification task). The great potential of graph embedding is the main reason of the flourishing of studies in this area and, in particular, the artificial intelligence learning techniques. In this mini review, we give a comprehensive summary of the main graph embedding algorithms in light of the recent burgeoning interest in geometric deep learning.
Collapse
Affiliation(s)
- Paola Lecca
- Faculty of Engineering, Free University of Bozen-Bolzano, Bolzano, Italy
| | - Michela Lecca
- Fondazione Bruno Kessler, Digital Industry Center, Technologies of Vision, Trento, Italy
| |
Collapse
|
4
|
Andrianou XD, Konstantinou C, Rodríguez-Flores MA, Papadopoulos F, Makris KC. Population-wide measures due to the COVID-19 pandemic and exposome changes in the general population of Cyprus in March-May 2020. BMC Public Health 2022; 22:2279. [PMID: 36471295 PMCID: PMC9724426 DOI: 10.1186/s12889-022-14468-z] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/26/2021] [Accepted: 10/27/2022] [Indexed: 12/12/2022] Open
Abstract
Non-pharmacological interventions (e.g., stay-at-home orders, school closures, physical distancing) implemented during the COVID-19 pandemic are expected to have modified routines and lifestyles, eventually impacting key exposome parameters, including, among others, physical activity, diet and cleaning habits. The objectives were to describe the exposomic profile of the general Cypriot population and compliance to the population-wide measures implemented during March-May 2020 to lower the risk of SARS-CoV-2 transmission, and to simulate the population-wide measures' effect on social contacts and SARS-CoV-2 spread. A survey was conducted in March-May 2020 capturing different exposome parameters, e.g., individual characteristics, lifestyle/habits, time spent and contacts at home/work/elsewhere. We described the exposome parameters and their correlations. In an exposome-wide association analysis, we used the number of hours spent at home as an indicator of compliance to the measures. We generated synthetic human proximity networks, before and during the measures using the dynamic-[Formula: see text]1 model and simulated SARS-CoV-2 transmission (i.e., to identify possible places where higher transmission/number of cases could originate from) on the networks with a dynamic Susceptible-Exposed-Infectious-Recovered model. Overall, 594 respondents were included in the analysis (mean age 45.7 years, > 50% in very good health and communicating daily with friends/family via phone/online). The median number of contacts at home and at work decreased during the measures (from 3 to 2 and from 12 to 0, respectively) and the hours spent at home increased, indicating compliance with the measures. Increased time spent at home during the measures was associated with time spent at work before the measures (β= -0.87, 95% CI [-1.21,-0.53]) as well as with being retired vs employed (β= 2.32, 95% CI [1.70, 2.93]). The temporal network analysis indicated that most cases originated at work, while the synthetic human proximity networks adequately reproduced the observed SARS-CoV-2 spread. Exposome approaches (i.e., holistic characterization of the spatiotemporal variation of multiple exposures) would aid the comprehensive description of population-wide measures' impact and explore how behaviors and networks may shape SARS-CoV-2 transmission.
Collapse
Affiliation(s)
- Xanthi D. Andrianou
- grid.15810.3d0000 0000 9995 3899Cyprus International Institute for Environmental and Public Health, Cyprus University of Technology, Limassol, Cyprus
| | - Corina Konstantinou
- grid.15810.3d0000 0000 9995 3899Cyprus International Institute for Environmental and Public Health, Cyprus University of Technology, Limassol, Cyprus
| | - Marco A. Rodríguez-Flores
- grid.15810.3d0000 0000 9995 3899Department of Electrical and Computer Engineering, Cyprus University of Technology, Limassol, Cyprus
| | - Fragkiskos Papadopoulos
- grid.15810.3d0000 0000 9995 3899Department of Electrical and Computer Engineering, Cyprus University of Technology, Limassol, Cyprus
| | - Konstantinos C. Makris
- grid.15810.3d0000 0000 9995 3899Cyprus International Institute for Environmental and Public Health, Cyprus University of Technology, Limassol, Cyprus
| |
Collapse
|
5
|
Zambirinis S, Hartle H, Papadopoulos F. Dynamics of cold random hyperbolic graphs with link persistence. Phys Rev E 2022; 106:064312. [PMID: 36671145 DOI: 10.1103/physreve.106.064312] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/11/2022] [Accepted: 11/29/2022] [Indexed: 06/17/2023]
Abstract
We consider and analyze a dynamic model of random hyperbolic graphs with link persistence. In the model, both connections and disconnections can be propagated from the current to the next snapshot with probability ω∈[0,1). Otherwise, with probability 1-ω, connections are reestablished according to the random hyperbolic graphs model. We show that while the persistence probability ω affects the averages of the contact and intercontact distributions, it does not affect the tails of these distributions, which decay as power laws with exponents that do not depend on ω. We also consider examples of real temporal networks, and we show that the considered model can adequately reproduce several of their dynamical properties. Our results advance our understanding of the realistic modeling of temporal networks and of the effects of link persistence on temporal network properties.
Collapse
Affiliation(s)
- Sofoclis Zambirinis
- Department of Electrical Engineering, Computer Engineering and Informatics, Cyprus University of Technology, 3036 Limassol, Cyprus
| | - Harrison Hartle
- Network Science Institute, Northeastern University, Boston, Massachusetts 02115, USA
| | - Fragkiskos Papadopoulos
- Department of Electrical Engineering, Computer Engineering and Informatics, Cyprus University of Technology, 3036 Limassol, Cyprus
| |
Collapse
|
6
|
Papadopoulos F, Zambirinis S. Dynamics of hot random hyperbolic graphs. Phys Rev E 2022; 105:024302. [PMID: 35291072 DOI: 10.1103/physreve.105.024302] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/07/2021] [Accepted: 01/20/2022] [Indexed: 06/14/2023]
Abstract
We derive the most basic dynamical properties of random hyperbolic graphs (the distributions of contact and intercontact durations) in the hot regime (network temperature T>1). We show that for sufficiently large networks the contact distribution decays as a power law with exponent 2+T>3 for durations t>T, while for t<T it exhibits exponential-like decays. This result holds irrespective of the expected degree distribution, as long as it has a finite Tth moment. Otherwise, the contact distribution depends on the expected degree distribution and we show that if the latter is a power law with exponent γ∈(2,T+1], then the former decays as a power law with exponent γ+1>3. However, the intercontact distribution exhibits power-law decays with exponent 2-T∈(0,1) for T∈(1,2), while for T>2 it displays linear decays with a slope that depends on the observation interval. This result holds irrespective of the expected degree distribution as long as it has a finite Tth moment if T∈(1,2), or a finite second moment if T>2. Otherwise, the intercontact distribution depends on the expected degree distribution and if the latter is a power law with exponent γ∈(2,3), then the former decays as a power law with exponent 3-γ∈(0,1). Thus, hot random hyperbolic graphs can give rise to contact and intercontact distributions that both decay as power laws. These power laws, however, are unrealistic for the case of the intercontact distribution, as their exponent is always less than one. These results mean that hot random hyperbolic graphs are not adequate for modeling real temporal networks, in stark contrast to cold random hyperbolic graphs (T<1). Since the configuration model emerges at T→∞, these results also suggest that this is not an adequate null temporal network model.
Collapse
Affiliation(s)
- Fragkiskos Papadopoulos
- Department of Electrical Engineering, Computer Engineering and Informatics, Cyprus University of Technology, 3036 Limassol, Cyprus
| | - Sofoclis Zambirinis
- Department of Electrical Engineering, Computer Engineering and Informatics, Cyprus University of Technology, 3036 Limassol, Cyprus
| |
Collapse
|
7
|
Hartle H, Papadopoulos F, Krioukov D. Dynamic hidden-variable network models. Phys Rev E 2021; 103:052307. [PMID: 34134209 DOI: 10.1103/physreve.103.052307] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/05/2021] [Accepted: 03/12/2021] [Indexed: 11/07/2022]
Abstract
Models of complex networks often incorporate node-intrinsic properties abstracted as hidden variables. The probability of connections in the network is then a function of these variables. Real-world networks evolve over time and many exhibit dynamics of node characteristics as well as of linking structure. Here we introduce and study natural temporal extensions of static hidden-variable network models with stochastic dynamics of hidden variables and links. The dynamics is controlled by two parameters: one that tunes the rate of change of hidden variables and another that tunes the rate at which node pairs reevaluate their connections given the current values of hidden variables. Snapshots of networks in the dynamic models are equivalent to networks generated by the static models only if the link reevaluation rate is sufficiently larger than the rate of hidden-variable dynamics or if an additional mechanism is added whereby links actively respond to changes in hidden variables. Otherwise, links are out of equilibrium with respect to hidden variables and network snapshots exhibit structural deviations from the static models. We examine the level of structural persistence in the considered models and quantify deviations from staticlike behavior. We explore temporal versions of popular static models with community structure, latent geometry, and degree heterogeneity. While we do not attempt to directly model real networks, we comment on interesting qualitative resemblances to real systems. In particular, we speculate that links in some real networks are out of equilibrium with respect to hidden variables, partially explaining the presence of long-ranged links in geometrically embedded systems and intergroup connectivity in modular systems. We also discuss possible extensions, generalizations, and applications of the introduced class of dynamic network models.
Collapse
Affiliation(s)
- Harrison Hartle
- Network Science Institute, Northeastern University, Boston, 02115 Massachusetts, USA
| | - Fragkiskos Papadopoulos
- Department of Electrical Engineering, Computer Engineering and Informatics, Cyprus University of Technology, 3036 Limassol, Cyprus
| | - Dmitri Krioukov
- Network Science Institute, Northeastern University, Boston, 02115 Massachusetts, USA.,Northeastern University, Departments of Physics, Mathematics, and Electrical & Computer Engineering, Boston, 02115 Massachusetts, USA
| |
Collapse
|
8
|
Rodríguez-Flores MA, Papadopoulos F. Hyperbolic mapping of human proximity networks. Sci Rep 2020; 10:20244. [PMID: 33219308 PMCID: PMC7679465 DOI: 10.1038/s41598-020-77277-7] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/04/2020] [Accepted: 11/09/2020] [Indexed: 11/25/2022] Open
Abstract
Human proximity networks are temporal networks representing the close-range proximity among humans in a physical space. They have been extensively studied in the past 15 years as they are critical for understanding the spreading of diseases and information among humans. Here we address the problem of mapping human proximity networks into hyperbolic spaces. Each snapshot of these networks is often very sparse, consisting of a small number of interacting (i.e., non-zero degree) nodes. Yet, we show that the time-aggregated representation of such systems over sufficiently large periods can be meaningfully embedded into the hyperbolic space, using methods developed for traditional (non-mobile) complex networks. We justify this compatibility theoretically and validate it experimentally. We produce hyperbolic maps of six different real systems, and show that the maps can be used to identify communities, facilitate efficient greedy routing on the temporal network, and predict future links with significant precision. Further, we show that epidemic arrival times are positively correlated with the hyperbolic distance from the infection sources in the maps. Thus, hyperbolic embedding could also provide a new perspective for understanding and predicting the behavior of epidemic spreading in human proximity systems.
Collapse
Affiliation(s)
- Marco A Rodríguez-Flores
- Department of Electrical Engineering, Computer Engineering and Informatics, Cyprus University of Technology, Limassol, 3036, Cyprus
| | - Fragkiskos Papadopoulos
- Department of Electrical Engineering, Computer Engineering and Informatics, Cyprus University of Technology, Limassol, 3036, Cyprus.
| |
Collapse
|