Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks

DOI10.1063/1.3094757zbMath1202.82071arXiv0809.2384OpenAlexW2003563767WikidataQ91630604 ScholiaQ91630604MaRDI QIDQ3650485

Jihong Guan, Yichao Zhang, Ming Yin, Zhong-Zhi Zhang, Shuigeng Zhou

Publication date: 14 December 2009

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.2384

zbMATH Keywords

random processescomplex networks

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Circuits, networks (94C99) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41) Dynamics of disordered systems (random Ising systems, etc.) in time-dependent statistical mechanics (82C44)

Related Items (7)

Generalized adjacency and Laplacian spectra of the weighted corona graphs ⋮ AVERAGE FERMAT DISTANCES ON VICSEK NETWORKS ⋮ Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks ⋮ AVERAGE FERMAT DISTANCE OF A PSEUDO-FRACTAL HIERARCHICAL SCALE-FREE NETWORK ⋮ Efficiency of transportation on weighted extended Koch networks ⋮ From first-passage times of random walks in confinement to geometry-controlled kinetics ⋮ Scaling of average sending time on weighted Koch networks

Cites Work

• Recursive weighted treelike networks
• Complex networks: structure and dynamics
• Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• First-passage properties of the Erdos–Renyi random graph
• Collective dynamics of ‘small-world’ networks
• The average distances in random graphs with given expected degrees

This page was built for publication: Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks