15 April 2024 in Nature Computational Science
11 November 2023 in Nature Communications
Human social interactions tend to vary in intensity over time, whether they are in person or online. Variable rates of interaction in structured populations can be described by networks with the time-varying activity of links and nodes. One of the key statistics to summarize temporal patterns is the inter-event time, namely the duration between successive pairwise interactions. Empirical studies have found inter-event time distributions that are heavy-tailed, for both physical and digital interactions. But it is difficult to construct theoretical models of time-varying activity on a network that reproduce the burstiness seen in empirical data. Here we develop a spanning-tree method to construct temporal networks and activity patterns with bursty behavior. Our method ensures any desired target inter-event time distributions for individual nodes and links, provided the distributions fulfill a consistency condition, regardless of whether the underlying topology is static or time-varying. We show that this model can reproduce burstiness found in empirical datasets, and so it may serve as a basis for studying dynamic processes in real-world bursty interactions.
7 August 2023 in PLOS Computational Biology
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.
5 August 2026 in Proceedings of the National Academy of Sciences
Graphs provide a natural framework to describe processes shaped by pairwise interactions among agents. But many dynamical systems involve interactions within groups of three or more agents. Here, we develop the “ -hyperedge approximation,” an analytical framework for stochastic processes on regular hypergraphs, in which each individual belongs to groups of size . The framework accommodates both higher-order interactions that determine payoffs and higher-order processes for updating states in response to payoffs. For evolutionary games on hypergraphs, our analysis generalizes the classical rule for cooperation to the -player donation game; and it yields critical benefit-to-cost ratios for the nonlinear -player public goods game, which remains bounded as the degree grows. Applied to neutral complex contagions, where inheritance of states occurs within hyperedges rather than along parent–offspring edges, the framework gives a closed-form fixation probability, showing how a single complexity parameter governs the spread of rare types. Coupling the two processes produces a unified stochastic model of payoff-biased complex contagions in structured populations. Together, these results extend pair approximation from graphs to hypergraphs, accommodating multiway interactions and group-level inheritance with no pairwise analog.