Random walks on complex trees

We study the properties of random walks on complex trees. We observe that the absence of loops is reflected in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present...

Descripción completa

Detalles Bibliográficos
Autores: Baronchelli, Andrea, Catanzaro, Michele, Pastor Satorras, Romualdo|||0000-0002-4051-6007
Tipo de recurso: artículo
Fecha de publicación:2008
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/125850
Acceso en línea:https://hdl.handle.net/2117/125850
https://dx.doi.org/10.1103/PhysRevE.78.011114
Access Level:acceso abierto
Palabra clave:Random walks (Mathematics)
Random walks
Complex trees
Rutes aleatòries (Matemàtica)
Àrees temàtiques de la UPC::Física
Descripción
Sumario:We study the properties of random walks on complex trees. We observe that the absence of loops is reflected in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present a considerable slowing down in the tree case. Second, the mean first passage time (MFPT) displays a logarithmic degree dependence, in contrast to the inverse degree shape exhibited in looped networks. This deviation can be ascribed to the dominance of source-target topological distance in trees. To show this, we study the distance dependence of a symmetrized MFPT and derive its logarithmic profile, obtaining good agreement with simulation results. These unique properties shed light on the recently reported anomalies observed in diffusive dynamical systems on trees.