Fat-tailed distribution derived from the first eigenvector of a symmetric random sparse matrix

From MaRDI portal
Publication:5404772

DOI10.1088/1751-8113/47/6/065003zbMATH Open1292.60009arXiv1212.4381OpenAlexW2021524263MaRDI QIDQ5404772FDOQ5404772


Authors: Hisanao Takahashi Edit this on Wikidata


Publication date: 28 March 2014

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: Many solutions for scientific problems rely on finding the first (largest) eigenvalue and eigenvector of a particular matrix. We explore the distribution of the first eigenvector of a symmetric random sparse matrix. To analyze the properties of the first eigenvalue/vector, we employ a methodology based on the cavity method, a well-established technique in the statistical physics. A symmetric random sparse matrix in this paper can be regarded as an adjacency matrix for a network. We show that if a network is constructed by nodes that have two different types of degrees then the distribution of its eigenvector has fat tails such as the stable distribution (alpha<2) under a certain condition; whereas if a network is constructed with nodes that have only one type of degree, the distribution of its first eigenvector becomes the Gaussian approximately. The cavity method is used to clarify these results.


Full work available at URL: https://arxiv.org/abs/1212.4381




Recommendations





Cited In (1)





This page was built for publication: Fat-tailed distribution derived from the first eigenvector of a symmetric random sparse matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404772)