检索结果-内蒙古大学图书馆

Temporal networks provide a unifying understanding of the evolution of cooperation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Aming Meng, Yao Zhou, Lei Masuda, Naoki Wang, Long Center for Systems and Control College of Engineering Peking University Beijing100871 China Center for Multi-Agent Research Institute for Artificial Intelligence Peking University Beijing100871 China School of Automation Beijing Institute of Technology Beijing100081 China Department of Mathematics State University of New York at Buffalo BuffaloNY14260 United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY14260 United States

Understanding the evolution of cooperation in structured populations represented by networks is a problem of long research interest, and a most fundamental and widespread property of social networks related to cooperation phenomena is that the node’s degree (i.e., number of edges connected to the node) is heterogeneously distributed. Previous results indicate that static heterogeneous (i.e., degree-heterogeneous) networks promote cooperation in stationarity compared to static regular (i.e., degree-homogeneous) networks if equilibrium dynamics starting from many cooperators and defectors is employed. However, the above conclusion reverses if we employ non-equilibrium stochastic processes to measure the fixation probability for cooperation, i.e., the probability that a single cooperator successfully invades a population. Here we resolve this conundrum by analyzing the fixation of cooperation on temporal (i.e., time-varying) networks. We theoretically prove and numerically confirm that on both synthetic and empirical networks, contrary to the case of static networks, temporal heterogeneous networks can promote cooperation more than temporal regular networks in terms of the fixation probability of cooperation. Given that the same conclusion is known for the equilibrium fraction of cooperators on temporal networks, the present results provide a unified understanding of the effect of temporal degree heterogeneity on promoting cooperation across two main analytical frameworks, i.e., equilibrium and non-equilibrium ones. Copyright © 2023, The Authors. All rights reserved.

关键词： Heterogeneous networks

Metapopulation models imply non-Poissonian statistics of interevent times

学校读者我要写书评

暂无评论

arXiv 2021年

作者： dos Reis, Elohim Fonseca Masuda, Naoki Department of Mathematics State University of New York at Buffalo BuffaloNY United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY United States

Interevent times in temporal contact data from humans and animals typically obey heavy-tailed distributions, and this property impacts contagion and other dynamical processes on networks. We theoretically show that distributions of interevent times heavier-tailed than exponential distributions are a consequence of the most basic metapopulation model used in epidemiology and ecology, in which individuals move from a patch to another according to the simple random walk. Our results hold true irrespectively of the network structure and also for more realistic mobility rules such as high-order random walks and the recurrent mobility patterns used for modeling human dynamics. Copyright © 2021, The Authors. All rights reserved.

关键词： Random processes

Opinion dynamics on tie-decay networks

学校读者我要写书评

暂无评论

Physical Review Research 2021年第2期3卷 023249-023249页

作者： Kashin Sugishita Mason A. Porter Mariano Beguerisse-Díaz Naoki Masuda Department of Mathematics State University of New York at Buffalo Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo New York 14260-5030 USA and Faculty of Science and Engineering Waseda University 169-8555 Tokyo Japan

In social networks, interaction patterns typically change over time. We study opinion dynamics on tie-decay networks in which tie strength increases instantaneously when there is an interaction and decays exponentially between interactions. Specifically, we formulate continuous-time Laplacian dynamics and a discrete-time DeGroot model of opinion dynamics on these tie-decay networks, and we carry out numerical computations for the continuous-time Laplacian dynamics. We examine the speed of convergence by studying the spectral gaps of combinatorial Laplacian matrices of tie-decay networks. First, we compare the spectral gaps of the Laplacian matrices of tie-decay networks that we construct from empirical data with the spectral gaps for corresponding randomized and aggregate networks. We find that the spectral gaps for the empirical networks tend to be smaller than those for the randomized and aggregate networks. Second, we study the spectral gap as a function of the tie-decay rate and time. Intuitively, we expect small tie-decay rates to lead to fast convergence because the influence of each interaction between two nodes lasts longer for smaller decay rates. Moreover, as time progresses and more interactions occur, we expect eventual convergence. However, we demonstrate that the spectral gap need not decrease monotonically with respect to the decay rate or increase monotonically with respect to time. Our results highlight the importance of the interplay between the times that edges strengthen and decay in temporal networks.

