# Simple reaction-diffusion population model on scale-free networks.

@article{Wu2008SimpleRP, title={Simple reaction-diffusion population model on scale-free networks.}, author={A. C. Wu and Xin-Jian Xu and Jos{\'e} F. F. Mendes and Yinghai Wang}, journal={Physical review. E, Statistical, nonlinear, and soft matter physics}, year={2008}, volume={78 4 Pt 2}, pages={ 047101 } }

We study a simple reaction-diffusion population model [proposed by A. Windus and H. J. Jensen, J. Phys. A: Math. Theor. 40, 2287 (2007)] on scale-free networks. In the case of fully random diffusion, the network topology cannot affect the critical death rate, whereas the heterogeneous connectivity can cause smaller steady population density and critical population density. In the case of modified diffusion, we obtain a larger critical death rate and steady population density, at the meanwhile…

## 2 Citations

### Percolation of Mobile Individuals on Weighted Scale-Free Networks

- Computer Science
- 2011

The percolation-like phase transition of mobile individuals is studied on weighted scale-free (WSF) networks, in which the maximum occupancy at each node is one individual (i.e. hard core…

### Optimal dispersal in ecological dynamics with Allee effect in metapopulations

- MathematicsPloS one
- 2019

A minimal agent-based model is introduced to understand the effects of the interplay between dispersal and geometric constraints in metapopulation dynamics under the Allee Effect and indicates the existence of a survival-extinction boundary with monotonic behavior for weak spatial constraints and a nonmonotonic behaviors for strong spatial constraints.

## References

SHOWING 1-10 OF 57 REFERENCES

### Epidemic dynamics and endemic states in complex networks.

- MathematicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2001

A dynamical model for the spreading of epidemics in complex networks that implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess.

### Scale-free and stable structures in complex ad hoc networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2004

The dynamics reported in this paper can be used to craft protocols for designing highly dynamic peer-to-peer networks and also to account for the power-law exponents observed in existing popular services.

### Emergence of scaling in random networks

- Computer ScienceScience
- 1999

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

### Biology helps to construct weighted scale free networks

- Computer Science
- 2004

A simple evolutionary model of bipartite networks whose evolution is based on the duplication of nodes is studied, and it is shown that the above evolutionary model results in weighted scale-free networks.

### Scaling properties of scale-free evolving networks: continuous approach.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2001

It is shown that permanent random damage to a growing scale-free network-a permanent deletion of some links-radically changes the values of the scaling exponents, and the limits of their validity are indicated.

### Self-organization of collaboration networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2004

A model of a growing network, which combines preferential edge attachment with the bipartite structure, generic for collaboration networks is proposed, which depends exclusively on basic properties of the network, such as the total number of collaborators and acts of collaboration, the mean size of collaborations, etc.

### Exact solutions for models of evolving networks with addition and deletion of nodes.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2006

Here models of the time evolution of networks that grow by the addition of vertices and so-called preferential attachment are formulated and it is conjecture that the low exponent values observed in real-world networks are the result of vigorous growth, which far exceeds the rate of removal.

### Resilience of the internet to random breakdowns

- Computer SciencePhysical review letters
- 2000

This work shows analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite, and finds that the physical structure of the Internet is impressively robust, with p(c)>0.99.

### Immunization of complex networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2002

It is shown that the random uniform immunization of individuals does not lead to the eradication of infections in all complex networks, and networks with scale-free properties do not acquire global immunity from major epidemic outbreaks even in the presence of unrealistically high densities of randomly immunized individuals.