arXiv subjects

Naoki Masuda

Publications and source records attributed to Naoki Masuda.

At least 163 records · Page 9Linked to original sources

arXiv2011

Can Partisan Voting Lead to Truth?

We study an extension of the voter model in which each agent is endowed with an innate preference for one of two states that we term as "truth" or "falsehood". Due to interactions with neighbors, an agent that innately prefers truth can be persuaded to adopt a false opinion (and thus be discordant with its innate preference) or the agent can possess an internally concordant "true" opinion. Parallel states exist for agents that inherently prefer falsehood. We determine the conditions under which a population of such agents can ultimately reach a consensus for the truth, a consensus for falsehood, or reach an impasse where an agent tends to adopt the opinion that is in internal concordance with its innate preference so that consensus is never achieved.

physics.soc-ph↗

arXiv2011

Evolution of cooperation is a robust outcome in the prisoner's dilemma on dynamic networks

Dynamics of evolutionary games strongly depend on underlying networks. We study the coevolutionary prisoner's dilemma in which players change their local networks as well as strategies (i.e., cooperate or defect). This topic has been increasingly explored by many researchers. On the basis of active linking dynamics [J. M. Pacheco et al., J. Theor. Biol. 243, 437 (2006), J. M. Pacheco et al., Phys. Rev. Lett. 97, 258103 (2006)], we show that cooperation is enhanced fairly robustly. In particular, cooperation evolves when the payoff of the player is normalized by the number of neighbors; this is not the case in the evolutionary prisoner's dilemma on static networks.

physics.soc-ph↗

arXiv2010

Dynamics-based centrality for general directed networks

Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based centrality, which has mainly been applied to strongly connected networks, to the case of general directed networks such that we can quantitatively compare arbitrary nodes. Toward this end, we adopt the idea used in the PageRank to introduce global connectivity between all the pairs of nodes with a certain strength. Numerical simulations are carried out on some networks. We also offer interpretations of the Laplacian-based centrality for general directed networks in terms of various dynamical and structural properties of networks. Importantly, the Laplacian-based centrality defined as the stationary density of the continuous-time random walk with random jumps is shown to be equivalent to the absorption probability of the random walk with sinks at each node but without random jumps. Similarly, the proposed centrality represents the importance of nodes in dynamics on the original network supplied with sinks but not with random jumps.

physics.soc-ph↗

arXiv2010

Enhancing the spectral gap of networks by node removal

Dynamics on networks are often characterized by the second smallest eigenvalue of the Laplacian matrix of the network, which is called the spectral gap. Examples include the threshold coupling strength for synchronization and the relaxation time of a random walk. A large spectral gap is usually associated with high network performance, such as facilitated synchronization and rapid convergence. In this study, we seek to enhance the spectral gap of undirected and unweighted networks by removing nodes because, practically, the removal of nodes often costs less than the addition of nodes, addition of links, and rewiring of links. In particular, we develop a perturbative method to achieve this goal. The proposed method realizes better performance than other heuristic methods on various model and real networks. The spectral gap increases as we remove up to half the nodes in most of these networks.

cond-mat.dis-nn↗

arXiv2010

Long-tail Behavior in Locomotion of Caenorhabditis elegans

The locomotion of Caenorhabditis elegans exhibits complex patterns. In particular, the worm combines mildly curved runs and sharp turns to steer its course. Both runs and sharp turns of various types are important components of taxis behavior. The statistics of sharp turns have been intensively studied. However, there have been few studies on runs, except for those on klinotaxis (also called weathervane mechanism), in which the worm gradually curves toward the direction with a high concentration of chemicals; this phenomenon was discovered recently. We analyzed the data of runs by excluding sharp turns. We show that the curving rate obeys long-tail distributions, which implies that large curving rates are relatively frequent. This result holds true for locomotion in environments both with and without a gradient of NaCl concentration; it is independent of klinotaxis. We propose a phenomenological computational model on the basis of a random walk with multiplicative noise. The assumption of multiplicative noise posits that the fluctuation of the force is proportional to the force exerted. The model reproduces the long-tail property present in the experimental data.

