Eigentime identities for random walks on a family of treelike networks and polymer networks

DOI10.1016/j.physa.2017.04.172zbMath1499.82051MaRDI QIDQ2147741

Meifeng Dai, Yu Sun, Yanqiu Sun, Xiao Qian Wang, Wei Yi Su

Publication date: 20 June 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2017.04.172

zbMATH Keywords

eigentime identity; normalized Laplacian spectrum; polymer network; treelike networks

Mathematics Subject Classification ID

82D60: Statistical mechanics of polymers

05C81: Random walks on graphs

35R02: PDEs on graphs and networks (ramified or polygonal spaces)

Related Items

EIGENTIME IDENTITIES OF FRACTAL FLOWER NETWORKS, MULTIPLE REPRESENTATIONS OF REAL NUMBERS ON SELF-SIMILAR SETS WITH OVERLAPS, CONSENSUS PROBLEMS IN WEIGHTED HIERARCHICAL GRAPHS, ARITHMETIC ON MORAN SETS, EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS, SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS, SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS, Eigenvalues of transition weight matrix for a family of weighted networks, Spectral analysis for a family of treelike networks, Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk, Eigentime identities of fractal sailboat networks, Eigentime identities of flower networks with multiple branches, Eigentime identities of potting networks

Cites Work

• Average weighted receiving time on the non-homogeneous double-weighted fractal networks
• The modified box dimension and average weighted receiving time of the weighted hierarchical graph
• Average weighted trapping time of the node- and edge-weighted fractal networks
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS