Random walks on complex networks with multiple resetting nodes: A renewal approach.

Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex networks with multiple resetting nodes. Using a renewal approach, we derive exact expressions of the occupation probability of the walker in each node and mean first-passage time between arbitrary two nodes. All the results can be expressed in terms of the spectral properties of the transition matrix in the absence of resetting. We demonstrate our results on circular networks, stochastic block models, and Barabási-Albert scale-free networks and find the advantage of the resetting processes to multiple resetting nodes in a global search on such networks. Finally, the distribution of resetting probabilities is optimized via a simulated annealing algorithm, so as to minimize the mean first-passage time averaged over arbitrary two distinct nodes.

An improved belief propagation algorithm for detecting mesoscale structure in complex networks.

The framework of statistical inference has been successfully used to detect the mesoscale structures in complex networks such as community structure and core-periphery (CP) structure. The main principle is that the stochastic block model is used to fit the observed network and the learned parameters indicating the group assignment, in which the parameters of model are often calculated via an expectation-maximization algorithm and a belief propagation (BP) algorithm, is implemented to calculate the decomposition itself. In the derivation process of the BP algorithm, some approximations were made by omitting the effects of node's neighbors, the approximations do not hold if the degrees of some nodes are extremely large. As a result, for example, the BP algorithm cannot detect the CP structure in networks and even yields a wrong detection because the nodal degrees in the core group are very large. In doing so, we propose an improved BP algorithm to solve the problem in the original BP algorithm without increasing any computational complexity. We find that the original and the improved BP algorithms yield a similar performance regarding the community detection; however, our improved BP algorithm is much better and more stable when the CP structure becomes more dominant. The improved BP algorithm may help us correctly partition different types of mesoscale structures in networks.

Hybrid multiscale coarse-graining for dynamics on complex networks.

We propose a hybrid multiscale coarse-grained (HMCG) method which combines a fine Monte Carlo (MC) simulation on the part of nodes of interest with a more coarse Langevin dynamics on the rest part. We demonstrate the validity of our method by analyzing the equilibrium Ising model and the nonequilibrium susceptible-infected-susceptible model. It is found that HMCG not only works very well in reproducing the phase transitions and critical phenomena of the microscopic models, but also accelerates the evaluation of dynamics with significant computational savings compared to microscopic MC simulations directly for the whole networks. The proposed method is general and can be applied to a wide variety of networked systems just adopting appropriate microscopic simulation methods and coarse graining approaches.

Reconstructing signed networks via Ising dynamics.

Revealing unknown network structure from observed data is a fundamental inverse problem in network science. Current reconstruction approaches were mainly proposed to infer the unsigned networks. However, many social relationships, such as friends and foes, can be represented as signed social networks that contain positive and negative links. To the best of our knowledge, the method of reconstructing signed networks has not yet been developed. To this purpose, we develop a statistical inference approach to fully reconstruct the signed network structure (positive links, negative links, and nonexistent links) based on the Ising dynamics. By the theoretical analysis, we show that our approach can transfer the problem of maximum likelihood estimation into the problem of solving linear systems of equations, where the solution of the linear system of equations uncovers the neighbors and the signs of links of each node. The experimental results on both synthetic and empirical networks validate the reliability and efficiency of our method. Our study moves the first step toward reconstructing signed networks.

Detection of core-periphery structure in networks based on 3-tuple motifs.

Detecting mesoscale structure, such as community structure, is of vital importance for analyzing complex networks. Recently, a new mesoscale structure, core-periphery (CP) structure, has been identified in many real-world systems. In this paper, we propose an effective algorithm for detecting CP structure based on a 3-tuple motif. In this algorithm, we first define a 3-tuple motif in terms of the patterns of edges as well as the property of nodes, and then a motif adjacency matrix is constructed based on the 3-tuple motif. Finally, the problem is converted to find a cluster that minimizes the smallest motif conductance. Our algorithm works well in different CP structures: including single or multiple CP structure, and local or global CP structures. Results on the synthetic and the empirical networks validate the high performance of our method.

A unified method of detecting core-periphery structure and community structure in networks.

The core-periphery structure and the community structure are two typical meso-scale structures in complex networks. Although community detection has been extensively investigated from different perspectives, the definition and the detection of the core-periphery structure have not received much attention. Furthermore, the detection problems of the core-periphery and community structure were separately investigated. In this paper, we develop a unified framework to simultaneously detect the core-periphery structure and community structure in complex networks. Moreover, there are several extra advantages of our algorithm: our method can detect not only single but also multiple pairs of core-periphery structures; the overlapping nodes belonging to different communities can be identified; different scales of core-periphery structures can be detected by adjusting the size of the core. The good performance of the method has been validated on synthetic and real complex networks. So, we provide a basic framework to detect the two typical meso-scale structures: the core-periphery structure and the community structure.

