A model of self-avoiding random walks for searching complex networks (Q4648693)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6107803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A model of self-avoiding random walks for searching complex networks |
scientific article; zbMATH DE number 6107803 |
Statements
A model of self‐avoiding random walks for searching complex networks (English)
0 references
15 November 2012
0 references
self-avoiding random walk
0 references
random walk
0 references
network search
0 references
resource location
0 references
one-hop replication
0 references
average search length
0 references
0 references
0.7825817465782166
0 references
0.7703238129615784
0 references
0.7674009799957275
0 references
0.7423583269119263
0 references
0.7372316718101501
0 references
