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}
}
  • Ido Tishby, O. Biham, E. Katzav
  • Published 2016
  • Physics, Mathematics
  • Journal of Physics A
  • 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
    15 Citations
    Self-avoiding walks and connective constants in clustered scale-free networks.
    • 2
    • PDF
    Self-Avoiding Pruning Random Walk on Signed Network
    • 4
    • PDF
    Distribution of shortest path lengths in subcritical Erdős-Rényi networks.
    • 10
    • PDF
    Unsolved Lattice Path Problems in Computational Science II
    Knowledge acquisition: A Complex networks approach
    • 32
    • PDF

    References

    SHOWING 1-10 OF 46 REFERENCES
    Self-avoiding walks on scale-free networks.
    • C. Herrero
    • Medicine, Physics
    • Physical review. E, Statistical, nonlinear, and soft matter physics
    • 2005
    • 55
    • PDF
    Self-avoiding walks and connective constants in small-world networks.
    • 20
    • PDF
    Kinetic growth walks on complex networks
    • 8
    • PDF
    Exploring complex networks through random walks.
    • L. Costa, G. Travieso
    • Physics, Mathematics
    • Physical review. E, Statistical, nonlinear, and soft matter physics
    • 2007
    • 63
    • PDF
    Effective number of accessed nodes in complex networks.
    • 25
    • PDF