Deterministic walks in random networks: An application to thesaurus graphs
From MaRDI portal
Publication:1848192
DOI10.1016/S0378-4371(02)00972-XzbMath1001.60106arXivcond-mat/0110217OpenAlexW3103134973MaRDI QIDQ1848192
Publication date: 19 November 2002
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0110217
Related Items
Texture analysis and classification using deterministic tourist walk, Complex networks: structure and dynamics, Complex network classification using partially self-avoiding deterministic walks, Accessibility in complex networks
Cites Work
- The stochastic traveling salesman problem: finite size scaling and the cavity prediction
- Further travels with my ant
- Reflexive Nearest Neighbours
- Relaxation, closing probabilities and transition from oscillatory to chaotic attractors in asymmetric neural networks
- Collective dynamics of ‘small-world’ networks
- Exploring complex networks