Eigenvalue Preferential Attachment Networks A Dandelion Structure

Abstract

In this paper we introduce a new type of preferential attachment network, the growth of which is based on the eigenvalue centrality. In this network, the agents attach most probably to the nodes with larger eigenvalue centrality which represents that the agent has stronger connections. A new network is presented, namely a dandelion network, which shares some properties of star-like structure and also a hierarchical network. We show that this network, having hub-and-spoke topology is not generally scale free, and shows essential differences with respect to the Barab{á}si-Albert preferential attachment model. Most importantly, there is a super hub agent in the system (identified by a pronounced peak in the spectrum), and the other agents are classified in terms of the distance to this super-hub. We explore a plenty of statistical centralities like the nodes degree, the betweenness and the eigenvalue centrality, along with various measures of structure like the community and hierarchical structures, and the clustering coefficient. Global measures like the shortest path statistics and the self-similarity are also examined.

arXiv comment15 pages, 16 figures

References in corpus (27)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Finding and evaluating community structure in networks
• An index to quantify an individual's scientific research output
• Assortative mixing in networks
• The diameter of the world wide web
• Evolution of networks
• Mixing patterns in networks
• Characterization of complex networks: A survey of measurements
• Mean-field theory for scale-free random networks
• Hierarchical Organization in Complex Networks
• Clustering and preferential attachment in growing networks
• Subgraph Centrality in Complex Networks
• Measuring preferential attachment for evolving networks
• Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
• Average path length in random networks
• Average path length in uncorrelated random networks with hidden variables
• Preferential attachment in the growth of social networks: the case of Wikipedia
• Preferential attachment in the protein network evolution
• The International Trade Network: weighted network analysis and modelling
• Preferential attachment growth model and nonextensive statistical mechanics
• Small-world networks and the conformation space of a lattice polymer chain
• A box-covering algorithm for fractal scaling in scale-free networks
• A general model for collaboration networks
• The configuration model for Barabasi-Albert networks
• Comparative Analysis of Box-Covering Algorithms for Fractal Networks
• Role of dimensionality in preferential attachment growth in the Bianconi-Barabási model