Related papers: Diffusion-annihilation processes in complex networ…
The studies based on $A+A \rightarrow \emptyset$ and $A+B\rightarrow \emptyset$ diffusion-annihilation processes have so far been studied on weighted uncorrelated scale-free networks and fractal scale-free networks. In the previous reports,…
We study the reaction-diffusion process $A + B \to \emptyset$ on uncorrelated scale-free networks analytically. By a mean-field ansatz we derive analytical expressions for the particle pair-correlations and the particle density. Expressing…
Using a steady state process of node duplication and deletion we produce networks with 1/k scale-free degree distributions in the limit of vanishing connectance. This occurs even though there is no growth involved and inherent preferential…
In the reaction-diffusion process $A+B \to \varnothing$ on random scale-free (SF) networks with the degree exponent $\gamma$, the particle density decays with time in a power law with an exponent $\alpha$ when initial densities of each…
This work discusses the homogenization analysis for diffusion processes on scale-free metric graphs, using weak variational formulations. The oscillations of the diffusion coefficient along the edges of a metric graph induce internal…
We study static annihilation on complex networks, in which pairs of connected particles annihilate at a constant rate during time. Through a mean-field formalism, we compute the temporal evolution of the distribution of surviving sites with…
We study the two particle annihilation reaction $A+B\rightarrow \emptyset$ on interconnected scale free networks, using different interconnecting strategies. We explore how the mixing of particles and the process evolution are influenced by…
In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…
Dynamical reaction-diffusion processes and meta-population models are standard modeling approaches for a wide variety of phenomena in which local quantities - such as density, potential and particles - diffuse and interact according to the…
We examine some characteristic properties of reaction-diffusion processes of the A+A->0 type on scale-free networks. Due to the inhomogeneity of the structure of the substrate, as compared to usual lattices, we focus on the characteristics…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We give an intuitive though general explanation of the finite-size effect in scale-free networks in terms of the degree distribution of the starting network. This result clarifies the relevance of the starting network in the final degree…
We consider the inclusion process on the complete graph with vanishing diffusivity, which leads to condensation of particles in the thermodynamic limit. Describing particle configurations in terms of size-biased and appropriately scaled…
Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…
We study the two-species diffusion-annihilation process, $A+B\rightarrow$ \O, on the fully-connected lattice. Probability distributions for the number of particles and the reaction time are obtained for a finite-size system using a master…
The concept of entropy rate for a dynamical process on a graph is introduced. We study diffusion processes where the node degrees are used as a local information by the random walkers. We describe analitically and numerically how the degree…
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…
We present a statistical mechanics approach for the description of complex networks. We first define an energy and an entropy associated to a degree distribution which have a geometrical interpretation. Next we evaluate the distribution…
Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of…
We study the kinetics of diffusion-limited coalescence, A+A->A, and annihilation, A+A->0, in random media consisting of disconnected domains of reaction. Examples include excitons fusion and annihilation in porous matrices and along polymer…