arXiv subjects

Naoki Masuda

Publications and source records attributed to Naoki Masuda.

At least 127 records · Page 7Linked to original sources

arXiv2014

Global network structure of dominance hierarchy of ant workers

Dominance hierarchy among animals is widespread in various species and believed to serve to regulate resource allocation within an animal group. Unlike small groups, however, detection and quantification of linear hierarchy in large groups of animals are a difficult task. Here, we analyse aggression-based dominance hierarchies formed by worker ants in Diacamma sp. as large directed networks. We show that the observed dominance networks are perfect or approximate directed acyclic graphs, which are consistent with perfect linear hierarchy. The observed networks are also sparse and random but significantly different from networks generated through thinning of the perfect linear tournament (i.e., all individuals are linearly ranked and dominance relationship exists between every pair of individuals). These results pertain to global structure of the networks, which contrasts with the previous studies inspecting frequencies of different types of triads. In addition, the distribution of the out-degree (i.e., number of workers that the focal worker attacks), not in-degree (i.e., number of workers that attack the focal worker), of each observed network is right-skewed. Those having excessively large out-degrees are located near the top, but not the top, of the hierarchy. We also discuss evolutionary implications of the discovered properties of dominance networks.

q-bio.PE↗

arXiv2014

Networks maximizing the consensus time of voter models

We explore the networks that yield the largest mean consensus time of voter models under different update rules. By analytical and numerical means, we show that the so-called lollipop graph, barbell graph, and double star graph maximise the mean consensus time under the update rules called the link dynamics, voter model, and invasion process, respectively. For each update rule, the largest mean consensus time scales as O(N^3), where N is the number of nodes in the network.

cond-mat.dis-nn↗

arXiv2014

The basic reproduction number as a predictor for epidemic outbreaks in temporal networks

The basic reproduction number R0 -- the number of individuals directly infected by an infectious person in an otherwise susceptible population -- is arguably the most widely used estimator of how severe an epidemic outbreak can be. This severity can be more directly measured as the fraction people infected once the outbreak is over, Ω. In traditional mathematical epidemiology and common formulations of static network epidemiology, there is a deterministic relationship between R0 and Ω. However, if one considers disease spreading on a temporal contact network -- where one knows when contacts happen, not only between whom -- then larger R0 does not necessarily imply larger Ω. In this paper, we numerically investigate the relationship between R0 and Ω for a set of empirical temporal networks of human contacts. Among 31 explanatory descriptors of temporal network structure, we identify those that make R0 an imperfect predictor of Ω. We find that descriptors related to both temporal and topological aspects affect the relationship between R0 and Ω, but in different ways.

q-bio.PE↗

arXiv2014

Voter model on the two-clique graph

I examine the mean consensus time (i.e., exit time) of the voter model in the so-called two-clique graph. The two-clique graph is composed of two cliques interconnected by some links and considered as a toy model of networks with community structure or multilayer networks. I analytically show that, as the number of interclique links per node is varied, the mean consensus time experiences a crossover between a fast consensus regime [i.e., O(N)] and a slow consensus regime [i.e., O(N^2)], where N is the number of nodes. The fast regime is consistent with the result for homogeneous well-mixed graphs such as the complete graph. The slow regime appears only when the entire network has O(1) interclique links. The present results suggest that the effect of community structure on the consensus time of the voter model is fairly limited.

physics.soc-ph↗

arXiv2014

Evolution via imitation among like-minded individuals

In social situations with which evolutionary game is concerned, individuals are considered to be heterogeneous in various aspects. In particular, they may differently perceive the same outcome of the game owing to heterogeneity in idiosyncratic preferences, fighting abilities, and positions in a social network. In such a population, an individual may imitate successful and similar others, where similarity refers to that in the idiosyncratic fitness function. I propose an evolutionary game model with two subpopulations on the basis of multipopulation replicator dynamics to describe such a situation. In the proposed model, pairs of players are involved in a two-person game as a well-mixed population, and imitation occurs within subpopulations in each of which players have the same payoff matrix. It is shown that the model does not allow any internal equilibrium such that the dynamics differs from that of other related models such as the bimatrix game. In particular, even a slight difference in the payoff matrix in the two subpopulations can make the opposite strategies to be stably selected in the two subpopulations in the snowdrift and coordination games.

