Search

Languages are grouped into families that share common linguistic traits. While this approach has been successful in understanding genetic relations between diverse languages, more analyses are needed to accurately quantify their relatedness, especially in less studied linguistic levels such as syntax. Here, we explore linguistic distances using series of parts of speech (POS) extracted from the Universal Dependencies dataset. Within an information-theoretic framework, we show that employing POS trigrams maximizes the possibility of capturing syntactic variations while being at the same time compatible with the amount of available data. Linguistic connections are then established by assessing pairwise distances based on the POS distributions. Intriguingly, our analysis reveals definite clusters that correspond to well known language families and groups, with exceptions explained by distinct morphological typologies. Furthermore, we obtain a significant correlation between language similarity and geographic distance, which underscores the influence of spatial proximity on language kinships., Comment: 39 pages

Changes of mind can become less likely the longer an agent has adopted a given opinion state. This resilience or inertia to change has been called ``aging''. We perform a comparative study of the effects of aging on the critical behavior of two standard opinion models with pairwise interactions. One of them is the voter model, which is a two-state model with a dynamic that proceeds by simple social contagion, another is the so-called kinetic exchange model, which allows a third (neutral) state and the formed opinion depends on the previous opinions of both interacting agents. Furthermore, in the noisy version of both models, random opinion changes are also allowed, regardless of the interactions. Due to aging, the probability of change diminishes with the age, and to take this into account we consider algebraic and exponential kernels. We investigate the situation where aging acts only on pairwise interactions. Analytical predictions for the critical curves of the order parameters are obtained for the opinion dynamics on a complete graph, in good agreement with agent-based simulations. For both models considered, consensus is optimized by an intermediate value of the parameter that rules the rate of decrease of the aging factor.

We study the critical behavior of a noisy kinetic opinion model subject to resilience to change depending on aging, defined as the time spent on the current opinion state. In this model, the opinion of each agent can take the three discrete values, the extreme ones $\pm 1$, and also the intermediate value 0, and it can evolve through kinetic exchange when interacting with another agent, or independently, by stochastic choice (noise). The probability of change by pairwise interactions depends on the age that the agent has remained in the same state, according to a given kernel. We particularly develop the cases where the probability decays either algebraically or exponentially with the age, and we also consider the anti-aging scenario where the probability increases with the age, meaning that it is more likely to change mind the longer the persistence in the current state. For the opinion dynamics in a complete graph, we obtain analytical predictions for the critical curves of the order parameters, in perfect agreement with agent-based simulations. We observe that sufficiently weak aging (slow change of the kernel with the age) favors partial consensus with respect to the aging-insensitive scenario, while for sufficiently strong aging, as well as for anti-aging, the opposite trend is observed.

Entropy estimation is a fundamental problem in information theory that has applications in various fields, including physics, biology, and computer science. Estimating the entropy of discrete sequences can be challenging due to limited data and the lack of unbiased estimators. Most existing entropy estimators are designed for sequences of independent events and their performance vary depending on the system being studied and the available data size. In this work we compare different entropy estimators and their performance when applied to Markovian sequences. Specifically, we analyze both binary Markovian sequences and Markovian systems in the undersampled regime. We calculate the bias, standard deviation and mean squared error for some of the most widely employed estimators. We discuss the limitations of entropy estimation as a function of the transition probabilities of the Markov processes and the sample size. Overall, this paper provides a comprehensive comparison of entropy estimators and their performance in estimating entropy for systems with memory, which can be useful for researchers and practitioners in various fields., Comment: 19 pages, 9 figures

