2000 character limit reached
Maximum eigenvalue of symmetric random matrices with dependent heavy tailed entries
Published 5 Sep 2013 in math.PR | (1309.1407v2)
Abstract: This paper deals with symmetric random matrices whose upper diagonal entries are obtained from a linear random field with heavy tailed noise. It is shown that the maximum eigenvalue and the spectral radius of such a random matrix with dependent entries converge to the Frech\'et distribution after appropriate scaling. This extends a seminal result of Soshnikov(2004) when the tail index is strictly less than one.
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.