arXiv subjects

Naoki Masuda

Publications and source records attributed to Naoki Masuda.

175 records · Page 10Linked to original sources

arXiv2008

Oscillatory dynamics in evolutionary games are suppressed by heterogeneous adaptation rates of players

Game dynamics in which three or more strategies are cyclically competitive, as represented by the rock-scissors-paper game, have attracted practical and theoretical interests. In evolutionary dynamics, cyclic competition results in oscillatory dynamics of densities of individual strategists. In finite-size populations, it is known that oscillations blow up until all but one strategies are eradicated if without mutation. In the present paper, we formalize replicator dynamics with players that have different adaptation rates. We show analytically and numerically that the heterogeneous adaptation rate suppresses the oscillation amplitude. In social dilemma games with cyclically competing strategies and homogeneous adaptation rates, altruistic strategies are often relatively weak and cannot survive in finite-size populations. In such situations, heterogeneous adaptation rates save coexistence of different strategies and hence promote altruism. When one strategy dominates the others without cyclic competition, fast adaptors earn more than slow adaptors. When not, mixture of fast and slow adaptors stabilizes population dynamics, and slow adaptation does not imply inefficiency for a player.

q-bio.PE↗

arXiv2007

Statistical properties of a generalized threshold network model

The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of weights belong to given Borel sets. We extend several known limit theorems for the number of prescribed subgraphs to show that the strong law of large numbers can be uniform convergence. We also prove two limit theorems for the local and global clustering coefficients.

math.PR↗

arXiv2007

Heterogeneity in connectivity of habitat networks saves stable coexistence of competing species

Coexistence of individuals with different species or phenotypes is often found in nature in spite of competition between them. Stable coexistence of multiple types of individuals have implications for maintenance of ecological biodiversity and emergence of altruism in society, to name a few. Various mechanisms of coexistence including spatial structure of populations, heterogeneous individuals, and heterogeneous environments, have been proposed. In reality, individuals disperse and interact on complex networks. We examine how heterogeneous degree distributions of networks influence coexistence, focusing on models of cyclically competing species. We show analytically and numerically that heterogeneity in degree distributions promotes stable coexistence.

cond-mat.dis-nn↗

arXiv2006

Multi-state epidemic processes on complex networks

Infectious diseases are practically represented by models with multiple states and complex transition rules corresponding to, for example, birth, death, infection, recovery, disease progression, and quarantine. In addition, networks underlying infection events are often much more complex than described by meanfield equations or regular lattices. In models with simple transition rules such as the SIS and SIR models, heterogeneous contact rates are known to decrease epidemic thresholds. We analyze steady states of various multi-state disease propagation models with heterogeneous contact rates. In many models, heterogeneity simply decreases epidemic thresholds. However, in models with competing pathogens and mutation, coexistence of different pathogens for small infection rates requires network-independent conditions in addition to heterogeneity in contact rates. Furthermore, models without spontaneous neighbor-independent state transitions, such as cyclically competing species, do not show heterogeneity effects.

cond-mat.dis-nn↗

arXiv2006

Epidemic Dynamics of Interacting Two Particle Species on Scale-free Networks

We study the non-equilibrium phase transition in a model for epidemic spreading on scale-free networks. The model consists of two particle species $A$ and $B$, and the coupling between them is taken to be asymmetric; $A$ induces $B$ while $B$ suppresses $A$. This model describes the spreading of an epidemic on networks equipped with a reactive immune system. We present analytic results on the phase diagram and the critical behavior, which depends on the degree exponent $γ$ of the underlying scale-free networks. Numerical simulation results that support the analytic results are also presented.

cond-mat.stat-mech↗

arXiv2005

VIP-club phenomenon: emergence of elites and masterminds in social networks

Hubs, or vertices with large degrees, play massive roles in, for example, epidemic dynamics, innovation diffusion, and synchronization on networks. However, costs of owning edges can motivate agents to decrease their degrees and avoid becoming hubs, whereas they would somehow like to keep access to a major part of the network. By analyzing a model and tennis players' partnership networks, we show that combination of vertex fitness and homophily yields a VIP club made of elite vertices that are influential but not easily accessed from the majority. Intentionally formed VIP members can even serve as masterminds, which manipulate hubs to control the entire network without exposing themselves to a large mass. From conventional viewpoints based on network topology and edge direction, elites are not distinguished from many other vertices. Understanding network data is far from sufficient; individualistic factors greatly affect network structure and functions per se.

cond-mat.dis-nn↗

arXiv2005

Rigorous results on the threshold network model