q-bio.NC↗

arXiv2010

Effects of diffusion rates on epidemic spreads in metapopulation networks

It is often useful to represent the infectious dynamics of mobile agents by metapopulation models. In such a model, metapopulations form a static network, and individuals migrate from one metapopulation to another. It is known that heterogeneous degree distributions of metapopulation networks decrease the epidemic threshold above which epidemic spreads can occur. We investigate the combined effect of heterogeneous degree distributions and diffusion on epidemics in metapopulation networks. We show that for arbitrary heterogeneous networks, diffusion suppresses epidemics in the sense of an increase in the epidemic threshold. On the other hand, some diffusion rates are needed to elicit epidemic spreads on a global scale. As a result of these opposing effects of diffusion, epidemic spreading near the epidemic threshold is the most pronounced at an intermediate diffusion rate. The result that diffusion can suppress epidemics contrasts with that for diffusive SIS dynamics and its variants when individuals are fixed at nodes on static networks.

cond-mat.dis-nn↗

arXiv2010

Collective fluctuations in networks of noisy components

Collective dynamics result from interactions among noisy dynamical components. Examples include heartbeats, circadian rhythms, and various pattern formations. Because of noise in each component, collective dynamics inevitably involve fluctuations, which may crucially affect functioning of the system. However, the relation between the fluctuations in isolated individual components and those in collective dynamics is unclear. Here we study a linear dynamical system of networked components subjected to independent Gaussian noise and analytically show that the connectivity of networks determines the intensity of fluctuations in the collective dynamics. Remarkably, in general directed networks including scale-free networks, the fluctuations decrease more slowly with the system size than the standard law stated by the central limit theorem. They even remain finite for a large system size when global directionality of the network exists. Moreover, such nontrivial behavior appears even in undirected networks when nonlinear dynamical systems are considered. We demonstrate it with a coupled oscillator system.

physics.bio-ph↗

arXiv2010

Synchronization Transition of Identical Phase Oscillators in a Directed Small-World Network

We numerically study a directed small-world network consisting of attractively coupled, identical phase oscillators. While complete synchronization is always stable, it is not always reachable from random initial conditions. Depending on the shortcut density and on the asymmetry of the phase coupling function, there exists a regime of persistent chaotic dynamics. By increasing the density of shortcuts or decreasing the asymmetry of the phase coupling function, we observe a discontinuous transition in the ability of the system to synchronize. Using a control technique, we identify the bifurcation scenario of the order parameter. We also discuss the relation between dynamics and topology and remark on the similarity of the synchronization transition to directed percolation.

cond-mat.dis-nn↗

arXiv2010

Heterogeneous Voter Models

We introduce the heterogeneous voter model (HVM), in which each agent has its own intrinsic rate to change state, reflective of the heterogeneity of real people, and the partisan voter model (PVM), in which each agent has an innate and fixed preference for one of two possible opinion states. For the HVM, the time until consensus is reached is much longer than in the classic voter model. For the PVM in the mean-field limit, a population evolves to a "selfish" state, where each agent tends to be aligned with its internal preference. For finite populations, discrete fluctuations ultimately lead to consensus being reached in a time that scales exponentially with population size.

physics.soc-ph↗

arXiv2010

Upstream reciprocity in heterogeneous networks

Many mechanisms for the emergence and maintenance of altruistic behavior in social dilemma situations have been proposed. Indirect reciprocity is one such mechanism, where other-regarding actions of a player are eventually rewarded by other players with whom the original player has not interacted. The upstream reciprocity (also called generalized indirect reciprocity) is a type of indirect reciprocity and represents the concept that those helped by somebody will help other unspecified players. In spite of the evidence for the enhancement of helping behavior by upstream reciprocity in rats and humans, theoretical support for this mechanism is not strong. In the present study, we numerically investigate upstream reciprocity in heterogeneous contact networks, in which the players generally have different number of neighbors. We show that heterogeneous networks considerably enhance cooperation in a game of upstream reciprocity. In heterogeneous networks, the most generous strategy, by which a player helps a neighbor on being helped and in addition initiates helping behavior, first occupies hubs in a network and then disseminates to other players. The scenario to achieve enhanced altruism resembles that seen in the case of the Prisoner's Dilemma game in heterogeneous networks.