Motivated by the dramatic disappearance of endangered languages observed in recent years, a great deal of attention has been given to the modeling of language competition in order to understand the factors that promote the disappearance of a language and its unfolding dynamics. With this in mind, we build on existing network models of language competition in bilingual societies. These models deal with the interplay between the usage of a language (link state) and the preference or attitude of the speakers towards the language (node state). In this work, we allow for the case where agents have the freedom to adapt their local interactions in accordance with their language preference. This is modeled by introducing a local rewiring mechanism triggered by the dissatisfaction of an agent with its usage of a given language. Our numerical simulations show that permitting this freedom to agents likely results in linguistically segregated communities for small network sizes. However, for networks of sufficiently large size, the extinction of one of the languages is the most probable scenario. Furthermore, we analyze how the fraction of minority speakers changes with the system size and we find that this fraction grows as the total population increases, which is consistent with existing data. Overall, the results of this work help us understand the impact of speakers' preferences and choices in the complex language landscape of bilingual societies., Comment: 12 pages, 9 figures

Approximate numerical methods are one of the most used strategies to extract information from many-interacting-agents systems. In particular, numerical approximations are of extended use to deal with epidemic, ecological and biological models, since unbiased methods like the Gillespie algorithm can become unpractical due to high CPU time usage required. However, the use of approximations has been debated and there is no clear consensus about whether unbiased methods or biased approach is the best option. In this work, we derive scaling relations for the errors in approximations based on binomial extractions. This finding allows us to build rules to compute the optimal values of both the discretization time and number of realizations needed to compute averages with the biased method with a target precision and minimum CPU-time usage. Furthermore, we also present another rule to discern whether the unbiased method or biased approach is more efficient. Ultimately, we will show that the choice of the method should depend on the desired precision for the estimation of averages.

We give a comprehensive mean-field analysis of the Partisan Voter Model (PVM) and report analytical results for exit probabilities, fixation times, and the quasi-stationary distribution. In addition, and similarly to the noisy voter model, we introduce a noisy version of the PVM, named as the Noisy Partisan Voter Model (NPVM) which accounts for the preferences of each agent for the two possible states, as well as for idiosyncratic spontaneous changes of state. We find that the finite-size noise-induced transition of the noisy voter model is modified in the NPVM leading to the emergence of new intermediate phases and both continuous and discontinuous transitions.

Words are fundamental linguistic units that connect thoughts and things through meaning. However, words do not appear independently in a text sequence. The existence of syntactic rules induces correlations among neighboring words. Using an ordinal pattern approach, we present an analysis of lexical statistical connections for 11 major languages. We find that the diverse manners that languages utilize to express word relations give rise to unique pattern structural distributions. Furthermore, fluctuations of these pattern distributions for a given language can allow us to determine both the historical period when the text was written and its author. Taken together, our results emphasize the relevance of ordinal time series analysis in linguistic typology, historical linguistics and stylometry., Comment: 9 pages, 12 figures, 2 tables; v2: the section on universality has been removed because previous results were affected by spurious correlations. Published version

The conventional voter model is modified so that an agent's switching rate depends on the `age' of the agent, that is, the time since the agent last switched opinion. In contrast to previous work, age is continuous in the present model. We show how the resulting individual-based system with non-Markovian dynamics and concentration-dependent rates can be handled both computationally and analytically. Lewis' thinning algorithm can be modified in order to provide an efficient simulation method. Analytically, we demonstrate how the asymptotic approach to an absorbing state (consensus) can be deduced. We discuss three special cases of the age dependent switching rate: one in which the concentration of voters can be approximated by a fractional differential equation, another for which the approach to consensus is exponential in time, and a third case in which the system reaches a frozen state instead of consensus. Finally, we include the effects of spontaneous change of opinion, i.e., we study a noisy voter model with continuous ageing. We demonstrate that this can give rise to a continuous transition between coexistence and consensus phases. We also show how the stationary probability distribution can be approximated, despite the fact that the system cannot be described by a conventional master equation.

