相关论文: Highly clustered scale-free networks

In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small world effect. While the average shortest path length increases…

In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…

Many complex systems--from social and communication networks to biological networks and the Internet--are thought to exhibit scale-free structure. However, prevailing explanations rely on the constant addition of new nodes, an assumption…

Network growth is currently explained through mechanisms that rely on node prestige measures, such as degree or fitness. In many real networks those who create and connect nodes do not know the prestige values of existing nodes, but only…

Recently there have been a tremendous interest in models of networks with a power-law distribution of degree -- so called "scale-free networks." It has been observed that such networks, normally, have extremely short path-lengths, scaling…

Scaling behavior of scale-free evolving networks arising in communications, citations, collaborations, etc. areas is studied. We derive universal scaling relations describing properties of such networks and indicate limits of their…

Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…

Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…

Hierarchical networks actually have many applications in the real world. Firstly, we propose a new class of hierarchical networks with scale-free and fractal structure, which are the networks with triangles compared to traditional…

We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the…

The linear preferential attachment hypothesis has been shown to be quite successful to explain the existence of networks with power-law degree distributions. It is then quite important to determine if this mechanism is the consequence of a…

We show that not only preferential attachment but also preferential depletion leads to scale-free networks. The resulting degree distribution exponents is typically less than two (5/3) as opposed to the case of the growth models studied…

One of the main characteristics of real-world networks is their large clustering. Clustering is one aspect of a more general but much less studied structural organization of networks, i.e. edge multiplicity, defined as the number of…

Many realistic networks are scale-free, with small characteristic path lengths, high clustering, and power law in their degree distribution. They can be obtained by dynamical networks in which a preferential attachment process takes place.…

Connectivity correlations play an important role in the structure of scale-free networks. While several empirical studies exist, there is no general theoretical analysis that can explain the largely varying behavior of real networks. Here,…

Many real-world scale-free networks, such as neural networks and online communication networks, consist of a fixed number of nodes but exhibit dynamic edge fluctuations. However, traditional models frequently overlook scenarios where the…

We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several variants of the walk algorithm and for a wide range of…

Many real-world networks have properties of small-world networks, with clustered local neighborhoods and low average-shortest path (ASP). They may also show a scale-free degree distribution, which can be generated by growth and preferential…

Research in network science has shown that many naturally occurring and technologically constructed networks are scale free, that means a power law degree distribution emerges from a growth model in which each new node attaches to the…

Many real networks have cliques as their constitutional units. Here we present a family of scale-free network model consist of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and…