Edmilson Roque

The epidemic spreading has been studied for years by applying the mean-field approach in both homogeneous case, where each node may get infected by an infected neighbor with the same rate, and heterogeneous case, where the infection rates between different pairs of nodes are different. Researchers have discussed whether the mean-field approaches could accurately describe the epidemic spreading for the homogeneous cases but not for the heterogeneous cases. In this paper, we explore under what conditions the mean-field approach could perform well when the infection rates are heterogeneous. In particular, we employ the Susceptible-Infected-Susceptible (SIS) model and compare the average fraction of infected nodes in the metastable state obtained by the continuous-time simulation and the mean-field approximation. We concentrate on an individual-based mean-field approximation called the N-intertwined Mean Field Approximation (NIMFA), which is an advanced approach considered the underlying network topology. Moreover, we consider not only the independent and identically distributed (i.i.d.) infection rate but also the infection rate correlated with the degree of the two end nodes. We conclude that NIMFA is generally more accurate when the prevalence of the epidemic is higher. Given the same effective infection rate, NIMFA is less accurate when the variance of the i.i.d.\ infection rate or the correlation between the infection rate and the nodal degree leads to a lower prevalence. Moreover, given the same actual prevalence, NIMFA performs better in the cases: 1) when the variance of the i.i.d.\ infection rates is smaller (while the average is unchanged); 2) when the correlation between the infection rate and the nodal degree is positive.

In this work, we extend our previous work on largeness tracing among physicists to other fields, namely mathematics, economics and biomedical science. Overall, the results confirm our previous discovery, indicating that scientists in all these fields trace large topics. Surprisingly, however, it seems that researchers in mathematics tend to be more likely to trace large topics than those in the other fields. We also find that on average, papers in top journals are less largeness-driven. We compare researchers from the USA, Germany, Japan and China and find that Chinese researchers exhibit consistently larger exponents, indicating that in all these fields, Chinese researchers trace large topics more strongly than others. Further correlation analyses between the degree of largeness tracing and the numbers of authors, affiliations and references per paper reveal positive correlations -- papers with more authors, affiliations or references are likely to be more largeness-driven, with several interesting and noteworthy exceptions: in economics, papers with more references are not necessary more largeness-driven, and the same is true for papers with more authors in biomedical science. We believe that these empirical discoveries may be valuable to science policy-makers.

Spreading processes are ubiquitous in natural and artificial systems. They can be studied via a plethora of models, depending on the specific details of the phenomena under study. Disease contagion and rumor spreading are among the most important of these processes due to their practical relevance. However, despite the similarities between them, current models address both spreading dynamics separately. In this paper, we propose a general information spreading model that is based on discrete time Markov chains. The model includes all the transitions that are plausible for both a disease contagion process and rumor propagation. We show that our model not only covers the traditional spreading schemes, but that it also contains some features relevant in social dynamics, such as apathy, forgetting, and lost/recovering of interest. The model is evaluated analytically to obtain the spreading thresholds and the early time dynamical behavior for the contact and reactive processes in several scenarios. Comparison with Monte Carlo simulations shows that the Markov chain formalism is highly accurate while it excels in computational efficiency. We round off our work by showing how the proposed framework can be applied to the study of spreading processes occurring on social networks.

We generalize the original majority-vote model by incorporating an inertia into the microscopic dynamics of the spin flipping, where the spin-flip probability of any individual depends not only on the states of its neighbors, but also on its own state. Surprisingly, the order-disorder phase transition is changed from a usual continuous type to a discontinuous or an explosive one when the inertia is above an appropriate level. A central feature of such an explosive transition is a strong hysteresis behavior as noise intensity goes forward and backward. Within the hysteresis region, a disordered phase and two symmetric ordered phases are coexisting and transition rates between these phases are numerically calculated by a rare-event sampling method. A mean-field theory is developed to analytically reveal the property of this phase transition.

