pith. sign in

arxiv: cond-mat/0409465 · v2 · submitted 2004-09-17 · ❄️ cond-mat.dis-nn

What is Special about Diffusion on Scale-Free Nets?

classification ❄️ cond-mat.dis-nn
keywords scale-freediffusiongraphsnetworknodesotherresultsspecial
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.