Deterministic walks in random networks: An application to thesaurus graphs (Q1848192): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: cond-mat/0110217 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exploring complex networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Further travels with my ant / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Collective dynamics of ‘small-world’ networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reflexive Nearest Neighbours / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The stochastic traveling salesman problem: finite size scaling and the cavity prediction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relaxation, closing probabilities and transition from oscillatory to chaotic attractors in asymmetric neural networks / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3103134973 / rank | |||
Normal rank | |||
Latest revision as of 10:50, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic walks in random networks: An application to thesaurus graphs |
scientific article |
Statements
Deterministic walks in random networks: An application to thesaurus graphs (English)
0 references
19 November 2002
0 references
randomly distributed Euclidean-space sites
0 references
trajectories
0 references
final cyclic attractor
0 references
0 references