q-bio.PE↗

arXiv2014

Random walk centrality for temporal networks

Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, as for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their structure changes in time. In this paper, we propose a centrality measure for temporal networks based on random walks which we call TempoRank. While in a static network, the stationary density of the random walk is proportional to the degree or the strength of a node, we find that in temporal networks, the stationary density is proportional to the in-strength of the so-called effective network. The stationary density also depends on the sojourn probability q which regulates the tendency of the walker to stay in the node. We apply our method to human interaction networks and show that although it is important for a node to be connected to another node with many random walkers at the right moment (one of the principles of the PageRank), this effect is negligible in practice when the time order of link activation is included.

physics.soc-ph↗

arXiv2014

Iterated crowdsourcing dilemma game

The Internet has enabled the emergence of collective problem solving, also known as crowdsourcing, as a viable option for solving complex tasks. However, the openness of crowdsourcing presents a challenge because solutions obtained by it can be sabotaged, stolen, and manipulated at a low cost for the attacker. We extend a previously proposed crowdsourcing dilemma game to an iterated game to address this question. We enumerate pure evolutionarily stable strategies within the class of so-called reactive strategies, i.e., those depending on the last action of the opponent. Among the 4096 possible reactive strategies, we find 16 strategies each of which is stable in some parameter regions. Repeated encounters of the players can improve social welfare when the damage inflicted by an attack and the cost of attack are both small. Under the current framework, repeated interactions do not really ameliorate the crowdsourcing dilemma in a majority of the parameter space.

cs.GT↗

arXiv2014

Two types of well followed users in the followership networks of Twitter

In the Twitter blogosphere, the number of followers is probably the most basic and succinct quantity for measuring popularity of users. However, the number of followers can be manipulated in various ways; we can even buy follows. Therefore, alternative popularity measures for Twitter users on the basis of, for example, users' tweets and retweets, have been developed. In the present work, we take a purely network approach to this fundamental question. First, we find that two relatively distinct types of users possessing a large number of followers exist, in particular for Japanese, Russian, and Korean users among the seven language groups that we examined. A first type of user follows a small number of other users. A second type of user follows approximately the same number of other users as the number of follows that the user receives. Then, we compare local (i.e., egocentric) followership networks around the two types of users with many followers. We show that the second type, which is presumably uninfluential users despite its large number of followers, is characterized by high link reciprocity, a large number of friends (i.e., those whom a user follows) for the followers, followers' high link reciprocity, large clustering coefficient, large fraction of the second type of users among the followers, and a small PageRank. Our network-based results support that the number of followers used alone is a misleading measure of user's popularity. We propose that the number of friends, which is simple to measure, also helps us to assess the popularity of Twitter users.

cs.SI↗

arXiv2013

Suicide ideation of individuals in online social networks

Suicide explains the largest number of death tolls among Japanese adolescents in their twenties and thirties. Suicide is also a major cause of death for adolescents in many other countries. Although social isolation has been implicated to influence the tendency to suicidal behavior, the impact of social isolation on suicide in the context of explicit social networks of individuals is scarcely explored. To address this question, we examined a large data set obtained from a social networking service dominant in Japan. The social network is composed of a set of friendship ties between pairs of users created by mutual endorsement. We carried out the logistic regression to identify users' characteristics, both related and unrelated to social networks, which contribute to suicide ideation. We defined suicide ideation of a user as the membership to at least one active user-defined community related to suicide. We found that the number of communities to which a user belongs to, the intransitivity (i.e., paucity of triangles including the user), and the fraction of suicidal neighbors in the social network, contributed the most to suicide ideation in this order. Other characteristics including the age and gender contributed little to suicide ideation. We also found qualitatively the same results for depressive symptoms.

