Evolving hypernetwork model
JW Wang, LL Rong, QH Deng, JY Zhang - The European Physical Journal …, 2010 - Springer
Complex hypernetworks are ubiquitous in real-life systems. While a substantial body of
previous research has only focused on the applications of hypernetworks, relatively little …
previous research has only focused on the applications of hypernetworks, relatively little …
Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
A vast variety of real-life networks display the ubiquitous presence of scale-free
phenomenon and small-world effect, both of which play a significant role in the dynamical …
phenomenon and small-world effect, both of which play a significant role in the dynamical …
Maximal planar scale-free Sierpinski networks with small-world effect and power law strength-degree correlation
Many real networks share three generic properties: they are scale-free, display a small-
world effect, and show a power law strength-degree correlation. In this paper, we propose a …
world effect, and show a power law strength-degree correlation. In this paper, we propose a …
[HTML][HTML] The number of spanning trees in Apollonian networks
In this paper we find an exact analytical expression for the number of spanning trees in
Apollonian networks. This parameter can be related to significant topological and dynamic …
Apollonian networks. This parameter can be related to significant topological and dynamic …
Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
In this paper, firstly, we study analytically the topological features of a family of hierarchical
lattices (HLs) from the view point of complex networks. We derive some basic properties of …
lattices (HLs) from the view point of complex networks. We derive some basic properties of …
A general geometric growth model for pseudofractal scale-free web
We propose a general geometric growth model for pseudofractal scale-free web (PSW),
which is controlled by two tunable parameters. We derive exactly the main characteristics of …
which is controlled by two tunable parameters. We derive exactly the main characteristics of …
Low-mean hitting time for random walks on heterogeneous networks
Y Sheng, Z Zhang - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
Mean hitting time for random walks on a network, defined as the average of hitting times
over all possible pairs of nodes, has found a large variety of applications in many areas. In …
over all possible pairs of nodes, has found a large variety of applications in many areas. In …
Scaling of the average receiving time on a family of weighted hierarchical networks
Y Sun, M Dai, Y Sun, S Shao - Fractals, 2016 - World Scientific
In this paper, based on the un-weight hierarchical networks, a family of weighted
hierarchical networks are introduced, the weight factor is denoted by r. The weighted …
hierarchical networks are introduced, the weight factor is denoted by r. The weighted …
Dynamical models for random simplicial complexes
N Fountoulakis, T Iyer, C Mailler… - The Annals of Applied …, 2022 - projecteuclid.org
We study a general model of random dynamical simplicial complexes and derive a formula
for the asymptotic degree distribution. This asymptotic formula generalises results for a …
for the asymptotic degree distribution. This asymptotic formula generalises results for a …