In the recent COVID-19 pandemic we assisted at a sequence of epidemic waves intertwined by anomalous fade-outs with periods of low but persistent epidemic prevalence. These long-living epidemic states complicate epidemic control and challenge current modeling approaches as classical epidemic models fail to explain their emergence. Inspired by this phenomenon, we propose a simple mechanism able to reproduce several features observed in real data. Specifically, here we introduce a modification of the Susceptible-Infected-Recovered (SIR) model in a meta-population framework where a small inflow of infected individuals accounts for undetected internal or imported cases. Focusing on a regime where this external seeding is so small that cannot be detected from the analysis of epidemic curves, we find that outbreaks of finite duration percolate in time resulting in overall low but long-living epidemic states below and above the epidemic threshold. Using a two-state description of the local dynamics, we can extract analytical predictions for the phase space. The comparison with epidemic data demonstrates that our model is able to reproduce some critical signatures observed in COVID-19 spreading in England. Finally, our findings defy our understanding of the concept of epidemic threshold and its relationship with outbreaks survival for disease control., Comment: Corrected typos

We investigate the memory properties of discrete sequences built upon a finite number of states. We find that the block entropy can reliably determine the memory for systems modeled as Markov chains of arbitrary finite order. Further, we provide an entropy estimator that remarkably gives accurate results when correlations are present. To illustrate our findings, we calculate the memory of daily precipitation series at different locations. Our results are in agreement with existing methods being at the same time valid in the undersampled regime and independent of model selection.

We study the voter model dynamics in the presence of confidence and bias. We assume two types of voters. Unbiased voters whose confidence is indifferent to the state of the voter and biased voters whose confidence is biased towards a common fixed preferred state. We study the problem analytically on the complete graph using mean field theory and on an Erd\H{o}s-R\'enyi random network topology using the pair approximation, where we assume that the network of interactions topology is independent of the type of voters. We find that for the case of a random initial setup, and for sufficiently large number of voters $N$, the time to consensus increases proportionally to $\log(N)/\gamma v$, with $\gamma$ the fraction of biased voters and $v$ the parameter quantifying the bias of the voters ($v=0$ no bias). We verify our analytical results through numerical simulations. We study this model on a biased-dependent topology of the network of interactions and examine two distinct, global average-degree preserving strategies (model I and model II) to obtain such biased-dependent random topologies starting from the biased-independent random topology case as the initial setup. Keeping all other parameters constant, in model I, $\mu_{BU}$, the average number of links among biased (B) and unbiased (U) voters is varied at the expense of $\mu_{UU}$ and $\mu_{BB}$, i.e. the average number of links among only unbiased and biased voters respectively. In model II, $\mu_{BU}$ is kept constant, while $\mu_{BB}$ is varied at the expense of $\mu_{UU}$. We find that if the agents follow the strategy described by model II, they can achieve a significant reduction in the time to reach consensus as well as an increment in the probability to reach consensus to the preferred state.

The numerical quantification of the statistics of rare events in stochastic processes is a challenging computational problem. We present a sampling method that constructs an ensemble of stochastic trajectories that are constrained to have fixed start and end points (so-called stochastic bridges). We then show that by carefully choosing a set of such bridges and assigning an appropriate statistical weight to each bridge, one can focus more processing power on the rare events of a target stochastic process while faithfully preserving the statistics of these rate trajectories. Further, we also compare the stochastic bridges produced using our method to the Wentzel-Kramers-Brillouin (WKB) optimal paths of the target process, derived in the limit of low noise. We see that the paths produced using our method, encoding the full statistics of the process, collapse onto the WKB optimal path as the level of noise is reduced. We propose that our method can be used to judge the accuracy of the WKB approximation at finite levels of noise.

We introduce a Maxwell demon which generates many-body entanglement robustly against bit-flip noises, which allows us to obtain quantum advantage. Adopting the protocol of the voter model used for opinion dynamics approaching consensus, the demon randomly selects a qubit pair and performs a quantum feedback control, in continuous repetitions. We derive upper bounds of the entropy reduction and the work extraction rates by demon's operation, which are determined by a competition between the quantum-classical mutual information acquired by the demon and the absolute irreversibility of the feedback control. Our finding of the upper bounds corresponds to a reformulation of the second law of thermodynamics under a class of Maxwell demon which generates many-body entanglement in a working substance., Comment: An upper bound and example of work extraction are added. The presentation is improved

