What is Special about Diffusion on Scale-Free Nets?
| dc.creator | Bollt, Erik M. | |
| dc.creator | ben-Avraham, Daniel | |
| dc.date | 2004-09-17 | |
| dc.date | 2004-10-19 | |
| dc.date.accessioned | 2026-07-07T03:00:53Z | |
| dc.date.available | 2026-07-07T03:00:53Z | |
| dc.description | We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways in which diffusion in scale-free graphs is special. Most notably, scale-free architecture results in a faster transit time between existing nodes, when the network grows in size; and walks emanating from the most connected nodes are recurrent, despite the network's infinite dimension. We also find that other attributes of the graph, besides its scale-free distribution, have a strong influence on the nature of diffusion. | |
| dc.description | References added | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0409465 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0409465 | |
| dc.identifier | New J. Phys. 7, 26 (2005) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/24893 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | What is Special about Diffusion on Scale-Free Nets? | |
| dc.type | text |