Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSegregation in the annihilation of two-species reaction-diffusion processes on fractal scale-free networks
104
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 species are the same. The exponent $alpha$ is $alpha > 1$ for $2 < gamma < 3$ and $alpha=1$ for $gamma ge 3$. Here, we examine the reaction process on fractal SF networks, finding that $alpha < 1$ even for $2 < gamma < 3$. This slowly decaying behavior originates from the segregation effect: Fractal SF networks contain local hubs, which are repulsive to each other. Those hubs attract particles and accelerate the reaction, and then create domains containing the same species of particles. It follows that the reaction takes place at the non-hub boundaries between those domains and thus the particle density decays slowly. Since many real SF networks are fractal, the segregation effect has to be taken into account in the reaction kinetics among heterogeneous particles.
rate research
Read More
The studies based on $A+A rightarrow emptyset$ and $A+Brightarrow emptyset$ diffusion-annihilation processes have so far been studied on weighted uncorrelated scale-free networks and fractal scale-free networks. In the previous reports, it is widely accepted that the segregation of particles in the processes is introduced by the fractal structure. In this paper, we study these processes on a family of weighted scale-free networks with identical degree sequence. We find that the depletion zone and segregation are essentially caused by the disassortative mixing, namely, high-degree nodes tend to connect with low-degree nodes. Their influence on the processes is governed by the correlation between the weight and degree. Our finding suggests both the weight and degree distribution dont suffice to characterize the diffusion-annihilation processes on weighted scale-free networks.
A complete understanding of real networks requires us to understand the consequences of the uneven interaction strengths between a systems components. Here we use the minimum spanning tree (MST) to explore the effect of weight assignment and network topology on the organization of complex networks. We find that if the weight distribution is correlated with the network topology, the MSTs are either scale-free or exponential. In contrast, when the correlations between weights and topology are absent, the MST degree distribution is a power-law and independent of the weight distribution. These results offer a systematic way to explore the impact of weak links on the structure and integrity of complex networks.
We study the decay process for the reaction-diffusion process of three species on the small-world network. The decay process is manipulated from the deterministic rate equation of three species in the reaction-diffusion system. The particle density and the global reaction rate on a two dimensional small-world network adding new random links is discussed numerically, and the global reaction rate before and after the crossover is also found by means of the Monte Carlo simulation. The time-dependent global reaction rate scales as a power law with the scaling exponent 0.66 at early time regime while it scales with -0.50 at long time regime, in all four cases of the added probability $p=0.2-0.8$. Especially, our result presented is compared with the numerical calculation of regular networks.
We investigate analytically and numerically the critical line in undirected random Boolean networks with arbitrary degree distributions, including scale-free topology of connections $P(k)sim k^{-gamma}$. We show that in infinite scale-free networks the transition between frozen and chaotic phase occurs for $3<gamma < 3.5$. The observation is interesting for two reasons. First, since most of critical phenomena in scale-free networks reveal their non-trivial character for $gamma<3$, the position of the critical line in Kauffman model seems to be an important exception from the rule. Second, since gene regulatory networks are characterized by scale-free topology with $gamma<3$, the observation that in finite-size networks the mentioned transition moves towards smaller $gamma$ is an argument for Kauffman model as a good starting point to model real systems. We also explain that the unattainability of the critical line in numerical simulations of classical random graphs is due to percolation phenomena.
Scale-free networks with topology-dependent interactions are studied. It is shown that the universality classes of critical behavior, which conventionally depend only on topology, can also be explored by tuning the interactions. A mapping, $gamma = (gamma - mu)/(1-mu)$, describes how a shift of the standard exponent $gamma$ of the degree distribution $P(q)$ can absorb the effect of degree-dependent pair interactions $J_{ij} propto (q_iq_j)^{-mu}$. Replica technique, cavity method and Monte Carlo simulation support the physical picture suggested by Landau theory for the critical exponents and by the Bethe-Peierls approximation for the critical temperature. The equivalence of topology and interaction holds for equilibrium and non-equilibrium systems, and is illustrated with interdisciplinary applications.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