We generalize the original majority-vote model by incorporating an inertia into the microscopic dynamics of the spin flipping, where the spin-flip probability of any individual depends not only on the states of its neighbors, but also on its own state. Surprisingly, the order-disorder phase transition is changed from a usual continuous type to a discontinuous or an explosive one when the inertia is above an appropriate level. A central feature of such an explosive transition is a strong hysteresis behavior as noise intensity goes forward and backward. Within the hysteresis region, a disordered phase and two symmetric ordered phases are coexisting and transition rates between these phases are numerically calculated by a rare-event sampling method. A mean-field theory is developed to analytically reveal the property of this phase transition.

Spreading processes are ubiquitous in natural and artificial systems. They can be studied via a plethora of models, depending on the specific details of the phenomena under study. Disease contagion and rumor spreading are among the most important of these processes due to their practical relevance. However, despite the similarities between them, current models address both spreading dynamics separately. In this paper, we propose a general information spreading model that is based on discrete time Markov chains. The model includes all the transitions that are plausible for both a disease contagion process and rumor propagation. We show that our model not only covers the traditional spreading schemes, but that it also contains some features relevant in social dynamics, such as apathy, forgetting, and lost/recovering of interest. The model is evaluated analytically to obtain the spreading thresholds and the early time dynamical behavior for the contact and reactive processes in several scenarios. Comparison with Monte Carlo simulations shows that the Markov chain formalism is highly accurate while it excels in computational efficiency. We round off our work by showing how the proposed framework can be applied to the study of spreading processes occurring on social networks.

Author(s): Yoji Kawamura and Hiroya Nakao

We investigate common-noise-induced synchronization between two identical networks of coupled phase oscillators exhibiting fully locked collective oscillations. Using the collective phase description method for fully locked oscillators, we demonstrate that two noninteracting networks of coupled phas…

[Phys. Rev. E 94, 032201] Published Fri Sep 02, 2016

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.

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.

A commonly used approach to study stability in a complex system is by analyzing the Jacobian matrix at an equilibrium point of a dynamical system. The equilibrium point is stable if all eigenvalues have negative real parts. Here, by obtaining eigenvalue bounds of the Jacobian, we show that stable complex systems will favor mutualistic and competitive relationships that are asymmetrical (non-reciprocative) and trophic relationships that are symmetrical (reciprocative). Additionally, we define a measure called the interdependence diversity that quantifies how distributed the dependencies are between the dynamical variables in the system. We find that increasing interdependence diversity has a destabilizing effect on the equilibrium point, and the effect is greater for trophic relationships than for mutualistic and competitive relationships. These predictions are consistent with empirical observations in ecology. More importantly, our findings suggest stabilization algorithms that can apply very generally to a variety of complex systems.

An articulation point in a network is a node whose removal disconnects the network. Those nodes play key roles in ensuring connectivity of many real-world networks, from infrastructure networks to protein interaction networks and terrorist communication networks. Despite their fundamental importance, a general framework of studying articulation points in complex networks is lacking. Here we develop analytical tools to study key issues pertinent to articulation points, e.g. the expected number of them and the network vulnerability against their removal, in an arbitrary complex network. We find that a greedy articulation point removal process provides us a novel perspective on the organizational principles of complex networks. Moreover, this process is associated with two fundamentally different types of percolation transitions with a rich phase diagram. Our results shed light on the design of more resilient infrastructure networks and the effective destruction of terrorist communication networks.

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.

Author(s): P. Salgado Sánchez, J. Porter, I. Tinao, and A. Laverón-Simavilla

This paper addresses the behavior of two parametrically forced oscillators in the weakly coupled regime. The authors investigate several instances of coupling and analyze the resulting instabilities and the breaking of symmetries in the problem. These results are connected to recent experimental observations and simulation results in fluid mechanics and granular matter.

[Phys. Rev. E 94, 022216] Published Mon Aug 29, 2016

Author(s): Daniel R. Parisi, Pablo A. Negri, and Luciana Bruno