Large deviation induced phase switch in an inertial majority-vote model.

We theoretically study noise-induced phase switch phenomena in an inertial majority-vote (IMV) model introduced in a recent paper [Chen et al., Phys. Rev. E 95, 042304 (2017)]. The IMV model generates a strong hysteresis behavior as the noise intensity f goes forward and backward, a main characteristic of a first-order phase transition, in contrast to a second-order phase transition in the original MV model. Using the Wentzel-Kramers-Brillouin approximation for the master equation, we reduce the problem to finding the zero-energy trajectories in an effective Hamiltonian system, and the mean switching time depends exponentially on the associated action and the number of particles N. Within the hysteresis region, we find that the actions, along the optimal forward switching path from the ordered phase (OP) to disordered phase (DP) and its backward path show distinct variation trends with f, and intersect at f = fc that determines the coexisting line of the OP and DP. This results in a nonmonotonic dependence of the mean switching time between two symmetric OPs on f, with a minimum at fc for sufficiently large N. Finally, the theoretical results are validated by Monte Carlo simulations.

Interplay between the local information based behavioral responses and the epidemic spreading in complex networks.

The spreading of an infectious disease can trigger human behavior responses to the disease, which in turn plays a crucial role on the spreading of epidemic. In this study, to illustrate the impacts of the human behavioral responses, a new class of individuals, S(F), is introduced to the classical susceptible-infected-recovered model. In the model, S(F) state represents that susceptible individuals who take self-initiate protective measures to lower the probability of being infected, and a susceptible individual may go to S(F) state with a response rate when contacting an infectious neighbor. Via the percolation method, the theoretical formulas for the epidemic threshold as well as the prevalence of epidemic are derived. Our finding indicates that, with the increasing of the response rate, the epidemic threshold is enhanced and the prevalence of epidemic is reduced. The analytical results are also verified by the numerical simulations. In addition, we demonstrate that, because the mean field method neglects the dynamic correlations, a wrong result based on the mean field method is obtained-the epidemic threshold is not related to the response rate, i.e., the additional S(F) state has no impact on the epidemic threshold.

Mobility and density induced amplitude death in metapopulation networks of coupled oscillators.

We investigate the effects of mobility and density on the amplitude death of coupled Landau-Stuart oscillators and Brusselators in metapopulation networks, wherein each node represents a subpopulation occupied any number of mobile individuals. By numerical simulations in scale-free topology, we find that the systems undergo phase transitions from incoherent state to amplitude death, and then to frequency synchronization with increasing the mobility rate or density of oscillators. Especially, there exists an extent of intermediate mobility rate and density that can lead to global oscillator death. Furthermore, we show that such nontrivial phenomena are robust to diverse network topologies. Our findings may invoke further efforts and attentions to explore the underlying mechanism of collective behaviors in coupled metapopulation systems.

Nucleation pathways on complex networks.

Identifying nucleation pathway is important for understanding the kinetics of first-order phase transitions in natural systems. In the present work, we study nucleation pathway of the Ising model in homogeneous and heterogeneous networks using the forward flux sampling method, and find that the nucleation processes represent distinct features along pathways for different network topologies. For homogeneous networks, there always exists a dominant nucleating cluster to which relatively small clusters are attached gradually to form the critical nucleus. For heterogeneous ones, many small isolated nucleating clusters emerge at the early stage of the nucleation process, until suddenly they form the critical nucleus through a sharp merging process. Moreover, we also compare the nucleation pathways for different degree-mixing networks. By analyzing the properties of the nucleating clusters along the pathway, we show that the main reason behind the different routes is the heterogeneous character of the underlying networks.

Explosive synchronization transitions in complex neural networks.

