Path counting on simple graphs: from escape to localization

We study the asymptotic behavior of the number of paths of length N on several classes of infinite graphs with a single special vertex. This vertex can work as an 'entropic trap' for the path, i.e. under certain conditions the dominant part of long paths becomes localized in the vicinity o...

Full description

Saved in:
Bibliographic Details
Published inJournal of statistical mechanics Vol. 2017; no. 5; pp. 53301 - 53317
Main Authors Nechaev, S K, Tamm, M V, Valba, O V
Format Journal Article
LanguageEnglish
Published IOP Publishing and SISSA 08.05.2017
Online AccessGet full text

Cover

More Information
Summary:We study the asymptotic behavior of the number of paths of length N on several classes of infinite graphs with a single special vertex. This vertex can work as an 'entropic trap' for the path, i.e. under certain conditions the dominant part of long paths becomes localized in the vicinity of the special point instead of spreading to infinity. We study the conditions for such localization on decorated star graphs, regular trees and regular hyperbolic graphs as a function of the functionality of the special vertex. In all cases the localization occurs for large enough functionality. The particular value of the transition point depends on the large-scale topology of the graph. The emergence of localization is supported by analysis of the spectra of the adjacency matrices of corresponding finite graphs.
Bibliography:JSTAT_053P_0117
ISSN:1742-5468
1742-5468
DOI:10.1088/1742-5468/aa680a