{"title":"Erdős-Rényi图的完全离域区域","authors":"Johannes Alt, Raphael Ducatez, A. Knowles","doi":"10.1214/22-ecp450","DOIUrl":null,"url":null,"abstract":"We analyse the eigenvectors of the adjacency matrix of the Erdős-Rényi graph on N vertices with edge probability d N . We determine the full region of delocalization by determining the critical values of d log N down to which delocalization persists: for d log N > 1 log 4−1 all eigenvectors are completely delocalized, and for d log N > 1 all eigenvectors with eigenvalues away from the spectral edges are completely delocalized. Below these critical values, it is known [1, 3] that localized eigenvectors exist in the corresponding spectral regions.","PeriodicalId":50543,"journal":{"name":"Electronic Communications in Probability","volume":" ","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The completely delocalized region of the Erdős-Rényi graph\",\"authors\":\"Johannes Alt, Raphael Ducatez, A. Knowles\",\"doi\":\"10.1214/22-ecp450\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyse the eigenvectors of the adjacency matrix of the Erdős-Rényi graph on N vertices with edge probability d N . We determine the full region of delocalization by determining the critical values of d log N down to which delocalization persists: for d log N > 1 log 4−1 all eigenvectors are completely delocalized, and for d log N > 1 all eigenvectors with eigenvalues away from the spectral edges are completely delocalized. Below these critical values, it is known [1, 3] that localized eigenvectors exist in the corresponding spectral regions.\",\"PeriodicalId\":50543,\"journal\":{\"name\":\"Electronic Communications in Probability\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Communications in Probability\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1214/22-ecp450\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Communications in Probability","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1214/22-ecp450","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 4
摘要
我们分析了Erdős-Rényi图在N个顶点上的邻接矩阵的特征向量,边缘概率为d N。我们通过确定d log N的临界值来确定脱域的整个区域:对于d log N > 1 log 4−1,所有特征向量都是完全脱域的,对于d log N > 1,所有特征值远离谱边的特征向量都是完全脱域的。在这些临界值以下,我们知道[1,3]在相应的光谱区域存在局域特征向量。
The completely delocalized region of the Erdős-Rényi graph
We analyse the eigenvectors of the adjacency matrix of the Erdős-Rényi graph on N vertices with edge probability d N . We determine the full region of delocalization by determining the critical values of d log N down to which delocalization persists: for d log N > 1 log 4−1 all eigenvectors are completely delocalized, and for d log N > 1 all eigenvectors with eigenvalues away from the spectral edges are completely delocalized. Below these critical values, it is known [1, 3] that localized eigenvectors exist in the corresponding spectral regions.
期刊介绍:
The Electronic Communications in Probability (ECP) publishes short research articles in probability theory. Its sister journal, the Electronic Journal of Probability (EJP), publishes full-length articles in probability theory. Short papers, those less than 12 pages, should be submitted to ECP first. EJP and ECP share the same editorial board, but with different Editors in Chief.