cs.SI↗

arXiv2013

Complex dynamics of a nonlinear voter model with contrarian agents

We investigate mean-field dynamics of a nonlinear opinion formation model with congregator and contrarian agents. Each agent assumes one of the two possible states. Congregators imitate the state of other agents with a rate that increases with the number of other agents in the opposite state, as in the linear voter model and nonlinear majority voting models. Contrarians flip the state with a rate that increases with the number of other agents in the same state. The nonlinearity controls the strength of the majority voting and is used as a main bifurcation parameter. We show that the model undergoes a rich bifurcation scenario comprising the egalitarian equilibrium, two symmetric lopsided equilibria, limit cycle, and coexistence of different types of stable equilibria with intertwining attrative basins.

physics.soc-ph↗

arXiv2013

Voter models with contrarian agents

In the voter and many other opinion formation models, agents are assumed to behave as congregators (also called the conformists); they are attracted to the opinions of others. In this study, I investigate linear extensions of the voter model with contrarian agents. An agent is either congregator or contrarian and assumes a binary opinion. I investigate three models that differ in the behavior of the contrarian toward other agents. In model 1, contrarians mimic the opinions of other contrarians and oppose (i.e., try to select the opinion opposite to) those of congregators. In model 2, contrarians mimic the opinions of congregators and oppose those of other contrarians. In model 3, contrarians oppose anybody. In all models, congregators are assumed to like anybody. I show that even a small number of contrarians prohibits the consensus in the entire population to be reached in all three models. I also obtain the equilibrium distributions using the van Kampen small-fluctuation approximation and the Fokker-Planck equation for the case of many contrarians and a single contrarian, respectively. I show that the fluctuation around the symmetric coexistence equilibrium is much larger in model 2 than in models 1 and 3 when contrarians are rare.

physics.soc-ph↗

arXiv2013

Temporal networks: slowing down diffusion by long lasting interactions

Interactions among units in complex systems occur in a specific sequential order thus affecting the flow of information, the propagation of diseases, and general dynamical processes. We investigate the Laplacian spectrum of temporal networks and compare it with that of the corresponding aggregate network. First, we show that the spectrum of the ensemble average of a temporal network has identical eigenmodes but smaller eigenvalues than the aggregate networks. In large networks without edge condensation, the expected temporal dynamics is a time-rescaled version of the aggregate dynamics. Even for single sequential realizations, diffusive dynamics is slower in temporal networks. These discrepancies are due to the noncommutability of interactions. We illustrate our analytical findings using a simple temporal motif, larger network models and real temporal networks.

physics.soc-ph↗

arXiv2013

Observability transitions in correlated networks

Yang, Wang, and Motter [Phys. Rev. Lett. 109, 258701 (2012)] analyzed a model for network observability transitions in which a sensor placed on a node makes the node and the adjacent nodes observable. The size of the connected components comprising the observable nodes is a major concern of the model. We analyze this model in random heterogeneous networks with degree correlation. With numerical simulations and analytical arguments based on generating functions, we find that negative degree correlation makes networks more observable. This result holds true both when the sensors are placed on nodes one by one in a random order and when hubs preferentially receive the sensors. Finally, we numerically optimize networks with a fixed degree sequence with respect to the size of the largest observable component. Optimized networks have negative degree correlation induced by the resulting hub-repulsive structure; the largest hubs are rarely connected to each other, in contrast to the rich-club phenomenon of networks.

physics.soc-ph↗

arXiv2013

Random Walks on Directed Networks: Inference and Respondent-driven Sampling

