# The distribution of path lengths of self avoiding walks on Erdős–Rényi networks

@article{Tishby2016TheDO, title={The distribution of path lengths of self avoiding walks on Erdős–R{\'e}nyi networks}, author={Ido Tishby and O. Biham and E. Katzav}, journal={Journal of Physics A}, year={2016}, volume={49}, pages={285002} }

We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit, together with their links, thus pruning the network. The walkers hop between neighboring nodes, until they reach a dead-end node from which they cannot proceed. Focusing on Erdős–Renyi networks we show that the pruned networks maintain a Poisson degree distribution, , with an average degree, , that… CONTINUE READING

#### Figures from this paper.

15 Citations

The distribution of first hitting times of random walks on directed Erdős–Rényi networks

- Physics, Mathematics
- 2017

5- PDF

The distribution of first hitting times of randomwalks on Erdős–Rényi networks

- Mathematics, Physics
- 2017

6- PDF

The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks

- Mathematics, Physics
- 2017

1- PDF

Self-avoiding walks and connective constants in clustered scale-free networks.

- Physics, Medicine
- Physical review. E
- 2019

2- PDF

Distribution of shortest path lengths in subcritical Erdős-Rényi networks.

- Mathematics, Physics
- Physical review. E
- 2018

10- PDF

A new method for quantifying network cyclic structure to improve community detection

- Computer Science, Mathematics
- ArXiv
- 2019

Revealing the microstructure of the giant component in random graph ensembles.

- Mathematics, Physics
- Physical review. E
- 2018

12- PDF

Unsolved Lattice Path Problems in Computational Science II

- 2018 International Conference on Computational Science and Computational Intelligence (CSCI)
- 2018

#### References

SHOWING 1-10 OF 46 REFERENCES

Analytical results for the distribution of shortest path lengths in random networks

- Mathematics, Physics
- 2015

19- PDF

Self-avoiding walks on scale-free networks.

- Medicine, Physics
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2005

55- PDF

Self-avoiding walks and connective constants in small-world networks.

- Medicine, Physics
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2003

20- PDF

A model of self-avoiding random walks for searching complex networks

- Computer Science
- Networks
- 2012

18- PDF

Exploring complex networks through random walks.

- Physics, Mathematics
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2007

63- PDF

Effective number of accessed nodes in complex networks.

- Mathematics, Medicine
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2012

25- PDF