We analyze the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the vertex degree, degree correlation, and the number of prescribed subgraphs. We also generalize some results in the spatially extended cases.

math.PR↗

arXiv2005

Geographical threshold graphs with small-world and scale-free properties

Many real networks are equipped with short diameters, high clustering, and power-law degree distributions. With preferential attachment and network growth, the model by Barabasi and Albert simultaneously reproduces these properties, and geographical versions of growing networks have also been analyzed. However, nongrowing networks with intrinsic vertex weights often explain these features more plausibly, since not all networks are really growing. We propose a geographical nongrowing network model with vertex weights. Edges are assumed to form when a pair of vertices are spatially close and/or have large summed weights. Our model generalizes a variety of models as well as the original nongeographical counterpart, such as the unit disk graph, the Boolean model, and the gravity model, which appear in the contexts of percolation, wire communication, mechanical and solid physics, sociology, economy, and marketing. In appropriate configurations, our model produces small-world networks with power-law degree distributions. We also discuss the relation between geography, power laws in networks, and power laws in general quantities serving as vertex weights.

cond-mat.dis-nn↗

arXiv2004

Subcritical behavior in the alternating supercritical Domany-Kinzel dynamics

Cellular automata are widely used to model real-world dynamics. We show using the Domany-Kinzel probabilistic cellular automata that alternating two supercritical dynamics can result in subcritical dynamics in which the population dies out. The analysis of the original and reduced models reveals generality of this paradoxical behavior, which suggests that autonomous or man-made periodic or random environmental changes can cause extinction in otherwise safe population dynamics. Our model also realizes another scenario for the Parrondo's paradox to occur, namely, spatial extensions.

cond-mat.stat-mech↗

arXiv2004

Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights

Many real networks are complex and have power-law vertex degree distribution, short diameter, and high clustering. We analyze the network model based on thresholding of the summed vertex weights, which belongs to the class of networks proposed by Caldarelli et al. (2002). Power-law degree distributions, particularly with the dynamically stable scaling exponent 2, realistic clustering, and short path lengths are produced for many types of weight distributions. Thresholding mechanisms can underlie a family of real complex networks that is characterized by cooperativeness and the baseline scaling exponent 2. It contrasts with the class of growth models with preferential attachment, which is marked by competitiveness and baseline scaling exponent 3.

cond-mat.other↗

arXiv2004

Return times of random walk on generalized random graphs

Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even broader classes of related stochastic models. Abundant results are obtained for random walk on simple graphs such as the regular lattices and the Cayley trees. However, random walks and related processes on more complex networks, which are often more relevant in the real world, are still open issues, possibly yielding different characteristics. In this paper, we investigate the return times of random walks on random graphs with arbitrary vertex degree distributions. We analytically derive the distributions of the return times. The results are applied to some types of networks and compared with numerical data.

cond-mat.stat-mech↗

arXiv2004

Transmission of severe acute respiratory syndrome in dynamical small-world networks

The outbreak of severe acute respiratory syndrome (SARS) is still threatening the world because of a possible resurgence. In the current situation that effective medical treatments such as antiviral drugs are not discovered yet, dynamical features of the epidemics should be clarified for establishing strategies for tracing, quarantine, isolation, and regulating social behavior of the public at appropriate costs. Here we propose a network model for SARS epidemics and discuss why superspreaders emerged and why SARS spread especially in hospitals, which were key factors of the recent outbreak. We suggest that superspreaders are biologically contagious patients, and they may amplify the spreads by going to potentially contagious places such as hospitals. To avoid mass transmission in hospitals, it may be a good measure to treat suspected cases without hospitalizing them. Finally, we indicate that SARS probably propagates in small-world networks associated with human contacts and that the biological nature of individuals and social group properties are factors more important than the heterogeneous rates of social contacts among individuals. This is in marked contrast with epidemics of sexually transmitted diseases or computer viruses to which scale-free network models often apply.

cond-mat.other↗

arXiv2000

Distribution of Mutual Information

In the analysis of time series from nonlinear sources, mutual information (MI) is used as a nonlinear statistical criterion for the selection of an appropriate time delay in time delay reconstruction of the state space. MI is a statistic over the sets of sequences associated with the dynamical source, and we examine here the distribution of MI, thus going beyond the familiar analysis of its average alone. We give for the first time the distribution of MI for a standard, classical communications channel with Gaussian, additive white noise. For time series analysis of a dynamical system, we show how to determine the distribution of MI and discuss the implications for the use of average mutual information (AMI) in selecting time delays in phase space reconstruction.

nlin.CD↗