In the present paper, the avoidance behavior of pedestrians was characterized by controlled experiments. Several conflict situations were studied considering different flow rates and group sizes in crossing and head-on configurations. Pedestrians were recorded from above, and individual two-dimensio…

[Phys. Rev. E 94, 022318] Published Mon Aug 29, 2016

Author(s): Alexandra Kruscha and Benjamin Lindner

This paper analyzes the excitation of a population of uncoupled neurons stimulated by a common white-noise process. The authors define a measure for the partial synchronization of the output of the firing neurons, and study its properties analytically and numerically. The results may lead to a better understanding of coincidence detection in neural signal processing.

[Phys. Rev. E 94, 022422] Published Mon Aug 29, 2016

It is well known that linear vector fields on the manifold ##IMG## [http://ej.iop.org/images/0951-7715/29/10/3120/nonaa3831ieqn001.gif] {${{\mathbb{R}}^{n}}$} cannot have limit cycles, but this is not the case for linear vector fields on other manifolds. We study the periodic orbits of linear vector fields on different manifolds, and motivate and present an open problem on the number of limit cycles of linear vector fields on a class of ##IMG## [http://ej.iop.org/images/0951-7715/29/10/3120/nonaa3831ieqn002.gif] {${{\mathcal{C}}^{1}}$} connected manifold.

We show explicitly how a fixed point can be constructed in scalar ##IMG## [http://ej.iop.org/images/0295-5075/115/2/27005/epl18017ieqn3.gif] {$g\varphi^4$} theory from the solutions to a nonlinear eigenvalue problem. The fixed point is unstable and characterized by ##IMG## [http://ej.iop.org/images/0295-5075/115/2/27005/epl18017ieqn4.gif] {$\nu=2/d$} (correlation length exponent), ##IMG## [http://ej.iop.org/images/0295-5075/115/2/27005/epl18017ieqn5.gif] {$\eta=1/2-d/8$} (anomalous dimension). For d = 2, these exponents reproduce to those of the Ising model which can be understood from the codimension of the critical point. The testable prediction of this fixed point is that the specific heat exponent vanishes. 2d critical Mott systems are well described by this new fixed point.

We propose and analyze extended floor field cellular automaton models for evacuation dynamics of inhomogeneous pedestrian pairs which are coupled by asymmetric group interactions. Such pairs consist of a leader, who mainly determines the couple's motion and a follower, who has a defined tendency to follow the leader. Examples for such pairs are mother and child or two siblings of different age. We examine the system properties and compare them to the case of a homogeneous crowd. We find a strong impact on evacuation times for the regime of strong pair coupling due to the occurrence of a clogging phenomenon. In addition we obtain a non-trivial dependence of evacuation times on the followers' coupling to the static floor field, which carries the information of the shortest way to the exit location. In particular we find that systems with fully passive followers, who are solely coupled to their leaders, show lower evacuation times than homogeneous systems where all pedestrians have an equal tendency to move towards the exit. We compare the results of computer simulations with recently performed experiments.

We study the influence of selfish vs. polite behaviours on the dynamics of a pedestrian evacuation through a narrow exit. To this end, experiments involving about 80 participants with distinct prescribed behaviours are performed; reinjection of participants into the setup allowed us to improve the statistics. Notwithstanding the fluctuations in the instantaneous flow rate, we find that a stationary regime is almost immediately reached. The average flow rate increases monotonically with the fraction c\_s of vying (selfish) pedestrians, which corresponds to a "faster-is-faster" effect in our experimental conditions; it is also positively correlated with the average density of pedestrians in front of the door, up to nearly close-packing. At large c\_s , the flow displays marked intermittency, with bursts of quasi-simultaneous escapes. In addition to these findings, we wonder whether the effect of cooperation is specific to systems of intelligent beings, or whether it can be reproduced by a purely mechanical surrogate. To this purpose, we consider a bidimensional granular flow through an orifice in which some grains are made "cooperative" by repulsive magnetic interactions which impede their mutual collisions.

