Network Growth From Global and Local Influential Nodes

by   Jiaojiao Jiang, et al.

In graph theory and network analysis, node degree is defined as a simple but powerful centrality to measure the local influence of node in a complex network. Preferential attachment based on node degree has been widely adopted for modeling network growth. However, many evidences exist which show deviation of real network growth from what a pure degree-based model suggests. It seems that node degree is not a reliable measure for predicting the preference of newcomers in attaching to the network, or at least, it does not tell the whole story. In this paper, we argue that there is another dimension to network growth, one that we call node "coreness". The new dimension gives insights on the global influence of nodes, in comparison to the local view the degree metric provides. We found that the probability of existing nodes attracting new nodes generally follows an exponential dependence on node coreness, while at the same time, follows a power-law dependence on node degree. That is to say, high-coreness nodes are more powerful than high-degree nodes in attracting newcomers. The new dimension further discloses some hidden phenomena which happen in the process of network growth. The power of node degree in attracting newcomers increases over time while the influence of coreness decreases, and finally, they reach a state of equilibrium in the growth. All these theories have been tested on real-world networks.


page 2

page 4

page 5

page 6

page 7

page 8

page 9

page 10


Dynamics of node influence in network growth models

Many classes of network growth models have been proposed in the literatu...

On the Growth of Lebesgue Constants for Degree One Fekete Points in terms of the Dimension

We discuss the growth of the Lebesgue constants for polynomial interpola...

A Statistical Physics Perspective on Web Growth

Approaches from statistical physics are applied to investigate the struc...

Network connectivity under a probabilistic node failure model

Centrality metrics have been widely applied to identify the nodes in a g...

Degree-preserving graph dynamics – a versatile process to construct random networks

Real-world networks evolve over time via additions or removals of nodes ...

Time-invariant degree growth in preferential attachment network models

Preferential attachment drives the evolution of many complex networks. I...

Online Influence Maximization with Local Observations

We consider an online influence maximization problem in which a decision...

Please sign up or login with your details

Forgot password? Click here to reset