We prove a non-lattice local central limit theorem and Edgeworth expansions for the logarithm of the norms of products of invertible independent random matrices. Our conditions include a contraction assumption, an assumption that supports of the matrices are ``large enough"and their distributions are sufficiently regular. As a byproduct of the proof we are also able to provide a different proof to the optimal rates in the CLT proved in \cite{MatBE}. Like in \cite{MatBE} we provide several sufficient conditions for contraction.
We prove an optimal Hardy inequality for every aperiodic, symmetric random walk in $\mathbb{Z}^2$ with finite variance. In particular, we verify null-criticality, and thus, optimality of the underlying Hardy weight. Under suitable moment conditions, we use fine asymptotics of the potential kernel due to Fukai and Uchiy...
Philipp Hake, Matthias Keller, Felix Pogorzelski· 0 citations
Recent work of the author investigates certain random processes, valued in abelian p-groups, that naturally arise in the study of Haar random matrices over $\mathbb{Z}_p$. It was found, somewhat surprisingly, that these processes are reversible Markov chains. In this short note, we give a simple alternative derivation...
We prove an annealed central limit theorem for the weight of the maximum weight matching on uniformly random simple graphs with prescribed, uniformly bounded degrees and i.i.d. exponential edge weights. In particular, the result applies to random $d$-regular graphs for every fixed $d \ge 2$. The proof separates the flu...
We show that all normal covers of a fixed finite graph $G$ sitting between the universal and maximal abelian covers share the same atomic part of their spectral measures. We give an explicit double formula for the mass of atoms which generalises and unifies known results on universal covering trees and maximal abelian...
Charles Bordenave, Wen-Bo Li, Joe Thomas· 0 citations
We prove that the uniform random non-separable planar map with $n$ edges admits the Brownian sphere as Gromov--Hausdorff--Prokhorov scaling limit as $n$ tends to infinity. Our proof introduces a non-bijective ``common-core transfer method''that constitutes a novel and universal proof strategy for scaling limits of rand...
We consider the adjacency matrix of a random directed $d$-regular graph on $N$ vertices. For fixed $d\geq 2$, we prove that the empirical eigenvalue density converges in probability to the oriented Kesten--McKay law as $N\to \infty$. The key technical input is the small-ball probability estimate for the smallest singul...
Yu-Kun He, Jiao-Yang Huang· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
