Diffusion-annihilation proecesses in weighted scale-free networks with identical degree sequence

Abstract

The studies based on $A+A\to \varnothing$ and $A+B\to \varnothing$ 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 don't suffice to characterize the diffusion-annihilation processes on weighted scale-free networks.

15 pages, 10 figures

References in corpus (8)

• Applications of Field-Theoretic Renormalization Group Methods to Reaction-Diffusion Problems
• Fractal and Transfractal Recursive Scale-Free Nets
• Global mean first-passage times of random walks on complex networks
• Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence
• Diffusive Capture Process on Complex Networks
• Different thresholds of bond percolation in scale-free networks with identical degree sequence
• Diffusive capture processes for information search
• Random Walks on Complex Networks

Cited by in corpus (4)

• Random walks on weighted networks
• Random walks in weighted networks with a perfect trap: An application of Laplacian spectra
• Mean encounter times for multiple random walkers on networks
• Optimal exploration of random walks with local bias on networks