We present a general framework, applicable to a broad class of random walks on complex
networks, which provides a rigorous lower bound for the mean first-passage time of a …

Complex networks have attracted much attention in diverse areas of science and
technology. Multifractal analysis (MFA) is a useful way to systematically describe the spatial …

In this paper, by using two different techniques we derive an explicit formula for the mean
first-passage time (MFPT) between any pair of nodes on a general undirected network …

The family of Vicsek fractals is one of the most important and frequently studied regular
fractal classes, and it is of considerable interest to understand the dynamical processes on …

Spanning trees provide crucial insight into the origin of fractality in fractal scale-free
networks. In this paper, we present the number of spanning trees in a particular fractal scale …

In this paper we define a new class of weighted complex networks sharing several
properties with fractal sets, and whose topology can be completely analytically characterized …

In this work, we study the fractal and multifractal properties of a family of fractal networks
introduced by Gallos et al (2007 Proc. Nat. Acad. Sci. USA 104 7746). In this fractal network …

We study the impact of the distance between two hubs on network coherence defined by
Laplacian eigenvalues. Network coherence is a measure of the extent of consensus in a …

In this paper, we introduce a model of the double-weighted Koch networks based on actual
road networks depending on the two weight factors w, r∈(0, 1]. The double weights …

Dendrimers and regular hyperbranched polymers are two classic families of
macromolecules, which can be modeled by Cayley trees and Vicsek fractals, respectively. In …