We consider a general model in which there is a coupled dynamics of node states and links states in a network. This coupled dynamics coevolves with dynamical changes of the topology of the network caused by a link rewiring mechanism. Such coevolution model features the interaction of the local dynamics of node and link states with the nonlocal dynamics of link-rewiring in a random network. The coupled dynamics of the states of the nodes and the links produces by itself an absorbing phase transition which is shown to be robust against the link rewiring mechanism. However, the dynamics of the network gives rise to significant physical changes, specially in the limit in which some links do not change state but are always rewired: First a network fragmentation occurs at the critical line of the absorbing transition, and only at this line, so that fragmentation is a manifestation of criticality. Secondly, in the active phase of the absorbing transition, finite-size fluctuations take the system to a single network component consensus phase, while other configurations are possible in the absence of rewiring. In addition, this phase is reached after a survival time that scales linearly with system size, while the survival time scales exponentially with system size when there is no rewiring. A social interpretation of our results contribute to the description of processes of emergence of social fragmentation and polarization.

Theoretical approaches to binary-state models on complex networks are generally restricted to infinite size systems, where a set of non-linear deterministic equations is assumed to characterize its dynamics and stationary properties. We develop in this work the stochastic formalism of the different compartmental approaches, these are: approximate master equation (AME), pair approximation (PA) and heterogeneous mean field (HMF), in descending order of accuracy. Using different system-size expansions of a general master equation, we are able to obtain approximate solutions of the fluctuations and finite-size corrections of the global state. On the one hand, far from criticality, the deviations from the deterministic solution are well captured by a Gaussian distribution whose properties we derive, including its correlation matrix and corrections to the average values. On the other hand, close to a critical point there are non-Gaussian statistical features that can be described by the finite-size scaling functions of the models. We show how to obtain the scaling functions departing only from the theory of the different approximations. We apply the techniques for a wide variety of binary-state models in different contexts, such as epidemic, opinion and ferromagnetic models.