Many real, complex systems, such as the human brain and skin with their biological networks or intelligent material systems consisting of composite functional liquids, exhibit a noticeable capability of self-healing. Here, we study a network model with arbitrary degree distributions possessing natural link oriented recovery mechanisms, whereby a failed link can be recovered if its two end nodes maintain a sufficient proportion of functional links. These mechanisms are pertinent for many spontaneous healing and manual repair phenomena, interpolating smoothly between complete healing and no healing scenarios. We show that the self-healing strategies have profound impact on resilience of homogeneous and heterogeneous networks employing a percolation threshold, fraction of giant cluster, and link robustness index. The self-healing effect induces distinct resilience characteristics for scale-free networks under random failures and intentional attacks, and a resilience crossover has b...

Author(s): Daniel Heger and Katharina Krischer

Uncertain recognition success, unfavorable scaling of connection complexity, or dependence on complex external input impair the usefulness of current oscillatory neural networks for pattern recognition or restrict technical realizations to small networks. We propose a network architecture of coupled…

[Phys. Rev. E 94, 022309] Published Thu Aug 18, 2016

Synchronization over networks depends strongly on the structure of the coupling between the oscillators. When the coupling presents certain regularities, the dynamics can be coarse-grained into clusters by means of External Equitable Partitions of the network graph and their associated quotient graphs. We exploit this graph-theoretical concept to study the phenomenon of cluster synchronization, in which different groups of nodes converge to distinct behaviors. We derive conditions and properties of networks in which such clustered behavior emerges, and show that the ensuing dynamics is the result of the localization of the eigenvectors of the associated graph Laplacians linked to the existence of invariant subspaces. The framework is applied to both linear and non-linear models, first for the standard case of networks with positive edges, before being generalized to the case of signed networks with both positive and negative interactions. We illustrate our results with examples of both signed and unsigned graphs for consensus dynamics and for partial synchronization of oscillator networks under the master stability function as well as Kuramoto oscillators.

Studies on how to model the interplay between diseases and behavioral responses (so-called coupled disease-behavior interaction) have attracted increasing attention. Owing to the lack of obvious clinical evidence of diseases, or the incomplete information related to the disease, the risks of infection cannot be perceived and may lead to inappropriate behavioral responses. Therefore, how to quantitatively analyze the impacts of asymptomatic infection on the interplay between diseases and behavioral responses is of particular importance. In this Letter, under the complex network framework, we study the coupled disease-behavior interaction model by dividing infectious individuals into two states: U-state (without evident clinical symptoms, labelled as U) and I-state (with evident clinical symptoms, labelled as I). A susceptible individual can be infected by U- or I-nodes, however, since the U-nodes cannot be easily observed, susceptible individuals take behavioral responses \emph{only} when they contact I-nodes. The mechanism is considered in the improved Susceptible-Infected-Susceptible (SIS) model and the improved Susceptible-Infected-Recovered (SIR) model, respectively. Then, one of the most concerned problems in spreading dynamics: the epidemic thresholds for the two models are given by two methods. The analytic results \emph{quantitatively} describe the influence of different factors, such as asymptomatic infection, the awareness rate, the network structure, and so forth, on the epidemic thresholds. Moreover, because of the irreversible process of the SIR model, the suppression effect of the improved SIR model is weaker than the improved SIS model.

Robustness estimation is critical for the design and maintenance of resilient networks, one of the global challenges of the 21st century. Existing studies exploit network metrics to generate attack strategies, which simulate intentional attacks in a network, and compute a metric-induced robustness estimation. While some metrics are easy to compute, e.g. degree centrality, other, more accurate, metrics require considerable computation efforts, e.g. betweennes centrality. We propose a new algorithm for estimating the robustness of a network in sub-quadratic time, i.e., significantly faster than betweenness centrality. Experiments on real-world networks and random networks show that our algorithm estimates the robustness of networks close to or even better than betweenness centrality, while being orders of magnitudes faster. Our work contributes towards scalable, yet accurate methods for robustness estimation of large complex networks.