关键词： Network structure Social networks Consensus & non-consensus models

Effects of concurrency on epidemic spreading in Markovian temporal networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Liu, Ruodan Ogura, Masaki Reis, Elohim Fonseca Dos Masuda, Naoki Department of Mathematics State University of New York at Buffalo BuffaloNY14260-2900 United States Graduate School of Information Science and Technology Osaka University Osaka Suita565-0871 Japan Computational and Data-Enabled Sciences and Engineering Program State University of New York at Buffalo BuffaloNY14260-5030 United States Faculty of Science and Engineering Waseda University Tokyo169-8555 Japan

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. Copyright © 2022, The Authors. All rights reserved.

关键词： Dynamics

Randomizing hypergraphs preserving degree correlation and local clustering

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Nakajima, Kazuki Shudo, Kazuyuki Masuda, Naoki Department of Mathematical and Computing Science Tokyo Institute of Technology Japan Department of Mathematics State University of New York Buffalo United States Computational and Data-Enabled Science and Engineering Program State University of New York Buffalo United States Faculty of Science and Engineering Waseda University Japan

Many complex systems involve direct interactions among more than two entities and can be represented by hypergraphs, in which hyperedges encode higher-order interactions among an arbitrary number of nodes. To analyze structures and dynamics of given hypergraphs, a solid practice is to compare them with those for randomized hypergraphs that preserve some specific properties of the original hypergraphs. In the present study, we propose a family of such reference models for hypergraphs, called the hyper dk-series, by extending the so-called dk-series for dyadic networks to the case of hypergraphs. The hyper dk-series preserves up to the individual node’s degree, node’s degree correlation, node’s redundancy coefficient, and/or the hyperedge’s size depending on the parameter values. Furthermore, we numerically find that higher-order hyper dk-series more accurately preserves the shortest path length and degree distribution of the one-mode projection of the original hypergraph, which the method does not intend to preserve. We also apply the hyper dk-series to numerical simulations of epidemic spreading and evolutionary game dynamics on empirical social hypergraphs. We find that the hyperedge’s size affects these dynamics more than any of the node’s properties and that the node’s degree correlation and redundancy in the empirical hypergraphs promote cooperation. Copyright © 2021, The Authors. All rights reserved.

关键词： Redundancy

Finite-size effects on the convergence time in continuous-opinion dynamics

学校读者我要写书评

暂无评论

Physical Review E 2021年第1期104卷 014309-014309页

作者： Hang-Hyun Jo Naoki Masuda Department of Physics The Catholic University of Korea Bucheon 14662 Republic of Korea Department of Mathematics State University of New York at Buffalo Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo New York 14260-5030 USA

We study finite-size effects on the convergence time in a continuous-opinion dynamics model. In the model, each individual's opinion is represented by a real number on a finite interval, e.g., [0,1], and a uniformly randomly chosen individual updates its opinion by partially mimicking the opinion of a uniformly randomly chosen neighbor. We numerically find that the characteristic time to the convergence increases as the system size increases according to a particular functional form in the case of lattice networks. In contrast, unless the individuals perfectly copy the opinion of their neighbors in each opinion updating, the convergence time is approximately independent of the system size in the case of regular random graphs, uncorrelated scale-free networks, and complete graphs. We also provide a mean-field analysis of the model to understand the case of the complete graph.

关键词： Complex systems Nonequilibrium statistical mechanics Social systems Homogeneous networks Scale free & inhomogeneous networks Social dynamics Master equation Monte Carlo methods Network Models

Epidemic dynamics on metapopulation networks with node2vec mobility

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Meng, Lingqi Masuda, Naoki Department of Mathematics State University of New York BuffaloNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program State University of New York BuffaloNY14260-5030 United States Faculty of Science and Engineering Waseda University Tokyo169-8555 Japan

