1
|
Wang X, Fu F, Wang L. Deterministic theory of evolutionary games on temporal networks. J R Soc Interface 2024; 21:20240055. [PMID: 38807526 DOI: 10.1098/rsif.2024.0055] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/24/2024] [Accepted: 03/28/2024] [Indexed: 05/30/2024] Open
Abstract
Recent empirical studies have revealed that social interactions among agents in realistic networks merely exist intermittently and occur in a particular sequential order. However, it remains unexplored how to theoretically describe evolutionary dynamics of multiple strategies on temporal networks. Herein, we develop a deterministic theory for studying evolutionary dynamics of any [Formula: see text] pairwise games in structured populations where individuals are connected and organized by temporally activated edges. In the limit of weak selection, we derive replicator-like equations with a transformed payoff matrix characterizing how the mean frequency of each strategy varies over time, and then obtain critical conditions for any strategy to be evolutionarily stable on temporal networks. Interestingly, the re-scaled payoff matrix is a linear combination of the original payoff matrix with an additional one describing local competitions between any pair of different strategies, whose weights are solely determined by network topology and selection intensity. As a particular example, we apply the deterministic theory to analysing the impacts of temporal networks in the mini-ultimatum game, and find that temporally networked population structures result in the emergence of fairness. Our work offers theoretical insights into the subtle effects of network temporality on evolutionary game dynamics.
Collapse
Affiliation(s)
- Xiaofeng Wang
- Department of Automation, School of Information Science and Technology, Donghua University , Shanghai 201620, People's Republic of China
- Engineering Research Center of Digitized Textile and Apparel Technology (Ministry of Education), Donghua University , Shanghai 201620, People's Republic of China
| | - Feng Fu
- Department of Mathematics, Dartmouth College , Hanover, NH 03755, USA
- Department of Biomedical Data Science, Geisel School of Medicine at Dartmouth , Lebanon, NH 03756, USA
| | - Long Wang
- Center for Systems and Control, College of Engineering, Peking University , Beijing 100871, People's Republic of China
| |
Collapse
|
2
|
Bhaumik J, Masuda N. Fixation probability in evolutionary dynamics on switching temporal networks. J Math Biol 2023; 87:64. [PMID: 37768362 PMCID: PMC10539469 DOI: 10.1007/s00285-023-01987-5] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/03/2023] [Revised: 08/03/2023] [Accepted: 08/13/2023] [Indexed: 09/29/2023]
Abstract
Population structure has been known to substantially affect evolutionary dynamics. Networks that promote the spreading of fitter mutants are called amplifiers of selection, and those that suppress the spreading of fitter mutants are called suppressors of selection. Research in the past two decades has found various families of amplifiers while suppressors still remain somewhat elusive. It has also been discovered that most networks are amplifiers of selection under the birth-death updating combined with uniform initialization, which is a standard condition assumed widely in the literature. In the present study, we extend the birth-death processes to temporal (i.e., time-varying) networks. For the sake of tractability, we restrict ourselves to switching temporal networks, in which the network structure deterministically alternates between two static networks at constant time intervals or stochastically in a Markovian manner. We show that, in a majority of cases, switching networks are less amplifying than both of the two static networks constituting the switching networks. Furthermore, most small switching networks, i.e., networks on six nodes or less, are suppressors, which contrasts to the case of static networks.
Collapse
Affiliation(s)
- Jnanajyoti Bhaumik
- Department of Mathematics, State University of New York at Buffalo, Buffalo, NY, 14260-2900, USA
| | - Naoki Masuda
- Department of Mathematics, State University of New York at Buffalo, Buffalo, NY, 14260-2900, USA.
- Computational and Data-Enabled Science and Engineering Program, State University of New York at Buffalo, Buffalo, NY, 14260-5030, USA.
- Center for Computational Social Science, Kobe University, Kobe, 657-8501, Japan.
| |
Collapse
|
3
|
Su Q, McAvoy A, Plotkin JB. Strategy evolution on dynamic networks. NATURE COMPUTATIONAL SCIENCE 2023; 3:763-776. [PMID: 38177777 DOI: 10.1038/s43588-023-00509-z] [Citation(s) in RCA: 5] [Impact Index Per Article: 5.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 04/19/2023] [Accepted: 08/08/2023] [Indexed: 01/06/2024]
Abstract
Models of strategy evolution on static networks help us understand how population structure can promote the spread of traits like cooperation. One key mechanism is the formation of altruistic spatial clusters, where neighbors of a cooperative individual are likely to reciprocate, which protects prosocial traits from exploitation. However, most real-world interactions are ephemeral and subject to exogenous restructuring, so that social networks change over time. Strategic behavior on dynamic networks is difficult to study, and much less is known about the resulting evolutionary dynamics. Here we provide an analytical treatment of cooperation on dynamic networks, allowing for arbitrary spatial and temporal heterogeneity. We show that transitions among a large class of network structures can favor the spread of cooperation, even if each individual social network would inhibit cooperation when static. Furthermore, we show that spatial heterogeneity tends to inhibit cooperation, whereas temporal heterogeneity tends to promote it. Dynamic networks can have profound effects on the evolution of prosocial traits, even when individuals have no agency over network structures.
Collapse
Affiliation(s)
- Qi Su
- Department of Automation, Shanghai Jiao Tong University, Shanghai, China.
- Key Laboratory of System Control and Information Processing, Ministry of Education of China, Shanghai, China.
- Shanghai Engineering Research Center of Intelligent Control and Management, Shanghai, China.
| | - Alex McAvoy
- School of Data Science and Society, University of North Carolina at Chapel Hill, Chapel Hill, NC, USA.
- Department of Mathematics, University of North Carolina at Chapel Hill, Chapel Hill, NC, USA.
| | - Joshua B Plotkin
- Department of Biology, University of Pennsylvania, Philadelphia, PA, USA
- Center for Mathematical Biology, University of Pennsylvania, Philadelphia, PA, USA
| |
Collapse
|
4
|
Sheng A, Li A, Wang L. Evolutionary dynamics on sequential temporal networks. PLoS Comput Biol 2023; 19:e1011333. [PMID: 37549167 PMCID: PMC10434888 DOI: 10.1371/journal.pcbi.1011333] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/30/2023] [Revised: 08/17/2023] [Accepted: 07/06/2023] [Indexed: 08/09/2023] Open
Abstract
Population structure is a well-known catalyst for the evolution of cooperation and has traditionally been considered to be static in the course of evolution. Conversely, real-world populations, such as microbiome communities and online social networks, frequently show a progression from tiny, active groups to huge, stable communities, which is insufficient to be captured by constant structures. Here, we propose sequential temporal networks to characterize growing networked populations, and we extend the theory of evolutionary games to these temporal networks with arbitrary structures and growth rules. We derive analytical rules under which a sequential temporal network has a higher fixation probability for cooperation than its static counterpart. Under neutral drift, the rule is simply a function of the increment of nodes and edges in each time step. But if the selection is weak, the rule is related to coalescence times on networks. In this case, we propose a mean-field approximation to calculate fixation probabilities and critical benefit-to-cost ratios with lower calculation complexity. Numerical simulations in empirical datasets also prove the cooperation-promoting effect of population growth. Our research stresses the significance of population growth in the real world and provides a high-accuracy approximation approach for analyzing the evolution in real-life systems.
Collapse
Affiliation(s)
- Anzhi Sheng
- Center for Systems and Control, College of Engineering, Peking University, Beijing, China
- Department of Biology, University of Pennsylvania, Philadelphia, United States of America
| | - Aming Li
- Center for Systems and Control, College of Engineering, Peking University, Beijing, China
- Center for Multi-Agent Research, Institute for Artificial Intelligence, Peking University, Beijing, China
| | - Long Wang
- Center for Systems and Control, College of Engineering, Peking University, Beijing, China
- Center for Multi-Agent Research, Institute for Artificial Intelligence, Peking University, Beijing, China
| |
Collapse
|
5
|
Bauzá Mingueza F, Floría M, Gómez-Gardeñes J, Arenas A, Cardillo A. Characterization of interactions' persistence in time-varying networks. Sci Rep 2023; 13:765. [PMID: 36641475 PMCID: PMC9840642 DOI: 10.1038/s41598-022-25907-7] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/05/2022] [Accepted: 12/06/2022] [Indexed: 01/15/2023] Open
Abstract
Many complex networked systems exhibit volatile dynamic interactions among their vertices, whose order and persistence reverberate on the outcome of dynamical processes taking place on them. To quantify and characterize the similarity of the snapshots of a time-varying network-a proxy for the persistence,-we present a study on the persistence of the interactions based on a descriptor named temporality. We use the average value of the temporality, [Formula: see text], to assess how "special" is a given time-varying network within the configuration space of ordered sequences of snapshots. We analyse the temporality of several empirical networks and find that empirical sequences are much more similar than their randomized counterparts. We study also the effects on [Formula: see text] induced by the (time) resolution at which interactions take place.
Collapse
Affiliation(s)
- Francisco Bauzá Mingueza
- Department of Theoretical Physics, University of Zaragoza, 50006, Zaragoza, Spain
- GOTHAM Lab, Institute for Biocomputation and Physics of Complex Systems (BIFI), University of Zaragoza, 50018, Zaragoza, Spain
| | - Mario Floría
- GOTHAM Lab, Institute for Biocomputation and Physics of Complex Systems (BIFI), University of Zaragoza, 50018, Zaragoza, Spain
- Department of Condensed Matter Physics, University of Zaragoza, 50006, Zaragoza, Spain
| | - Jesús Gómez-Gardeñes
- GOTHAM Lab, Institute for Biocomputation and Physics of Complex Systems (BIFI), University of Zaragoza, 50018, Zaragoza, Spain
- Department of Condensed Matter Physics, University of Zaragoza, 50006, Zaragoza, Spain
| | - Alex Arenas
- Department of Computer Science and Mathematics, University Rovira i Virgili, 43007, Tarragona, Spain
| | - Alessio Cardillo
- Department of Computer Science and Mathematics, University Rovira i Virgili, 43007, Tarragona, Spain.
- GOTHAM Lab, Institute for Biocomputation and Physics of Complex Systems (BIFI), University of Zaragoza, 50018, Zaragoza, Spain.
- Internet Interdisciplinary Institute (IN3), Open University of Catalonia, 08018, Barcelona, Spain.
| |
Collapse
|
6
|
A Strategy Adaptive Evolution Approach Based on the Public Goods Game. ELECTRONICS 2022. [DOI: 10.3390/electronics11132006] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
Cluster behavior is prevalent in nature. Many individuals change their behavior to adapt to a dynamically changing environment by following simple rules of behavior and interacting with information from neighboring individuals. In this study, the traditional public goods game model is improved by combining the advantages of game theory and interactive learning. A strategy adaptive evolution method based on a public goods game is proposed. The emergence of cooperative behavior in weighted networks under the co-evolution of game strategies and node weights is explored in conjunction with multi-agent interactive learning. The results show that in a public goods game with strategic adaptation, a person’s influence becomes greater if their level of adaptation exceeds the desired level, and less otherwise. This weight adjustment is defined by the intensity parameter δ. A moderate δ value can effectively facilitate the occurrence of cooperative evolution. The level of cooperation depends mainly on the weight distribution of participants, which leads to the formation of cooperative clusters controlled by high-weighted cooperators. Even with the great temptation to defect, these cooperators can prevail over defectors. The adjustment of node weights increases the heterogeneity of individuals. This research provides a viable pathway to solve social dilemmas and will further promote the application of multi-agent intelligent decision making.
Collapse
|
7
|
Majhi S, Rakshit S, Ghosh D. Oscillation suppression and chimera states in time-varying networks. CHAOS (WOODBURY, N.Y.) 2022; 32:042101. [PMID: 35489845 DOI: 10.1063/5.0087291] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 02/03/2022] [Accepted: 03/11/2022] [Indexed: 06/14/2023]
Abstract
Complex network theory has offered a powerful platform for the study of several natural dynamic scenarios, based on the synergy between the interaction topology and the dynamics of its constituents. With research in network theory being developed so fast, it has become extremely necessary to move from simple network topologies to more sophisticated and realistic descriptions of the connectivity patterns. In this context, there is a significant amount of recent works that have emerged with enormous evidence establishing the time-varying nature of the connections among the constituents in a large number of physical, biological, and social systems. The recent review article by Ghosh et al. [Phys. Rep. 949, 1-63 (2022)] demonstrates the significance of the analysis of collective dynamics arising in temporal networks. Specifically, the authors put forward a detailed excerpt of results on the origin and stability of synchronization in time-varying networked systems. However, among the complex collective dynamical behaviors, the study of the phenomenon of oscillation suppression and that of other diverse aspects of synchronization are also considered to be central to our perception of the dynamical processes over networks. Through this review, we discuss the principal findings from the research studies dedicated to the exploration of the two collective states, namely, oscillation suppression and chimera on top of time-varying networks of both static and mobile nodes. We delineate how temporality in interactions can suppress oscillation and induce chimeric patterns in networked dynamical systems, from effective analytical approaches to computational aspects, which is described while addressing these two phenomena. We further sketch promising directions for future research on these emerging collective behaviors in time-varying networks.
Collapse
Affiliation(s)
- Soumen Majhi
- Department of Mathematics, Bar-Ilan University, Ramat-Gan 5290002, Israel
| | - Sarbendu Rakshit
- Physics and Applied Mathematics Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata 700108, India
| | - Dibakar Ghosh
- Physics and Applied Mathematics Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata 700108, India
| |
Collapse
|
8
|
Wang B, Xie Z, Han Y. Impact of individual behavioral changes on epidemic spreading in time-varying networks. Phys Rev E 2021; 104:044307. [PMID: 34781523 DOI: 10.1103/physreve.104.044307] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/20/2021] [Accepted: 09/27/2021] [Indexed: 11/07/2022]
Abstract
Changes in individual behavior often entangle with the dynamic interaction of individuals, which complicates the epidemic process and brings great challenges for the understanding and control of the epidemic. In this work, we consider three kinds of typical behavioral changes in epidemic process, that is, self-quarantine of infected individuals, self-protection of susceptible individuals, and social distancing between them. We connect the behavioral changes with individual's social attributes by the activity-driven network with attractiveness. A mean-field theory is established to derive an analytical estimate of epidemic threshold for susceptible-infected-susceptible models with individual behavioral changes, which depends on the correlations between activity, attractiveness, and the number of generative links in the susceptible and infected states. We find that individual behaviors play different roles in suppressing the epidemic. Although all the behavioral changes could delay the epidemic by increasing the epidemic threshold, self-quarantine and social distancing of infected individuals could effectively decrease the epidemic outbreak size. In addition, simultaneous changes in these behaviors and the timing of implement of them also play a key role in suppressing the epidemic. These results provide helpful significance for understanding the interaction of individual behaviors in the epidemic process.
Collapse
Affiliation(s)
- Bing Wang
- School of Computer Engineering and Science, Shanghai University, Shanghai 200444, P.R. China
| | - Zeyang Xie
- School of Computer Engineering and Science, Shanghai University, Shanghai 200444, P.R. China
| | - Yuexing Han
- School of Computer Engineering and Science, Shanghai University, Shanghai 200444, P.R. China.,Shanghai Institute for Advanced Communication and Data Science, Shanghai University, Shanghai 200444, P.R. China
| |
Collapse
|
9
|
The modular organization of brain cortical connectivity across the human lifespan. Neuroimage 2020; 218:116974. [DOI: 10.1016/j.neuroimage.2020.116974] [Citation(s) in RCA: 34] [Impact Index Per Article: 8.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/11/2019] [Revised: 02/17/2020] [Accepted: 05/17/2020] [Indexed: 11/19/2022] Open
|
10
|
Li A, Zhou L, Su Q, Cornelius SP, Liu YY, Wang L, Levin SA. Evolution of cooperation on temporal networks. Nat Commun 2020; 11:2259. [PMID: 32385279 PMCID: PMC7210286 DOI: 10.1038/s41467-020-16088-w] [Citation(s) in RCA: 35] [Impact Index Per Article: 8.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/28/2019] [Accepted: 04/04/2020] [Indexed: 11/28/2022] Open
Abstract
Population structure is a key determinant in fostering cooperation among naturally self-interested individuals in microbial populations, social insect groups, and human societies. Traditional research has focused on static structures, and yet most real interactions are finite in duration and changing in time, forming a temporal network. This raises the question of whether cooperation can emerge and persist despite an intrinsically fragmented population structure. Here we develop a framework to study the evolution of cooperation on temporal networks. Surprisingly, we find that network temporality actually enhances the evolution of cooperation relative to comparable static networks, despite the fact that bursty interaction patterns generally impede cooperation. We resolve this tension by proposing a measure to quantify the amount of temporality in a network, revealing an intermediate level that maximally boosts cooperation. Our results open a new avenue for investigating the evolution of cooperation and other emergent behaviours in more realistic structured populations. Population structure enables emergence of cooperation among individuals, but the impact of the dynamic nature of real interaction networks is not understood. Here, the authors study the evolution of cooperation on temporal networks and find that temporality enhances the evolution of cooperation.
Collapse
Affiliation(s)
- Aming Li
- Center for Systems and Control, College of Engineering, Peking University, Beijing, 100871, China.,Department of Zoology and Department of Biochemistry, University of Oxford, Oxford, OX1 3PS, UK.,Center for Complex Network Research and Department of Physics, Northeastern University, Boston, MA, 02115, USA
| | - Lei Zhou
- Center for Systems and Control, College of Engineering, Peking University, Beijing, 100871, China.,Department of Ecology and Evolutionary Biology, Princeton University, Princeton, NJ, 08544, USA
| | - Qi Su
- Center for Systems and Control, College of Engineering, Peking University, Beijing, 100871, China.,Department of Mathematics and Department of Biology, University of Pennsylvania, Philadelphia, PA, 19104, USA
| | - Sean P Cornelius
- Center for Complex Network Research and Department of Physics, Northeastern University, Boston, MA, 02115, USA.,Department of Physics, Ryerson University, Toronto, ON, M5B 2K3, Canada.,Channing Division of Network Medicine, Brigham and Women's Hospital, Harvard Medical School, Boston, MA, 02115, USA
| | - Yang-Yu Liu
- Channing Division of Network Medicine, Brigham and Women's Hospital, Harvard Medical School, Boston, MA, 02115, USA. .,Center for Cancer Systems Biology, Dana-Farber Cancer Institute, Boston, MA, 02115, USA.
| | - Long Wang
- Center for Systems and Control, College of Engineering, Peking University, Beijing, 100871, China.
| | - Simon A Levin
- Department of Ecology and Evolutionary Biology, Princeton University, Princeton, NJ, 08544, USA.
| |
Collapse
|
11
|
Rocha LEC, Masuda N, Holme P. Sampling of temporal networks: Methods and biases. Phys Rev E 2017; 96:052302. [PMID: 29347767 DOI: 10.1103/physreve.96.052302] [Citation(s) in RCA: 21] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/08/2017] [Indexed: 11/07/2022]
Abstract
Temporal networks have been increasingly used to model a diversity of systems that evolve in time; for example, human contact structures over which dynamic processes such as epidemics take place. A fundamental aspect of real-life networks is that they are sampled within temporal and spatial frames. Furthermore, one might wish to subsample networks to reduce their size for better visualization or to perform computationally intensive simulations. The sampling method may affect the network structure and thus caution is necessary to generalize results based on samples. In this paper, we study four sampling strategies applied to a variety of real-life temporal networks. We quantify the biases generated by each sampling strategy on a number of relevant statistics such as link activity, temporal paths and epidemic spread. We find that some biases are common in a variety of networks and statistics, but one strategy, uniform sampling of nodes, shows improved performance in most scenarios. Given the particularities of temporal network data and the variety of network structures, we recommend that the choice of sampling methods be problem oriented to minimize the potential biases for the specific research questions on hand. Our results help researchers to better design network data collection protocols and to understand the limitations of sampled temporal network data.
Collapse
Affiliation(s)
- Luis E C Rocha
- Department of Public Health Sciences, Karolinska Institutet, 17177 Stockholm, Sweden and Department of Mathematics, Université de Namur, 5000 Namur, Belgium
| | - Naoki Masuda
- Department of Engineering Mathematics, University of Bristol, Bristol BS8 1UB, United Kingdom
| | - Petter Holme
- Institute of Innovative Research, Tokyo Institute of Technology, Tokyo 152-8550, Japan
| |
Collapse
|
12
|
Alderisio F, Lombardi M, Fiore G, di Bernardo M. A Novel Computer-Based Set-Up to Study Movement Coordination in Human Ensembles. Front Psychol 2017. [PMID: 28649217 PMCID: PMC5465282 DOI: 10.3389/fpsyg.2017.00967] [Citation(s) in RCA: 14] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022] Open
Abstract
Existing experimental works on movement coordination in human ensembles mostly investigate situations where each subject is connected to all the others through direct visual and auditory coupling, so that unavoidable social interaction affects their coordination level. Here, we present a novel computer-based set-up to study movement coordination in human groups so as to minimize the influence of social interaction among participants and implement different visual pairings between them. In so doing, players can only take into consideration the motion of a designated subset of the others. This allows the evaluation of the exclusive effects on coordination of the structure of interconnections among the players in the group and their own dynamics. In addition, our set-up enables the deployment of virtual computer players to investigate dyadic interaction between a human and a virtual agent, as well as group synchronization in mixed teams of human and virtual agents. We show how this novel set-up can be employed to study coordination both in dyads and in groups over different structures of interconnections, in the presence as well as in the absence of virtual agents acting as followers or leaders. Finally, in order to illustrate the capabilities of the architecture, we describe some preliminary results. The platform is available to any researcher who wishes to unfold the mechanisms underlying group synchronization in human ensembles and shed light on its socio-psychological aspects.
Collapse
Affiliation(s)
- Francesco Alderisio
- Department of Engineering Mathematics, University of BristolBristol, United Kingdom
| | - Maria Lombardi
- Department of Electrical Engineering and Information Technology, University of Naples Federico IINaples, Italy
| | - Gianfranco Fiore
- Department of Engineering Mathematics, University of BristolBristol, United Kingdom
| | - Mario di Bernardo
- Department of Engineering Mathematics, University of BristolBristol, United Kingdom.,Department of Electrical Engineering and Information Technology, University of Naples Federico IINaples, Italy
| |
Collapse
|
13
|
Li X, Li X. Reconstruction of stochastic temporal networks through diffusive arrival times. Nat Commun 2017; 8:15729. [PMID: 28604687 PMCID: PMC5472785 DOI: 10.1038/ncomms15729] [Citation(s) in RCA: 30] [Impact Index Per Article: 4.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/05/2016] [Accepted: 04/24/2017] [Indexed: 11/28/2022] Open
Abstract
Temporal networks have opened a new dimension in defining and quantification of complex interacting systems. Our ability to identify and reproduce time-resolved interaction patterns is, however, limited by the restricted access to empirical individual-level data. Here we propose an inverse modelling method based on first-arrival observations of the diffusion process taking place on temporal networks. We describe an efficient coordinate-ascent implementation for inferring stochastic temporal networks that builds in particular but not exclusively on the null model assumption of mutually independent interaction sequences at the dyadic level. The results of benchmark tests applied on both synthesized and empirical network data sets confirm the validity of our algorithm, showing the feasibility of statistically accurate inference of temporal networks only from moderate-sized samples of diffusion cascades. Our approach provides an effective and flexible scheme for the temporally augmented inverse problems of network reconstruction and has potential in a broad variety of applications. Reconstruction of time-resolved interactions in networks is more challenging than for the time-independent case, as causal relations limit accessibility to empirical data. Here the authors propose a method based on first-arrival observations of a diffusion process to infer stochastic temporal networks.
Collapse
Affiliation(s)
- Xun Li
- Adaptive Networks and Control Laboratory, Department of Electronic Engineering, and Research Center of Smart Networks and Systems, School of Information Science and Engineering, Fudan University, Shanghai 200433, China
| | - Xiang Li
- Adaptive Networks and Control Laboratory, Department of Electronic Engineering, and Research Center of Smart Networks and Systems, School of Information Science and Engineering, Fudan University, Shanghai 200433, China
| |
Collapse
|
14
|
Kleineberg KK, Helbing D. Collective navigation of complex networks: Participatory greedy routing. Sci Rep 2017; 7:2897. [PMID: 28588222 PMCID: PMC5460226 DOI: 10.1038/s41598-017-02910-x] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/12/2016] [Accepted: 04/20/2017] [Indexed: 11/09/2022] Open
Abstract
Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and global navigability? Here, we present an evolutionary game where agents share the value generated by successful delivery of information or goods. We show that global navigability can emerge, but its complete breakdown is possible as well. Furthermore, we show that the system tends to self-organize into local clusters of agents who participate in the navigation. This organizational principle can be exploited to favor the emergence of global navigability in the system.
Collapse
Affiliation(s)
- Kaj-Kolja Kleineberg
- Computational Social Science, ETH Zurich, Clausiusstrasse 50, CH-8092, Zurich, Switzerland.
| | - Dirk Helbing
- Computational Social Science, ETH Zurich, Clausiusstrasse 50, CH-8092, Zurich, Switzerland
| |
Collapse
|
15
|
Alderisio F, Fiore G, di Bernardo M. Reconstructing the structure of directed and weighted networks of nonlinear oscillators. Phys Rev E 2017; 95:042302. [PMID: 28505733 DOI: 10.1103/physreve.95.042302] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/02/2016] [Indexed: 06/07/2023]
Abstract
The formalism of complex networks is extensively employed to describe the dynamics of interacting agents in several applications. The features of the connections among the nodes in a network are not always provided beforehand, hence the problem of appropriately inferring them often arises. Here, we present a method to reconstruct directed and weighted topologies of networks of heterogeneous nonlinear oscillators. We illustrate the theory on a set of representative examples.
Collapse
Affiliation(s)
- Francesco Alderisio
- Department of Engineering Mathematics, Merchant Venturers Building, University of Bristol, Woodland Road, Clifton, Bristol BS8 1UB, United Kingdom
| | - Gianfranco Fiore
- Department of Engineering Mathematics, Merchant Venturers Building, University of Bristol, Woodland Road, Clifton, Bristol BS8 1UB, United Kingdom
| | - Mario di Bernardo
- Department of Engineering Mathematics, Merchant Venturers Building, University of Bristol, Woodland Road, Clifton, Bristol BS8 1UB, United Kingdom
| |
Collapse
|
16
|
Abstract
The brain is one of the largest and most complex organs in the human body and EEG is a noninvasive electrophysiological monitoring method that is used to record the electrical activity of the brain. Lately, the functional connectivity in human brain has been regarded and studied as a complex network using EEG signals. This means that the brain is studied as a connected system where nodes, or units, represent different specialized brain regions and links, or connections, represent communication pathways between the nodes. Graph theory and theory of complex networks provide a variety of measures, methods, and tools that can be useful to efficiently model, analyze, and study EEG networks. This article is addressed to computer scientists who wish to be acquainted and deal with the study of EEG data and also to neuroscientists who would like to become familiar with graph theoretic approaches and tools to analyze EEG data.
Collapse
Affiliation(s)
- Nantia D Iakovidou
- Data Engineering Laboratory, Department of Informatics, Aristotle University of Thessaloniki , Thessaloniki, Greece
| |
Collapse
|
17
|
Giraldo LF, Passino KM. Dynamics of Cooperation in a Task Completion Social Dilemma. PLoS One 2017; 12:e0170604. [PMID: 28125721 PMCID: PMC5270338 DOI: 10.1371/journal.pone.0170604] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/23/2016] [Accepted: 01/08/2017] [Indexed: 12/02/2022] Open
Abstract
We study the situation where the members of a community have the choice to participate in the completion of a common task. The process of completing the task involves only costs and no benefits to the individuals that participate in this process. However, completing the task results in changes that significantly benefit the community and that exceed the participation efforts. A task completion social dilemma arises when the short-term participation costs dissipate any interest in the community members to contribute to the task completion process and therefore to obtain the benefits that result from completing the task. In this work, we model the task completion problem using a dynamical system that characterizes the participation dynamics in the community and the task completion process. We show how this model naturally allows for the incorporation of several mechanisms that facilitate the emergence of cooperation and that have been studied in previous research on social dilemmas, including communication across a network, and indirect reciprocity through relative reputation. We provide mathematical analyses and computer simulations to study the qualitative properties of the participation dynamics in the community for different scenarios.
Collapse
Affiliation(s)
- Luis Felipe Giraldo
- Department of Electrical and Electronics Engineering, Universidad de Los Andes, Bogotá, Colombia
- * E-mail:
| | - Kevin M. Passino
- Department of Electrical and Computer Engineering, The Ohio State University, Columbus, Ohio, United States of America
| |
Collapse
|
18
|
Alderisio F, Lombardi M, Fiore G, di Bernardo M. A Novel Computer-Based Set-Up to Study Movement Coordination in Human Ensembles. Front Psychol 2017; 8:967. [PMID: 28649217 DOI: 10.3389/fpsyg.2017.00967/bibtex] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Key Words] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/07/2016] [Accepted: 05/26/2017] [Indexed: 05/19/2023] Open
Abstract
Existing experimental works on movement coordination in human ensembles mostly investigate situations where each subject is connected to all the others through direct visual and auditory coupling, so that unavoidable social interaction affects their coordination level. Here, we present a novel computer-based set-up to study movement coordination in human groups so as to minimize the influence of social interaction among participants and implement different visual pairings between them. In so doing, players can only take into consideration the motion of a designated subset of the others. This allows the evaluation of the exclusive effects on coordination of the structure of interconnections among the players in the group and their own dynamics. In addition, our set-up enables the deployment of virtual computer players to investigate dyadic interaction between a human and a virtual agent, as well as group synchronization in mixed teams of human and virtual agents. We show how this novel set-up can be employed to study coordination both in dyads and in groups over different structures of interconnections, in the presence as well as in the absence of virtual agents acting as followers or leaders. Finally, in order to illustrate the capabilities of the architecture, we describe some preliminary results. The platform is available to any researcher who wishes to unfold the mechanisms underlying group synchronization in human ensembles and shed light on its socio-psychological aspects.
Collapse
Affiliation(s)
- Francesco Alderisio
- Department of Engineering Mathematics, University of BristolBristol, United Kingdom
| | - Maria Lombardi
- Department of Electrical Engineering and Information Technology, University of Naples Federico IINaples, Italy
| | - Gianfranco Fiore
- Department of Engineering Mathematics, University of BristolBristol, United Kingdom
| | - Mario di Bernardo
- Department of Engineering Mathematics, University of BristolBristol, United Kingdom
- Department of Electrical Engineering and Information Technology, University of Naples Federico IINaples, Italy
| |
Collapse
|
19
|
Sun GQ, Jusup M, Jin Z, Wang Y, Wang Z. Pattern transitions in spatial epidemics: Mechanisms and emergent properties. Phys Life Rev 2016; 19:43-73. [PMID: 27567502 PMCID: PMC7105263 DOI: 10.1016/j.plrev.2016.08.002] [Citation(s) in RCA: 81] [Impact Index Per Article: 10.1] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/29/2016] [Accepted: 08/04/2016] [Indexed: 12/19/2022]
Abstract
Infectious diseases are a threat to human health and a hindrance to societal development. Consequently, the spread of diseases in both time and space has been widely studied, revealing the different types of spatial patterns. Transitions between patterns are an emergent property in spatial epidemics that can serve as a potential trend indicator of disease spread. Despite the usefulness of such an indicator, attempts to systematize the topic of pattern transitions have been few and far between. We present a mini-review on pattern transitions in spatial epidemics, describing the types of transitions and their underlying mechanisms. We show that pattern transitions relate to the complexity of spatial epidemics by, for example, being accompanied with phenomena such as coherence resonance and cyclic evolution. The results presented herein provide valuable insights into disease prevention and control, and may even be applicable outside epidemiology, including other branches of medical science, ecology, quantitative finance, and elsewhere.
Collapse
Affiliation(s)
- Gui-Quan Sun
- Complex Systems Research Center, Shanxi University, Taiyuan, Shanxi 030006, PR China; School of Mathematical Sciences, Fudan University, Shanghai 200433, PR China.
| | - Marko Jusup
- Department of Vector Ecology and Environment, Nagasaki University Institute of Tropical Medicine (NEKKEN), Nagasaki 852-8523, Japan; Center of Mathematics for Social Creativity, Hokkaido University, Sapporo 060-0812, Japan.
| | - Zhen Jin
- Complex Systems Research Center, Shanxi University, Taiyuan, Shanxi 030006, PR China.
| | - Yi Wang
- Department of Mathematics, Southeast University, Nanjing 210096, PR China; Department of Mathematics and Statistics, University of Victoria, Victoria BC V8W 3R4, Canada
| | - Zhen Wang
- Interdisciplinary Graduate School of Engineering Sciences, Kyushu University, Fukuoka, 816-8580, Japan.
| |
Collapse
|
20
|
Masuda N. Accelerating coordination in temporal networks by engineering the link order. Sci Rep 2016; 6:22105. [PMID: 26916093 PMCID: PMC4768265 DOI: 10.1038/srep22105] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/30/2015] [Accepted: 02/08/2016] [Indexed: 11/09/2022] Open
Abstract
Social dynamics on a network may be accelerated or decelerated depending on which pairs of individuals in the network communicate early and which pairs do later. The order with which the links in a given network are sequentially used, which we call the link order, may be a strong determinant of dynamical behaviour on networks, potentially adding a new dimension to effects of temporal networks relative to static networks. Here we study the effect of the link order on linear coordination (i.e., synchronisation) dynamics. We show that the coordination speed considerably depends on specific orders of links. In addition, applying each single link for a long time to ensure strong pairwise coordination before moving to a next pair of individuals does not often enhance coordination of the entire network. We also implement a simple greedy algorithm to optimise the link order in favour of fast coordination.
Collapse
Affiliation(s)
- Naoki Masuda
- University of Bristol, Department of Engineering Mathematics, Bristol, BS8 1UB, United Kingdom
| |
Collapse
|
21
|
Wang Z, Andrews MA, Wu ZX, Wang L, Bauch CT. Coupled disease-behavior dynamics on complex networks: A review. Phys Life Rev 2015; 15:1-29. [PMID: 26211717 PMCID: PMC7105224 DOI: 10.1016/j.plrev.2015.07.006] [Citation(s) in RCA: 163] [Impact Index Per Article: 18.1] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/02/2015] [Revised: 06/24/2015] [Accepted: 06/25/2015] [Indexed: 01/30/2023]
Abstract
It is increasingly recognized that a key component of successful infection control efforts is understanding the complex, two-way interaction between disease dynamics and human behavioral and social dynamics. Human behavior such as contact precautions and social distancing clearly influence disease prevalence, but disease prevalence can in turn alter human behavior, forming a coupled, nonlinear system. Moreover, in many cases, the spatial structure of the population cannot be ignored, such that social and behavioral processes and/or transmission of infection must be represented with complex networks. Research on studying coupled disease-behavior dynamics in complex networks in particular is growing rapidly, and frequently makes use of analysis methods and concepts from statistical physics. Here, we review some of the growing literature in this area. We contrast network-based approaches to homogeneous-mixing approaches, point out how their predictions differ, and describe the rich and often surprising behavior of disease-behavior dynamics on complex networks, and compare them to processes in statistical physics. We discuss how these models can capture the dynamics that characterize many real-world scenarios, thereby suggesting ways that policy makers can better design effective prevention strategies. We also describe the growing sources of digital data that are facilitating research in this area. Finally, we suggest pitfalls which might be faced by researchers in the field, and we suggest several ways in which the field could move forward in the coming years.
Collapse
Affiliation(s)
- Zhen Wang
- School of Automation, Northwestern Polytechnical University, Xi'an 710072, China; Interdisciplinary Graduate School of Engineering Sciences, Kyushu University, Fukuoka, 816-8580, Japan.
| | - Michael A Andrews
- Department of Mathematics and Statistics, University of Guelph, Guelph, ON, N1G 2W1, Canada.
| | - Zhi-Xi Wu
- Institute of Computational Physics and Complex Systems, Lanzhou University, Lanzhou, Gansu 730000, China.
| | - Lin Wang
- School of Computer and Communication Engineering, Tianjin University of Technology, Tianjin 300384, China.
| | - Chris T Bauch
- Department of Applied Mathematics, University of Waterloo, Waterloo, ON N2L 3G1, Canada.
| |
Collapse
|
22
|
Di Stefano A, Scatà M, La Corte A, Liò P, Catania E, Guardo E, Pagano S. Quantifying the Role of Homophily in Human Cooperation Using Multiplex Evolutionary Game Theory. PLoS One 2015; 10:e0140646. [PMID: 26496351 PMCID: PMC4619798 DOI: 10.1371/journal.pone.0140646] [Citation(s) in RCA: 23] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/23/2015] [Accepted: 09/29/2015] [Indexed: 12/03/2022] Open
Abstract
Nature shows as human beings live and grow inside social structures. This assumption allows us to explain and explore how it may shape most of our behaviours and choices, and why we are not just blindly driven by instincts: our decisions are based on more complex cognitive reasons, based on our connectedness on different spaces. Thus, human cooperation emerges from this complex nature of social network. Our paper, focusing on the evolutionary dynamics, is intended to explore how and why it happens, and what kind of impact is caused by homophily among people. We investigate the evolution of human cooperation using evolutionary game theory on multiplex. Multiplexity, as an extra dimension of analysis, allows us to unveil the hidden dynamics and observe non-trivial patterns within a population across network layers. More importantly, we find a striking role of homophily, as the higher the homophily between individuals, the quicker is the convergence towards cooperation in the social dilemma. The simulation results, conducted both macroscopically and microscopically across the network layers in the multiplex, show quantitatively the role of homophily in human cooperation.
Collapse
Affiliation(s)
- Alessandro Di Stefano
- Dipartimento di Ingegneria Elettrica, Elettronica e Informatica (DIEEI), Università degli Studi di Catania, Catania, Italy
| | - Marialisa Scatà
- Dipartimento di Ingegneria Elettrica, Elettronica e Informatica (DIEEI), Università degli Studi di Catania, Catania, Italy
| | - Aurelio La Corte
- Dipartimento di Ingegneria Elettrica, Elettronica e Informatica (DIEEI), Università degli Studi di Catania, Catania, Italy
| | - Pietro Liò
- Computer Laboratory, University of Cambridge, Cambridge, United Kingdom
| | - Emanuele Catania
- Dipartimento di Ingegneria Elettrica, Elettronica e Informatica (DIEEI), Università degli Studi di Catania, Catania, Italy
| | - Ermanno Guardo
- Dipartimento di Ingegneria Elettrica, Elettronica e Informatica (DIEEI), Università degli Studi di Catania, Catania, Italy
| | - Salvatore Pagano
- Dipartimento di Ingegneria Elettrica, Elettronica e Informatica (DIEEI), Università degli Studi di Catania, Catania, Italy
| |
Collapse
|