In the standard $q$-voter model, a given agent can change its opinion only if there is a full consensus of the opposite opinion within a group of influence of size $q$. A more realistic extension is the threshold $q$-voter, where a minimal agreement (at least $0

We study memory dependent binary-state dynamics, focusing on the noisy-voter model. This is a non-Markovian process if we consider the set of binary states of the population as the description variables, or Markovian if we incorporate "age", related to the time one has spent holding the same state, as a part of the description. We show that, in some cases, the model can be reduced to an effective Markovian process, where the age distribution of the population rapidly equilibrates to a quasi-steady state, while the global state of the system is out of equilibrium. This effective Markovian process shares the same phenomenology of the non-linear noisy-voter model and we establish a clear parallelism between these two extensions of the noisy-voter model.

The voter model with memory-dependent dynamics is theoretically and numerically studied at the mean-field level. The `internal age', or time an individual spends holding the same state, is added to the set of binary states of the population, such that the probability of changing state (or activation probability $p_i$) depends on this age. A closed set of integro-differential equations describing the time evolution of the fraction of individuals with a given state and age is derived, and from it analytical results are obtained characterizing the behavior of the system close to the absorbing states. In general, different age-dependent activation probabilities have different effects on the dynamics. When the activation probability $p_i$ is an increasing function of the age $i$, the system reaches a steady state with coexistence of opinions. In the case of aging, with $p_i$ being a decreasing function, either the system reaches consensus or it gets trapped in a frozen state, depending on the value of $p_\infty$ (zero or not) and the velocity of $p_i$ approaching $p_\infty$. Moreover, when the system reaches consensus, the time ordering of the system can be exponential ($p_\infty>0$) or power-law like ($p_\infty=0$). Exact conditions for having one or another behavior, together with the equations and explicit expressions for the exponents, are provided.

We consider the herding to non-herding transition caused by idiosyncratic choices or imperfect imitation in the context of the Kirman Model for financial markets, or equivalently the Noisy Voter Model for opinion formation. In these original models this is a finite size transition that disappears for a large number of agents. We show how the introduction of two different mechanisms make this transition robust and well defined. A first mechanism is nonlinear interactions among agents taking into account the nonlinear effect of local majorities. The second one is aging, so that the longer an agent has been in a given state the more reluctant she becomes to change state.

We present a stochastic dynamics model of coupled evolution for the binary states of nodes and links in a complex network. In the context of opinion formation node states represent two possible opinions and link states a positive or negative relation. Dynamics proceeds via node and link state update towards pairwise satisfactory relations in which nodes in the same state are connected by positive links or nodes in different states are connected by negative links. By a mean-field rate equations analysis and Monte Carlo simulations in random networks we find an absorbing phase transition from a dynamically active phase to an absorbing phase. The transition occurs for a critical value of the relative time scale for node and link state updates. In the absorbing phase the order parameter, measuring global order, approaches exponentially the final frozen configuration. Finite size effects are such that in the absorbing phase the final configuration is reached in a characteristic time that scales logarithmically with system size, while in the active phase, finite-size fluctuation take the system to a frozen configuration in a characteristic time that grows exponentially with system size. There is also a finite-size topological transition associated with group splitting in the network of these final frozen configurations.

We calculate the large deviation function of the end-to-end distance and the corresponding extension-versus-force relation for (isotropic) random walks, on and off-lattice, with and without persistence, and in any spatial dimension. For off-lattice random walks with persistence, the large deviation function undergoes a first order phase transition in dimension $d> 5$. In the corresponding force-versus-extension relation, the extension becomes independent of the force beyond a critical value. The transition is anticipated in dimensions $d=4$ and $d=5$, where full extension is reached at a finite value of the applied stretching force. Full analytic details are revealed in the run-and-tumble limit. Finally, on-lattice random walks with persistence display a softening phase in dimension $d=3$ and above, preceding the usual stiffening appearing beyond a critical value of the force.

Aging is considered as the property of the elements of a system to be less prone to change states as they get older. We incorporate aging into the noisy voter model, a stochastic model in which the agents modify their binary state by means of noise and pair-wise interactions. Interestingly, due to aging the system passes from a finite-size discontinuous transition between ordered (ferromagnetic) and disordered (paramagnetic) phases to a second order phase transition, well defined in the thermodynamic limit, belonging to the Ising universality class. We characterize it analytically by finding the stationary solution of an infinite set of mean field equations. The theoretical predictions are tested with extensive numerical simulations in low dimensional lattices and complex networks. We finally employ the aging properties to understand the symmetries broken in the phase transition., Comment: 7 pages, 4 figures

The influence of contrarians on the noisy voter model is studied at the mean-field level. The noisy voter model is a variant of the voter model where agents can adopt two opinions, optimistic or pessimistic, and can change them by means of an imitation (herding) and an intrinsic (noise) mechanisms. An ensemble of noisy voters undergoes a finite-size phase transition, upon increasing the relative importance of the noise to the herding, form a bimodal phase where most of the agents shear the same opinion to a unimodal phase where almost the same fraction of agent are in opposite states. By the inclusion of contrarians we allow for some voters to adopt the opposite opinion of other agents (anti-herding). We first consider the case of only contrarians and show that the only possible steady state is the unimodal one. More generally, when voters and contrarians are present, we show that the bimodal-unimodal transition of the noisy voter model prevails only if the number of contrarians in the system is smaller than four, and their characteristic rates are small enough. For the number of contrarians bigger or equal to four, the voters and the contrarians can be seen only in the unimodal phase. Moreover, if the number of voters and contrarians, as well as the noise and herding rates, are of the same order, then the probability functions of the steady state are very well approximated by the Gaussian distribution.

We present an analytical framework to study the first-passage (FP) and first-return (FR) distributions for the broad family of models described by the one-dimensional Fokker-Planck equation in finite domains, identifying general properties of these distributions for different classes of models. When in the Fokker-Planck equation the diffusion coefficient is positive (nonzero) and the drift term is bounded, as in the case of a Brownian walker, both distributions may exhibit a power-law decay with exponent -3/2 for intermediate times. We discuss how the influence of an absorbing state changes this exponent. The absorbing state is characterized by a vanishing diffusion coefficient and/or a diverging drift term. Remarkably, the exponent of the Brownian walker class of models is still found, as long as the departure and arrival regions are far enough from the absorbing state, but the range of times where the power law is observed narrows. Close enough to the absorbing point, though, a new exponent may appear. The particular value of the exponent depends on the behavior of the diffusion and the drift terms of the Fokker-Planck equation. We focus on the case of a diffusion term vanishing linearly at the absorbing point. In this case, the FP and FR distributions are similar to those of the voter model, characterized by a power law with exponent -2. As an illustration of the general theory, we compare it with exact analytical solutions and extensive numerical simulations of a two-parameter voter-like family models. We study the behavior of the FP and FR distributions by tuning the importance of the absorbing points throughout changes of the parameters. Finally, the possibility of inferring relevant information about the steady-sate probability distribution of a model from the FP and FR distributions is addressed., Comment: 17 pages, 8 figures

Random walkers characterized by random positions and random velocities lead to normal diffusion. A random walk was originally proposed by Einstein to model Brownian motion and to demonstrate the existence of atoms and molecules. Such a walker represents an inanimate particle driven by environmental fluctuations. On the other hand, there are many examples of so-called "persistent random walkers", including self-propelled particles that are able to move with almost constant speed while randomly changing their direction of motion. Examples include living entities (ranging from flagellated unicellular organisms to complex animals such as birds and fish), as well as synthetic materials. Here we discuss such persistent non-interacting random walkers as a model for active particles. We also present a model that includes interactions among particles, leading to a transition to flocking, that is, to a net flux where the majority of the particles move in the same direction. Moreover, the model exhibits secondary transitions that lead to clustering and more complex spatially structured states of flocking. We analyze all these transitions in terms of bifurcations using a number of mean field strategies (all to all interaction and advection-reaction equations for the spatially structured states), and compare these results with direct numerical simulations of ensembles of these interacting active particles.

The influence of zealots on the noisy voter model is studied theoretically and numerically at the mean-field level. The noisy voter model is a modification of the voter model that includes a second mechanism for transitions between states: apart from the original herding processes, voters may change their states because of an intrinsic, noisy in origin source. By increasing the importance of the noise with respect to the herding, the system exhibits a finite-size phase transition from a quasi-consensus state, where most of the voters share the same opinion, to a one with coexistence. Upon introducing some zealots, or voters with fixed opinion, the latter scenario may change significantly. We unveil the new situations by carrying out a systematic numerical and analytical study of a fully connected network for voters, but allowing different voters to be directly influenced by different zealots. We show that this general system is equivalent to a system of voters without zealots, but with heterogeneous values of their parameters characterizing herding and noisy dynamics. We find excellent agreement between our analytical and numerical results. Noise and herding/zealotry acting together in the voter model yields not a trivial mixture of the scenarios with the two mechanisms acting alone: it represents a situation where the global-local (noise-herding) competitions is coupled to a symmetry breaking (zealots). In general, the zealotry enhances the effective noise of the system, which may destroy the original quasi--consensus state, and can introduce a bias towards the opinion of the majority of zealots, hence breaking the symmetry of the system and giving rise to new phases ..., Comment: 13 pages, 15 figures

The theoretical description of synchronization phenomena often relies on coupled units of continuous time noisy Markov chains with a small number of states in each unit. It is frequently assumed, either explicitly or implicitly, that coupled discrete-state noisy Markov units can be used to model mathematically more complex coupled noisy continuous phase oscillators. In this work we explore conditions that justify this assumption by coarse-graining continuous phase units. In particular, we determine the minimum number of states necessary to justify this correspondence for Kuramoto-like oscillators.

Inspired by language competition processes, we present a model of coupled evolution of node and link states. In particular, we focus on the interplay between the use of a language and the preference or attitude of the speakers towards it, which we model, respectively, as a property of the interactions between speakers (a link state) and as a property of the speakers themselves (a node state). Furthermore, we restrict our attention to the case of two socially equivalent languages and to socially inspired network topologies based on a mechanism of triadic closure. As opposed to most of the previous literature, where language extinction is an inevitable outcome of the dynamics, we find a broad range of possible asymptotic configurations, which we classify as: frozen extinction states, frozen coexistence states, and dynamically trapped coexistence states. Moreover, metastable coexistence states with very long survival times and displaying a non-trivial dynamics are found to be abundant. Interestingly, a system size scaling analysis shows, on the one hand, that the probability of language extinction vanishes exponentially for increasing system sizes and, on the other hand, that the time scale of survival of the non-trivial dynamical metastable states increases linearly with the size of the system. Thus, non-trivial dynamical coexistence is the only possible outcome for large enough systems. Finally, we show how this coexistence is characterized by one of the languages becoming clearly predominant while the other one becomes increasingly confined to "ghetto-like" structures: small groups of bilingual speakers arranged in triangles, with a strong preference for the minority language, and using it for their intra-group interactions while they switch to the predominant language for communications with the rest of the population., Comment: 21 pages, 15 figures

We consider the competition of two mechanisms for adoption processes: a so-called complex threshold dynamics and a simple Susceptible-Infected-Susceptible (SIS) model. Separately, these mechanisms lead, respectively, to first order and continuous transitions between non-adoption and adoption phases. We consider two interconnected layers. While all nodes on the first layer follow the complex adoption process, all nodes on the second layer follow the simple adoption process. Coupling between the two adoption processes occurs as a result of the inclusion of some additional interconnections between layers. We find that the transition points and also the nature of the transitions are modified in the coupled dynamics. In the complex adoption layer, the critical threshold required for extension of adoption increases with interlayer connectivity whereas in the case of an isolated single network it would decrease with average connectivity. In addition, the transition can become continuous depending on the detailed inter and intralayer connectivities. In the SIS layer, any interlayer connectivity leads to the extension of the adopter phase. Besides, a new transition appears as as sudden drop of the fraction of adopters in the SIS layer. The main numerical findings are described by a mean-field type analytical approach appropriately developed for the threshold-SIS coupled system.

We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogeneity. As an illustration, we study the noisy voter model, a modification of the original voter model including random changes of state. The proposed method is able to unfold the dependence of the model not only on the mean degree (the mean-field prediction) but also on more complex averages over the degree distribution. In particular, we find that the degree heterogeneity ---variance of the underlying degree distribution--- has a strong influence on the location of the critical point of a noise-induced, finite-size transition occurring in the model, on the local ordering of the system, and on the functional form of its temporal correlations. Finally, we show how this latter point opens the possibility of inferring the degree heterogeneity of the underlying network by observing only the aggregate behavior of the system as a whole, an issue of interest for systems where only macroscopic, population level variables can be measured., Comment: 28 pages, 9 figures

Statistics of distinguishable particles has become relevant in systems of colloidal particles and in the context of applications of statistical mechanics to complex networks. When studying these type of systems with the standard textbook formalism, non-physical results such as non-extensive entropies are obtained. In this paper, we will show that the commonly used expression for the partition function of a system of distinguishable particles leads to huge fluctuations of the number of particles in the grand canonical ensemble and, consequently, to non-equivalence of statistical ensembles. We will see how a new proposed definition for the entropy of distinguishable particles by Swendsen [J. Stat. Phys. 107, 1143 (2002)] solves the problem and restores ensemble equivalence. We also show that the new proposal for the partition function does not produce any inconsistency for a system of distinguishable localized particles, where the monoparticular partition function is not extensive.

We focus on the influence of external sources of information upon financial markets. In particular, we develop a stochastic agent-based market model characterized by a certain herding behavior as well as allowing traders to be influenced by an external dynamic signal of information. This signal can be interpreted as a time-varying advertising, public perception or rumor, in favor or against one of two possible trading behaviors, thus breaking the symmetry of the system and acting as a continuously varying exogenous shock. As an illustration, we use a well-known German Indicator of Economic Sentiment as information input and compare our results with Germany's leading stock market index, the DAX, in order to calibrate some of the model parameters. We study the conditions for the ensemble of agents to more accurately follow the information input signal. The response of the system to the external information is maximal for an intermediate range of values of a market parameter, suggesting the existence of three different market regimes: amplification, precise assimilation and undervaluation of incoming information., Comment: 30 pages, 8 figures. Thoroughly revised and updated version of arXiv:1302.6477

We investigate the relaxation of long-tailed distributions under stochastic dynamics that do not support such tails. Linear relaxation is found to be a borderline case in which long tails are exponentially suppressed in time but not eliminated. Relaxation stronger than linear suppresses long tails immediately, but may lead to strong transient peaks in the probability distribution. A delta function initial distribution under stronger than linear decay displays not one but two different regimes of diffusive spreading.

In this work we study the stochastic process of two-species coagulation. This process consists in the aggregation dynamics taking place in a ring. Particles and clusters of particles are set in this ring and they can move either clockwise or counterclockwise. They have a probability to aggregate forming larger clusters when they collide with another particle or cluster. We study the stochastic process both analytically and numerically. Analytically, we derive a kinetic theory which approximately describes the process dynamics. One of our strongest assumptions in this respect is the so called well-stirred limit, that allows neglecting the appearance of spatial coordinates in the theory, so this becomes effectively reduced to a zeroth dimensional model. We determine the long time behavior of such a model, making emphasis in one special case in which it displays self-similar solutions. In particular these calculations answer the question of how the system gets ordered, with all particles and clusters moving in the same direction, in the long time. We compare our analytical results with direct numerical simulations of the stochastic process and both corroborate its predictions and check its limitations. In particular, we numerically confirm the ordering dynamics predicted by the kinetic theory and explore properties of the realizations of the stochastic process which are not accessible to our theoretical approach.

We study anticipated synchronization in two complex Ginzburg-Landau systems coupled in a master-slave configuration. Master and slave systems are ruled by the same autonomous function, but the slave system receives the injection from the master and is subject to a negative delayed self-feedback loop. We give evidence that the magnitude of the largest anticipation time depends on the dynamical regime where the system operates (defect turbulence, phase turbulence or bichaos) and scales with the linear autocorrelation time of the system. Moreover, we find that the largest anticipation times are obtained for complex-valued coupling constants. We provide analytical conditions for the stability of the anticipated synchronization manifold that are in qualitative agreement with those obtained numerically. Finally, we report on the existence of anticipated synchronization in coupled two-dimensional complex Ginzburg-Landau systems., Comment: 6 pages, 6 figures

We study a network model that couples the dynamics of link states with the evolution of the network topology. The state of each link, either A or B, is updated according to the majority rule or zero-temperature Glauber dynamics, in which links adopt the state of the majority of their neighboring links in the network. Additionally, a link that is in a local minority is rewired to a randomly chosen node. While large systems evolving under the majority rule alone always fall into disordered topological traps composed by frustrated links, any amount of rewiring is able to drive the network to complete order, by relinking frustrated links and so releasing the system from traps. However, depending on the relative rate of the majority rule and the rewiring processes, the system evolves towards different ordered absorbing configurations: either a one-component network with all links in the same state or a network fragmented in two components with opposite states. For low rewiring rates and finite size networks there is a domain of bistability between fragmented and non-fragmented final states. Finite size scaling indicates that fragmentation is the only possible scenario for large systems and any nonzero rate of rewiring., Comment: 10 pages, 13 figures