In this paper, we propose a family of nested weighted n-polygon networks, which is a kind of
promotion of infinite fractal dimension networks. We study the coherence of the networks …

In this paper, we first study the first-order network coherence, characterized by the entire
mean first-passage time (EMFPT) for weight-dependent walk, on the weighted Cayley …

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 …

This paper investigates consensus dynamics in a dynamical system with additive stochastic
disturbances that is characterized as network coherence by using the Laplacian spectrum …

The study on network coherence and eigentime identity has gained much interest. In this
paper, the first-order network coherence is characterized by the entire mean first-passage …

In this paper, we study the trap** time in the weighted pseudofractal scale-free networks
(WPSFNs) and the average shortest weighted path in the modified weighted pseudofractal …

In this paper, we study the trap** problem in the weighted scale-free triangulation
networks with the growth factor m and the weight factor r. We propose two biased walks, one …

Complex networks have elicited considerable attention from scientific communities. This
paper investigates consensus dynamics in a linear dynamical system with additive …

In recent years, weighted networks have been extensively studied in various fields. This
paper studies characteristic polynomial of adjacency or Laplacian matrix for weighted …

Recently, corona product graphs have attracted a great deal of attention from scientific
communities, such as coding theory, frequency assignment, mathematical chemistry …