Spectral analysis of dynamically evolving networks with linear preferential attachment

Authors:
Victor M. Preciado;Ali Jadbabaie
Affiliations:
Department of Electrical and Systems Engineering, University of Pennsylvania;Department of Electrical and Systems Engineering, University of Pennsylvania
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 4
Cited 0

The degree sequence of a scale-free random graph process

Random Structures & Algorithms
Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics)

Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics)
Spectral analysis of stochastic models of large-scale complex dynamical networks

Spectral analysis of stochastic models of large-scale complex dynamical networks
The web as a graph: measurements, models, and methods

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper is devoted to study the eigenvalues of the adjacency matrix for the random graph process proposed by Barabási and Albert in [2]. While many structural characteristics of the Barabási Albert (BA) process are well known, analytical results concerning its spectral properties are still an open question. In this paper, we present new results regarding the distribution of eigenvalues of the adjacency matrix associated to this random graph model. In particular, we derive closed-form expressions for the spectral moments of the adjacency matrix and study the evolution of the spectral moments as the network grows. Based on our results, we extract information regarding the evolution of the spectral radius of the adjacency matrix as the network grows.