Metapopulation models have been a powerful tool for both theorizing and simulating epidemic dynamics. In a metapopulation model, one considers a network composed of subpopulations and their pairwise connections, and individuals are assumed to migrate from one subpopulation to another obeying a given mobility rule. While how different mobility rules affect epidemic dynamics in metapopulation models has been studied, there have been relatively few efforts on comparison of the effects of simple (i.e., unbiased) random walks and more complex mobility rules. Here we study a susceptible-infectious-susceptible (SIS) dynamics in a metapopulation model, in which individuals obey a parametric second-order random-walk mobility rule called the node2vec. We map the second-order mobility rule of the node2vec to a first-order random walk in a network whose each node is a directed edge connecting a pair of subpopulations and then derive the epidemic threshold. For various networks, we find that the epidemic threshold is large (therefore, epidemic spreading tends to be suppressed) when the individuals infrequently backtrack or infrequently visit the common neighbors of the currently visited and the last visited subpopulations than when the individuals obey the simple random walk. The amount of change in the epidemic threshold induced by the node2vec mobility is in general not as large as, but is sometimes comparable with, the one induced by the change in the diffusion rate for individuals. Copyright © 2021, The Authors. All rights reserved.

关键词： Random processes

Network Intrusion Detection System Using Principal Component Analysis Algorithm and Decision Tree Classifier

学校读者我要写书评

暂无评论

Network Intrusion Detection System Using Principal Component...

International Conference on computational science and computational Intelligence (CSCI)

作者： Oyeyemi Osho Sungbum Hong Tor A. Kwembe Department of Computational Data-Enabled Science and Engineering(CDS&#x0026 E) Jackson State University Jackson MS USA Department of Electrical &#x0026 Computer Engineering and Computer Science Jackson State University Jackson MS USA Department of Mathematics &#x0026 Statistical Sciences Jackson State University Jackson MS USA

ISBN: (纸本)9781665458429

Network Intrusion Detection Systems (IDS) have become expedient for network security and ensures the safety of all connected devices. Network Intrusion Detection System (IDS) alludes to observing network data information swiftly, detecting any intrusion pattern and preventing any harmful effect of anomaly intrusion that will cost the network. To combat this issue, we present in this concept paper an IDS based on the Principal Component Analysis (PCA) and Decision Tree Classifier algorithm, a supervised machine learning model to detect intrusion in the Network.

关键词： Machine learning algorithms Costs Scientific computing Network intrusion detection Network security Classification algorithms Safety

Higher-order rich-club phenomenon in collaborative research grant networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Nakajima, Kazuki Shudo, Kazuyuki Masuda, Naoki Department of Mathematical and Computing Science Tokyo Institute of Technology Meguro-ku Tokyo152-8552 Japan Department of Mathematics State University of New York at Buffalo Buffalo14260 United States Academic Center for Computing and Media Studies Kyoto University Sakyo-ku Kyoto606-8501 Japan Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo14260 United States Faculty of Science and Engineering Waseda University Tokyo169-8555 Japan

Modern scientific work, including writing papers and submitting research grant proposals, increasingly involves researchers from different institutions. In grant collaborations, it is known that institutions involved in many collaborations tend to densely collaborate with each other, forming rich clubs. Here we investigate higher-order rich-club phenomena in networks of collaborative research grants among institutions and their associations with research impact. Using publicly available data from the National science Foundation in the US, we construct a bipartite network of institutions and collaborative grants, which distinguishes among the collaboration with different numbers of institutions. By extending the concept and algorithms of the rich club for dyadic networks to the case of bipartite networks, we find rich clubs both in the entire bipartite network and the bipartite subnetwork induced by the collaborative grants involving a given number of institutions up to five. We also find that the collaborative grants within rich clubs tend to be more productive in a per-dollar sense than the control. Our results highlight advantages of collaborative grants among the institutions in the rich clubs. Copyright © 2022, The Authors. All rights reserved.

关键词：