Related papers: Tesler matrices and Lusztig data
We consider positive entropy $G$-systems for certain countable, discrete, infinite left-orderable amenable groups $G$. By undertaking local analysis, the existence of asymptotic pairs and chaotic sets will be studied in connecting with the…
We provide resolvent asymptotics as well as various operator-norm estimates for the system of linear partial differential equations describing the thin infinite elastic rod with material coefficients which periodically highly oscillate…
In another related work, U-statistics were used for non-asymptotic "average-case" analysis of random compressed sensing matrices. In this companion paper the same analytical tool is adopted differently - here we perform non-asymptotic…
We show in this note that the asymptotic spectral distribution, location and distribution of the largest eigenvalue of a large class of random density matrices coincide with that of Wishart-type random matrices using proper scaling. As an…
We investigate the adaptation and performance of modularity-based algorithms, designed in the scope of complex networks, to analyze the mesoscopic structure of correlation matrices. Using a multi-resolution analysis we are able to describe…
We study the Cowling approximation by analytical means as applied to a system of linear differential equations arising from models of non-radial stellar pulsation. We consider various asymptotic cases, including those of high harmonic…
This is a tutorial on some basic non-asymptotic methods and concepts in random matrix theory. The reader will learn several tools for the analysis of the extreme singular values of random matrices with independent rows or columns. Many of…
We prove a factorization-concentration result for characters of symmetric groups. This is then applied to the asymptotic behaviour of the decomposition of the tensor representations. There are connections with the Pastur-Marcenko…
Let F be a 4-regular graph with an Euler system C. We introduce a simple way to modify the interlacement matrix of C so that every circuit partition P of F has an associated modified interlacement matrix M(C,P). If C and C' are Euler…
We consider the problem of learning a directed graph $G^\star$ from observational data. We assume that the distribution which gives rise to the samples is Markov and faithful to the graph $G^\star$ and that there are no unobserved…
Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…
We provide abstract, general and highly uniform rates of asymptotic regularity for a generalized stochastic Halpern-style iteration, which incorporates a second mapping in the style of a Krasnoselskii-Mann iteration. This iteration is…
In this paper we prove some orthogonality relations for representations arising from deep level Deligne--Lusztig schemes of Coxeter type. This generalizes previous results of Lusztig (2004), and of Chan and the second author (2019).…
We adapt the techniques in Stigler [Ann. Statist. 1 (1973) 472--477] to obtain a new, general asymptotic result for trimmed $U$-statistics via the generalized $L$-statistic representation introduced by Serfling [Ann. Statist. 12 (1984)…
We derive logarithmic asymptotics of probabilities of small deviations for iterated processes in the space of trajectories. We find conditions under which these asymptotics coincide with those of processes generating iterated processes.…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
It is well known that central order statistics exhibit a central limit behavior and converge to a Gaussian distribution as the sample size grows. This paper strengthens this known result by establishing an entropic version of the CLT that…
In this article, we introduce a novel geometrical index $\delta_{agg}$, which is associated with the Euler number and is obtained by an image processing procedure for a given digital picture of aggregated particles such that $\delta_{agg}$…
We provide necessary and sufficient conditions for a Jacobi matrix to produce orthogonal polynomials with Szeg\H{o} asymptotics off the real axis. A key idea is to prove the equivalence of Szeg\H{o} asymptotics and of Jost asymptotics for…
The least square solution of minimum norm of a rectangular linear system of equations can be found out iteratively by using matrix splittings. However, the convergence of such an iteration scheme arising out of a matrix splitting is…