physics.soc-ph↗

arXiv2009

Immunization of networks with community structure

In this study, an efficient method to immunize modular networks (i.e., networks with community structure) is proposed. The immunization of networks aims at fragmenting networks into small parts with a small number of removed nodes. Its applications include prevention of epidemic spreading, intentional attacks on networks, and conservation of ecosystems. Although preferential immunization of hubs is efficient, good immunization strategies for modular networks have not been established. On the basis of an immunization strategy based on the eigenvector centrality, we develop an analytical framework for immunizing modular networks. To this end, we quantify the contribution of each node to the connectivity in a coarse-grained network among modules. We verify the effectiveness of the proposed method by applying it to model and real networks with modular structure.

q-bio.PE↗

arXiv2009

Impact of hierarchical modular structure on ranking of individual nodes in directed networks

Many systems, ranging from biological and engineering systems to social systems, can be modeled as directed networks, with links representing directed interaction between two nodes. To assess the importance of a node in a directed network, various centrality measures based on different criteria have been proposed. However, calculating the centrality of a node is often difficult because of the overwhelming size of the network or the incomplete information about the network. Thus, developing an approximation method for estimating centrality measures is needed. In this study, we focus on modular networks; many real-world networks are composed of modules, where connection is dense within a module and sparse across different modules. We show that ranking-type centrality measures including the PageRank can be efficiently estimated once the modular structure of a network is extracted. We develop an analytical method to evaluate the centrality of nodes by combining the local property (i.e., indegree and outdegree of nodes) and the global property (i.e., centrality of modules). The proposed method is corroborated with real data. Our results provide a linkage between the ranking-type centrality values of modules and those of individual nodes. They also reveal the hierarchical structure of networks in the sense of subordination (not nestedness) laid out by connectivity among modules of different relative importance. The present study raises a novel motive of identifying modules in networks.

physics.soc-ph↗

arXiv2009

Analysis of relative influence of nodes in directed networks

Many complex networks are described by directed links; in such networks, a link represents, for example, the control of one node over the other node or unidirectional information flows. Some centrality measures are used to determine the relative importance of nodes specifically in directed networks. We analyze such a centrality measure called the influence. The influence represents the importance of nodes in various dynamics such as synchronization, evolutionary dynamics, random walk, and social dynamics. We analytically calculate the influence in various networks, including directed multipartite networks and a directed version of the Watts-Strogatz small-world network. The global properties of networks such as hierarchy and position of shortcuts, rather than local properties of the nodes, such as the degree, are shown to be the chief determinants of the influence of nodes in many cases. The developed method is also applicable to the calculation of the PageRank. We also numerically show that in a coupled oscillator system, the threshold for entrainment by a pacemaker is low when the pacemaker is placed on influential nodes. For a type of random network, the analytically derived threshold is approximately equal to the inverse of the influence. We numerically show that this relationship also holds true in a random scale-free network and a neural network.

physics.soc-ph↗

arXiv2009

Self-organization of feedforward structure and entrainment in excitatory neural networks with spike-timing-dependent plasticity

Spike-timing dependent plasticity (STDP) is an organizing principle of biological neural networks. While synchronous firing of neurons is considered to be an important functional block in the brain, how STDP shapes neural networks possibly toward synchrony is not entirely clear. We examine relations between STDP and synchronous firing in spontaneously firing neural populations. Using coupled heterogeneous phase oscillators placed on initial networks, we show numerically that STDP prunes some synapses and promotes formation of a feedforward network. Eventually a pacemaker, which is the neuron with the fastest inherent frequency in our numerical simulations, emerges at the root of the feedforward network. In each oscillatory cycle, a packet of neural activity is propagated from the pacemaker to downstream neurons along layers of the feedforward network. This event occurs above a clear-cut threshold value of the initial synaptic weight. Below the threshold, neurons are self-organized into separate clusters each of which is a feedforward network.

