Related papers: Static Pairwise Annihilation in Complex Networks
Effects of the static electric field on the splitting and annihilation widths of the levels of antiprotonic hydrogen with a large principal quantum number (n=30) are studied. Non-trivial aspects of the consideration is related with…
A system of particles is studied in which the stochastic processes are one-particle type-change (or one-particle diffusion) and multi-particle annihilation. It is shown that, if the annihilation rate tends to zero but the initial values of…
Exchangeability is a desired statistical property of network ensembles requiring their invariance upon relabelling of the nodes. However combining sparsity of network ensembles with exchangeability is challenging. Here we propose a…
We study the dynamics of the contact-process, one of the simplest nonequilibrium stochastic processes, taking place on a scale-free network. We consider the network topology as annealed, i.e. all links are rewired at each microscopic time…
The description of large temporal graphs requires effective methods giving an appropriate mesoscopic partition. Many approaches exist today to detect communities in static graphs. However, many networks are intrinsically dynamical, and need…
Two versions of the susceptible-infected-susceptible epidemic model, which have different transmission rules, are analysed. Both models are considered on a weighted network to simulate a mitigation in the connection between the individuals.…
We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold…
We study the contact process in the regime of small infection rates on finite scale-free networks with stationary dynamics based on simultaneous updating of all connections of a vertex. We allow the update rates of individual vertices to…
An adaptive network model using SIS epidemic propagation with link-type dependent link activation and deletion is considered. Bifurcation analysis of the pairwise ODE approximation and the network-based stochastic simulation is carried out,…
In a highly influential paper twenty years ago, Barab\'asi and Albert [Science 286, 509 (1999)] showed that networks undergoing generic growth processes with preferential attachment evolve towards scale-free structures. In any finite…
A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P(k)=ck^-a. We study the stability of such networks with respect to crashes, such…
This paper presents results on the typical number of simultaneous point-to-point transmissions above a minimum rate that can be sustained in a network with $n$ transmitter-receiver node pairs when all transmitting nodes can potentially…
Interdependent networks are characterized by two kinds of interactions: The usual connectivity links within each network and the dependency links coupling nodes of different networks. Due to the latter links such networks are known to…
We present an analytically solvable random graph model in which the connections between the nodes can evolve in time, adiabatically slowly compared to the dynamics of the nodes. We apply the formalism to finite connectivity attractor neural…
We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then…
Numerous complex systems, both natural and artificial, are characterized by the presence of intertwined supply and/or drainage networks. Here we present a minimalist model of such co-evolving networks in a spatially continuous domain, where…
The phase transition of the even offspringed branching and annihilating random walk is studied by N-cluster mean-field approximations on one-dimensional lattices. By allowing to reach zero branching rate a phase transition can be seen for…
We derive an improved mean-field approximation for k-body annihilation reactions kA --> inert, for hard-core diffusing particles on a line, annihilating in groups of k neighbors with probability 0 < q <= 1. The hopping and annihilation…
We present a quenched mean-field (QMF) theory for the dynamics of the susceptible-infected-susceptible (SIS) epidemic model on complex networks where dynamical correlations between connected vertices are taken into account by means of a…
The stability analysis of synchronization in time-varying higher-order networked structures (simplicial complexes) is one of the challenging problem due to the presence of time-varying group interactions. In this context, most of the…