Respondent driven sampling (RDS) is a method often used to estimate population properties (e.g. sexual risk behavior) in hard-to-reach populations. It combines an effective modified snowball sampling methodology with an estimation procedure that yields unbiased population estimates under the assumption that the sampling process behaves like a random walk on the social network of the population. Current RDS estimation methodology assumes that the social network is undirected, i.e. that all edges are reciprocal. However, empirical social networks in general also have non-reciprocated edges. To account for this fact, we develop a new estimation method for RDS in the presence of directed edges on the basis of random walks on directed networks. We distinguish directed and undirected edges and consider the possibility that the random walk returns to its current position in two steps through an undirected edge. We derive estimators of the selection probabilities of individuals as a function of the number of outgoing edges of sampled individuals. We evaluate the performance of the proposed estimators on artificial and empirical networks to show that they generally perform better than existing methods. This is in particular the case when the fraction of directed edges in the network is large.

stat.ME↗

arXiv2013

Self-exciting point process modeling of conversation event sequences

Self-exciting processes of Hawkes type have been used to model various phenomena including earthquakes, neural activities, and views of online videos. Studies of temporal networks have revealed that sequences of social interevent times for individuals are highly bursty. We examine some basic properties of event sequences generated by the Hawkes self-exciting process to show that it generates bursty interevent times for a wide parameter range. Then, we fit the model to the data of conversation sequences recorded in company offices in Japan. In this way, we can estimate relative magnitudes of the self excitement, its temporal decay, and the base event rate independent of the self excitation. These variables highly depend on individuals. We also point out that the Hawkes model has an important limitation that the correlation in the interevent times and the burstiness cannot be independently modulated.

physics.soc-ph↗

arXiv2013

A collective opinion formation model under Bayesian updating and confirmation bias

We propose a collective opinion formation model with a so-called confirmation bias. The confirmation bias is a psychological effect with which, in the context of opinion formation, an individual in favor of an opinion is prone to misperceive new incoming information as supporting the current belief of the individual. Our model modifies a Bayesian decision-making model for single individuals [M. Rabin and J. L. Schrag, Q. J. Econ. 114, 37 (1999)] for the case of a well-mixed population of interacting individuals in the absence of the external input. We numerically simulate the model to show that all the agents eventually agree on one of the two opinions only when the confirmation bias is weak. Otherwise, the stochastic population dynamics ends up creating a disagreement configuration (also called polarization), particularly for large system sizes. A strong confirmation bias allows various final disagreement configurations with different fractions of the individuals in favor of the opposite opinions.

physics.soc-ph↗

arXiv2013

A model of competition among more than two languages

We extend the Abrams-Strogatz model for competition between two languages [Nature 424, 900 (2003)] to the case of n(>=2) competing states (i.e., languages). Although the Abrams-Strogatz model for n=2 can be interpreted as modeling either majority preference or minority aversion, the two mechanisms are distinct when n>=3. We find that the condition for the coexistence of different states is independent of n under the pure majority preference, whereas it depends on n under the pure minority aversion. We also show that the stable coexistence equilibrium and stable monopoly equilibria can be multistable under the minority aversion and not under the majority preference. Furthermore, we obtain the phase diagram of the model when the effects of the majority preference and minority aversion are mixed, under the condition that different states have the same attractiveness. We show that the multistability is a generic property of the model facilitated by large n.

physics.soc-ph↗

arXiv2013

State Concentration Exponent as a Measure of Quickness in Kauffman-type Networks

We study the dynamics of randomly connected networks composed of binary Boolean elements and those composed of binary majority vote elements. We elucidate their differences in both sparsely and densely connected cases. The quickness of large network dynamics is usually quantified by the length of transient paths, an analytically intractable measure. For discrete-time dynamics of networks of binary elements, we address this dilemma with an alternative unified framework by using a concept termed state concentration, defined as the exponent of the average number of t-step ancestors in state transition graphs. The state transition graph is defined by nodes corresponding to network states and directed links corresponding to transitions. Using this exponent, we interrogate the dynamics of random Boolean and majority vote networks. We find that extremely sparse Boolean networks and majority vote networks with arbitrary density achieve quickness, owing in part to long-tailed in-degree distributions. As a corollary, only relatively dense majority vote networks can achieve both quickness and robustness.

cond-mat.dis-nn↗