Concentration of Small world-Networks and application of spectral algorithms
Main Article Content
Abstract
Recent researches on statistical network analysis has strongly included the random matrix theory. The principal goal of random matrix theory is to provide a knowledge of many properties of matrices such as the statistics of matrix eigenvalues with elements taken randomly from various probability distributions. In this paper, we present some results on the concentration of the adjacency and laplacian matrices around the expectation under the small-world network. We also present some relevant network model that may be of interest to probabilists looking for new directions in random matrix theory as well as random matrix theory tools that may be of interest to statistician looking to verify the features of network algorithm. Application of some results to the community detection problem are discussed
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