q-bio.NC↗

arXiv2009

Directionality of contact networks suppresses selection pressure in evolutionary dynamics

Individuals of different types, may it be genetic, cultural, or else, with different levels of fitness often compete for reproduction and survival. A fitter type generally has higher chances of disseminating their copies to other individuals. The fixation probability of a single mutant type introduced in a population of wild-type individuals quantifies how likely the mutant type spreads. How much the excess fitness of the mutant type increases its fixation probability, namely, the selection pressure, is important in assessing the impact of the introduced mutant. Previous studies mostly based on undirected and unweighted contact networks of individuals showed that the selection pressure depends on the structure of networks and the rule of reproduction. Real networks underlying ecological and social interactions are usually directed or weighted. Here we examine how the selection pressure is modulated by directionality of interactions under several update rules. Our conclusions are twofold. First, directionality discounts the selection pressure for different networks and update rules. Second, given a network, the update rules in which death events precede reproduction events significantly decrease the selection pressure than the other rules.

physics.soc-ph↗

arXiv2009

Evolutionary dynamics and fixation probabilities in directed networks

We investigate the evolutionary dynamics in directed and/or weighted networks. We study the fixation probability of a mutant in finite populations in stochastic voter-type dynamics for several update rules. The fixation probability is defined as the probability of a newly introduced mutant in a wild-type population taking over the entire population. In contrast to the case of undirected and unweighted networks, the fixation probability of a mutant in directed networks is characterized not only by the degree of the node that the mutant initially invades but by the global structure of networks. Consequently, the gross connectivity of networks such as small-world property or modularity has a major impact on the fixation probability.

physics.soc-ph↗

arXiv2008

Controlling nosocomial infection based on structure of hospital social networks

Nosocomial infection raises a serious public health problem, as implied by the existence of pathogens characteristic to healthcare and hospital-mediated outbreaks of influenza and SARS. We simulate stochastic SIR dynamics on social networks, which are based on observations in a hospital in Tokyo, to explore effective containment strategies against nosocomial infection. The observed networks have hierarchical and modular structure. We show that healthcare workers, particularly medical doctors, are main vectors of diseases on these networks. Intervention methods that restrict interaction between medical doctors and their visits to different wards shrink the final epidemic size more than intervention methods that directly protect patients, such as isolating patients in single rooms. By the same token, vaccinating doctors with priority rather than patients or nurses is more effective. Finally, vaccinating individuals with large betweenness centrality is superior to vaccinating ones with large connectedness to others or randomly chosen individuals, as suggested by previous model studies. [The abstract of the manuscript has more information.]

q-bio.PE↗

arXiv2008

Participation costs dismiss the advantage of heterogeneous networks in evolution of cooperation

Real social interactions occur on networks in which each individual is connected to some, but not all, of others. In social dilemma games with a fixed population size, heterogeneity in the number of contacts per player is known to promote evolution of cooperation. Under a common assumption of positively biased payoff structure, well-connected players earn much by playing frequently, and cooperation once adopted by well-connected players is unbeatable and spreads to others. However, maintaining a social contact can be costly, which would prevent local payoffs from being positively biased. In replicator-type evolutionary dynamics, it is shown that even a relatively small participation cost extinguishes the merit of heterogeneous networks in terms of cooperation. In this situation, more connected players earn less so that they are no longer spreaders of cooperation. Instead, those with fewer contacts win and guide the evolution. The participation cost, or the baseline payoff, is irrelevant in homogeneous populations but is essential for evolutionary games on heterogeneous networks.

physics.soc-ph↗