It has been recently reported that explosive synchronization transitions can take place in networks of phase oscillators [Gómez-Gardeñes et al. Phys. Rev. Lett. 106, 128701 (2011)] and chaotic oscillators [Leyva et al. Phys. Rev. Lett. 108, 168702 (2012)]. Here, we investigate the effect of a microscopic correlation between the dynamics and the interacting topology of coupled FitzHugh-Nagumo oscillators on phase synchronization transition in Barabási-Albert (BA) scale-free networks and Erdös-Rényi (ER) random networks. We show that, if natural frequencies of the oscillations are positively correlated with node degrees and the width of the frequency distribution is larger than a threshold value, a strong hysteresis loop arises in the synchronization diagram of BA networks, indicating the evidence of an explosive transition towards synchronization of relaxation oscillators system. In contrast to the results in BA networks, in more homogeneous ER networks, the synchronization transition is always of continuous type regardless of the width of the frequency distribution. Moreover, we consider the effect of degree-mixing patterns on the nature of the synchronization transition, and find that the degree assortativity is unfavorable for the occurrence of such an explosive transition.

Extremal statistics for a resetting Brownian motion before its first-passage time.

We study the extreme value statistics of a one-dimensional resetting Brownian motion (RBM) till its first passage through the origin starting from the position x_{0} (>0). By deriving the exit probability of RBM in an interval [0,M] from the origin, we obtain the distribution P_{r}(M|x_{0}) of the maximum displacement M and thus gives the expected value 〈M〉 of M as functions of the resetting rate r and x_{0}. We find that 〈M〉 decreases monotonically as r increases, and tends to 2x_{0} as r→∞. In the opposite limit, 〈M〉 diverges logarithmically as r→0. Moreover, we derive the propagator of RBM in the Laplace domain in the presence of both absorbing ends, and then leads to the joint distribution P_{r}(M,t_{m}|x_{0}) of M and the time t_{m} at which this maximum is achieved in the Laplace domain by using a path decomposition technique, from which the expected value 〈t_{m}〉 of t_{m} is obtained explicitly. Interestingly, 〈t_{m}〉 shows a nonmonotonic dependence on r, and attains its minimum at an optimal r^{*}≈2.71691D/x_{0}^{2}, where D is the diffusion coefficient. Finally, we perform extensive simulations to validate our theoretical results.

Entropic stochastic resonance of a flexible polymer chain in a confined system.

We have studied the dynamics of a flexible polymer chain in constrained dumb-bell-shape geometry subject to a periodic force and external noise along the longitudinal direction. It is found that the system exhibits a feature of entropic stochastic resonance (ESR), i.e., the temporal coherence of the polymer motion can reach a maximum level for an optimal noise intensity. We demonstrate that the occurrence of ESR is robust to the change of chain length, while the bottleneck width should be properly chosen. A gravity force in the vertical direction is not necessary for the ESR here, however, the elastic coupling between polymer beads is crucial.

Entropy rate of random walks on complex networks under stochastic resetting.

Stochastic processes under resetting at random times have attracted a lot of attention in recent years and served as illustrations of nontrivial and interesting static and dynamic features of stochastic dynamics. In this paper, we aim to address how the entropy rate is affected by stochastic resetting in discrete-time Markovian processes, and we explore nontrivial effects of the resetting in the mixing properties of a stochastic process. In particular, we consider resetting random walks (RRWs) with a single resetting node on three different types of networks: degree-regular random networks, a finite-size Cayley tree, and a Barabási-Albert (BA) scale-free network, and we compute the entropy rate as a function of the resetting probability γ. Interestingly, for the first two types of networks, the entropy rate shows a nonmonotonic dependence on γ. There exists an optimal value of γ at which the entropy rate reaches a maximum. Such a maximum is larger than that of maximal-entropy random walks (MREWs) and standard random walks (SRWs) on the same topology, while for the BA network the entropy rate of RRWs either shows a unique maximum or decreases monotonically with γ, depending upon the choice of the resetting node. When the maximum entropy rate of RRWs exists, it can be higher or lower than that of MREWs or SRWs. Our study reveals a nontrivial effect of stochastic resetting on nonequilibrium statistical physics.

Random walks on complex networks under time-dependent stochastic resetting.

We study discrete-time random walks on networks subject to a time-dependent stochastic resetting, where the walker either hops randomly between neighboring nodes with a probability 1-ϕ(a) or is reset to a given node with a complementary probability ϕ(a). The resetting probability ϕ(a) depends on the time a since the last reset event (also called a, the age of the walker). Using the renewal approach and spectral decomposition of the transition matrix, we formulate the stationary occupation probability of the walker at each node and the mean first passage time between two arbitrary nodes. Concretely, we consider two different time-dependent resetting protocols that are both exactly solvable. One is that ϕ(a) is a step-shaped function of a and the other one is that ϕ(a) is a rational function of a. We demonstrate the theoretical results on several different networks, also validated by numerical simulations, and find that the time-modulated resetting protocols can be more advantageous than the constant-probability resetting in accelerating the completion of a target search process.

