2000 character limit reached
On the localization transition in symmetric random matrices
Published 20 May 2010 in cond-mat.dis-nn and cond-mat.stat-mech | (1005.3712v3)
Abstract: We study the behaviour of the inverse participation ratio and the localization transition in infinitely large random matrices through the cavity method. Results are shown for two ensembles of random matrices: Laplacian matrices on sparse random graphs and fully-connected L\'evy matrices. We derive a critical line separating localized from extended states in the case of L\'evy matrices. Comparison between theoretical results and diagonalization of finite random matrices is shown.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.