Random walks are ubiquitous in the sciences, and they are interesting from both theoretical
and practical perspectives. They are one of the most fundamental types of stochastic …

We present a general theory which allows one to accurately evaluate the mean first-passage
time (FPT) for regular random walks in bounded domains, and its extensions to related first …

With the rapid development of complex network science and the complexity of
communication network, it is difficult to research its technical application. In order to solve …

We consider first-and second-order consensus algorithms in networks with stochastic
disturbances. We quantify the deviation from consensus using the notion of network …

Fractal generally has self-similarity. Using the self-similarity of fractal, we can obtain some
important theories about complex networks. In this paper, we concern the Vicsek fractal in …

The eigenvalues of the normalized Laplacian matrix of a network play an important role in its
structural and dynamical aspects associated with the network. In this paper, we study the …

Relatively general techniques for computing mean first-passage time (MFPT) of random
walks on networks with a specific property are very useful since a universal method for …

Kemeny's constant and its relation to the effective graph resistance has been established for
regular graphs by Palacios et al.[1]. Based on the Moore–Penrose pseudo-inverse of the …

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

The pseudofractal scale-free web (PSFW) is a well-known model for a scale-free network
with small-world characteristics. Understanding the dynamic properties of this network can …