First passage of a diffusing particle under stochastic resetting in bounded domains with spherical symmetry.

We investigate the first passage properties of a Brownian particle diffusing freely inside a d-dimensional sphere with absorbing spherical surface subject to stochastic resetting. We derive the mean time to absorption (MTA) as functions of resetting rate γ and initial distance r of the particle to the center of the sphere. We find that when r>r_{c} there exists a nonzero optimal resetting rate γ_{opt} at which the MTA is a minimum, where r_{c}=sqrt[d/(d+4)]R and R is the radius of the sphere. As r increases, γ_{opt} exhibits a continuous transition from zero to nonzero at r=r_{c}. Furthermore, we consider that the particle lies between two two-dimensional or three-dimensional concentric spheres with absorbing boundaries, and obtain the domain in which resetting expedites the MTA, which is (R_{1},r_{c_{1}})∪(r_{c_{2}},R_{2}), with R_{1} and R_{2} being the radii of inner and outer spheres, respectively. Interestingly, when R_{1}/R_{2} is less than a critical value, γ_{opt} exhibits a discontinuous transition at r=r_{c_{1}}; otherwise, such a transition is continuous. However, at r=r_{c_{2}} the transition is always continuous.

Full reconstruction of simplicial complexes from binary contagion and Ising data.

Previous efforts on data-based reconstruction focused on complex networks with pairwise or two-body interactions. There is a growing interest in networks with higher-order or many-body interactions, raising the need to reconstruct such networks based on observational data. We develop a general framework combining statistical inference and expectation maximization to fully reconstruct 2-simplicial complexes with two- and three-body interactions based on binary time-series data from two types of discrete-state dynamics. We further articulate a two-step scheme to improve the reconstruction accuracy while significantly reducing the computational load. Through synthetic and real-world 2-simplicial complexes, we validate the framework by showing that all the connections can be faithfully identified and the full topology of the 2-simplicial complexes can be inferred. The effects of noisy data or stochastic disturbance are studied, demonstrating the robustness of the proposed framework.

Random walks on complex networks with first-passage resetting.

We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits either of observable nodes. We derive exact expressions of the stationary occupation probability, the average number of resets in the long time, and the mean first-passage time between arbitrary two nonobservable nodes. We show that all the quantities can be expressed in terms of the fundamental matrix Z=(I-Q)^{-1}, where I is the identity matrix and Q is the transition matrix between nonobservable nodes. Finally, we use ring networks, two-dimensional square lattices, barbell networks, and Cayley trees to demonstrate the advantage of first-passage resetting in global search on such networks.

Non-Markovian majority-vote model.

Non-Markovian dynamics pervades human activity and social networks and it induces memory effects and burstiness in a wide range of processes including interevent time distributions, duration of interactions in temporal networks, and human mobility. Here, we propose a non-Markovian majority-vote model (NMMV) that introduces non-Markovian effects in the standard (Markovian) majority-vote model (SMV). The SMV model is one of the simplest two-state stochastic models for studying opinion dynamics, and displays a continuous order-disorder phase transition at a critical noise. In the NMMV model we assume that the probability that an agent changes state is not only dependent on the majority state of his neighbors but it also depends on his age, i.e., how long the agent has been in his current state. The NMMV model has two regimes: the aging regime implies that the probability that an agent changes state is decreasing with his age, while in the antiaging regime the probability that an agent changes state is increasing with his age. Interestingly, we find that the critical noise at which we observe the order-disorder phase transition is a nonmonotonic function of the rate ß of the aging (antiaging) process. In particular the critical noise in the aging regime displays a maximum as a function of ß while in the antiaging regime displays a minimum. This implies that the aging/antiaging dynamics can retard/anticipate the transition and that there is an optimal rate ß for maximally perturbing the value of the critical noise. The analytical results obtained in the framework of the heterogeneous mean-field approach are validated by extensive numerical simulations on a large variety of network topologies.

Resonant response of forced complex networks: the role of topological disorder.

We investigate the effect of topological disorder on a system of forced threshold elements, where each element is arranged on top of complex heterogeneous networks. Numerical results indicate that the response of the system to a weak signal can be amplified at an intermediate level of topological disorder, thus indicating the occurrence of topological-disorder-induced resonance. Using mean field method, we obtain an analytical understanding of the resonant phenomenon by deriving the effective potential of the system. Our findings might provide further insight into the role of network topology in signal amplification in biological networks.