Structural properties of the scale-free Barabasi-Albert graph

Authors:
V. N. Zadorozhnyi;E. B. Yudin
Affiliations:
Omsk State University, Omsk, Russia;Omsk State University, Omsk, Russia
Venue:
Automation and Remote Control
Year:
2012

Citing 2
Cited 0

Power-Law Distributions in Empirical Data

SIAM Review
Kronecker Graphs: An Approach to Modeling Networks

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consideration was given to the scale-free Barabasi-Albert graph describing large network structures of the Internet type. A fundamental graph matrix describing precisely the properties of the randomly selected edges was introduced and examined. The formula of the clustering coefficient was derived, and a method for its separable adjustment was proposed which does not affect the distribution of the local connectivity of vertices.