Ruodan Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ruodan Liu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Naoki Masuda
University of Michigan
3 shared publications - Elohim Fonseca dos Reis
Department of Mathematics, State University of New York at Buffalo, Buffalo, NY, 14260-2900, USA
1 shared publication - Kazuki Nakajima
Graduate School of Systems Design, Tokyo Metropolitan University, Hino-shi, Japan
1 shared publication - Kazuyuki Shudo
Academic Center for Computing and Media Studies, Kyoto University, Kyoto, Japan
1 shared publication - Masaki Ogura
Graduate School of Advanced Science and Engineering, Hiroshima University, Hiroshima, Japan
1 shared publication Naoki Masuda
Department of Mathematics, State University of New York at Buffalo, Buffalo, NY 14260-2900 USA, Institute for Artificial Intelligence and Data Science, State University of New York at Buffalo, Buffalo, NY 14260-5030 USA, and Center for Computational Social Science, Kobe University, Kobe, 657-8501 Japan
1 shared publication
Latest Publications
- 1 October 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 84 (5) , 2028-2050
Fixation Dynamics on Multilayer Networks
Network structure has a large impact on constant-selection evolutionary dynamics, with which multiple types of fitness (i.e., strength) compete on the network. Here we study constant-selection dynamics on two-layer networks in which the fitness of a node in one layer affects that in the other layer, under birth-death processes and uniform initialization, which are commonly assumed. We show mathematically and numerically that two-layer networks are suppressors of selection, which means that they suppress the effects of the different fitness values among the different types on the final outcomes of the evolutionary dynamics (called fixation probability) relative to the constituent one-layer networks. In fact, many two-layer networks are suppressors of selection relative to the most basic baseline, the Moran process. This result is in stark contrast with the results for conventional one-layer networks for which most networks are amplifiers of selection.
- 1 October 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 84 (5) , 2028-2050
Fixation Dynamics on Multilayer Networks
Network structure has a large impact on constant-selection evolutionary dynamics, with which multiple types of fitness (i.e., strength) compete on the network. Here we study constant-selection dynamics on two-layer networks in which the fitness of a node in one layer affects that in the other layer, under birth-death processes and uniform initialization, which are commonly assumed. We show mathematically and numerically that two-layer networks are suppressors of selection, which means that they suppress the effects of the different fitness values among the different types on the final outcomes of the evolutionary dynamics (called fixation probability) relative to the constituent one-layer networks. In fact, many two-layer networks are suppressors of selection relative to the most basic baseline, the Moran process. This result is in stark contrast with the results for conventional one-layer networks for which most networks are amplifiers of selection.
- Open Access
- 7 November 2023
- Published by Elsevier in Journal of Informetrics
- Vol. 17 (4)
Quantifying gender imbalance in East Asian academia: Research career and citation practice
- 7 November 2023
- Published by Elsevier in Journal of Informetrics
- Vol. 17 (4)
Open AccessQuantifying gender imbalance in East Asian academia: Research career and citation practice
- Open Access
- 18 October 2023
- Published by Cambridge University Press (CUP) in European Journal of Applied Mathematics
- Vol. 35 (3) , 430-461
Effects of concurrency on epidemic spreading in Markovian temporal networks
The concurrency of edges, quantified by the number of edges that share a common node at a given time point, may be an important determinant of epidemic processes in temporal networks. We propose theoretically tractable Markovian temporal network models in which each edge flips between the active and inactive states in continuous time. The different models have different amounts of concurrency while we can tune the models to share the same statistics of edge activation and deactivation (and hence the fraction of time for which each edge is active) and the structure of the aggregate (i.e., static) network. We analytically calculate the amount of concurrency of edges sharing a node for each model. We then numerically study effects of concurrency on epidemic spreading in the stochastic susceptible-infectious-susceptible and susceptible-infectious-recovered dynamics on the proposed temporal network models. We find that the concurrency enhances epidemic spreading near the epidemic threshold, while this effect is small in many cases. Furthermore, when the infection rate is substantially larger than the epidemic threshold, the concurrency suppresses epidemic spreading in a majority of cases. In sum, our numerical simulations suggest that the impact of concurrency on enhancing epidemic spreading within our model is consistently present near the epidemic threshold but modest. The proposed temporal network models are expected to be useful for investigating effects of concurrency on various collective dynamics on networks including both infectious and other dynamics.
- 18 October 2023
- Published by Cambridge University Press (CUP) in European Journal of Applied Mathematics
- Vol. 35 (3) , 430-461
Open AccessEffects of concurrency on epidemic spreading in Markovian temporal networks
The concurrency of edges, quantified by the number of edges that share a common node at a given time point, may be an important determinant of epidemic processes in temporal networks. We propose theoretically tractable Markovian temporal network models in which each edge flips between the active and inactive states in continuous time. The different models have different amounts of concurrency while we can tune the models to share the same statistics of edge activation and deactivation (and hence the fraction of time for which each edge is active) and the structure of the aggregate (i.e., static) network. We analytically calculate the amount of concurrency of edges sharing a node for each model. We then numerically study effects of concurrency on epidemic spreading in the stochastic susceptible-infectious-susceptible and susceptible-infectious-recovered dynamics on the proposed temporal network models. We find that the concurrency enhances epidemic spreading near the epidemic threshold, while this effect is small in many cases. Furthermore, when the infection rate is substantially larger than the epidemic threshold, the concurrency suppresses epidemic spreading in a majority of cases. In sum, our numerical simulations suggest that the impact of concurrency on enhancing epidemic spreading within our model is consistently present near the epidemic threshold but modest. The proposed temporal network models are expected to be useful for investigating effects of concurrency on various collective dynamics on networks including both infectious and other dynamics.
- Open Access
- 26 September 2023
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 19 (9) , e1011494
Fixation dynamics on hypergraphs
Hypergraphs have been a useful tool for analyzing population dynamics such as opinion formation and the public goods game occurring in overlapping groups of individuals. In the present study, we propose and analyze evolutionary dynamics on hypergraphs, in which each node takes one of the two types of different but constant fitness values. For the corresponding dynamics on conventional networks, under the birth-death process and uniform initial conditions, most networks are known to be amplifiers of natural selection; amplifiers by definition enhance the difference in the strength of the two competing types in terms of the probability that the mutant type fixates in the population. In contrast, we provide strong computational evidence that a majority of hypergraphs are suppressors of selection under the same conditions by combining theoretical and numerical analyses. We also show that this suppressing effect is not explained by one-mode projection, which is a standard method for expressing hypergraph data as a conventional network. Our results suggest that the modeling framework for structured populations in addition to the specific network structure is an important determinant of evolutionary dynamics, paving a way to studying fixation dynamics on higher-order networks including hypergraphs.
- 26 September 2023
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 19 (9) , e1011494
Open AccessFixation dynamics on hypergraphs
Hypergraphs have been a useful tool for analyzing population dynamics such as opinion formation and the public goods game occurring in overlapping groups of individuals. In the present study, we propose and analyze evolutionary dynamics on hypergraphs, in which each node takes one of the two types of different but constant fitness values. For the corresponding dynamics on conventional networks, under the birth-death process and uniform initial conditions, most networks are known to be amplifiers of natural selection; amplifiers by definition enhance the difference in the strength of the two competing types in terms of the probability that the mutant type fixates in the population. In contrast, we provide strong computational evidence that a majority of hypergraphs are suppressors of selection under the same conditions by combining theoretical and numerical analyses. We also show that this suppressing effect is not explained by one-mode projection, which is a standard method for expressing hypergraph data as a conventional network. Our results suggest that the modeling framework for structured populations in addition to the specific network structure is an important determinant of evolutionary dynamics, paving a way to studying fixation dynamics on higher-order networks including hypergraphs.