Related papers: Component Spectrum of Large Sparse Uniformly Rando…
We consider random stochastic matrices $M$ with elements given by $M_{ij}=|U_{ij}|^2$, with $U$ being uniformly distributed on one of the classical compact Lie groups or associated symmetric spaces. We observe numerically that, for large…
We consider an ensemble of $2\times 2$ normal matrices with complex entries representing operators in the quantum mechanics of 2 - level parity-time reversal (PT) symmetric systems. The randomness of the ensemble is endowed by obtaining…
Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We…
We consider predictions of the random number and the magnitude of each iid component in a random sum based on its distributional structure, where only a total value of the sum is available and where iid random components are non-negative.…
It is shown that the asymptotic spectra of finite-time Lyapunov exponents of a variety of fully chaotic dynamical systems can be understood in terms of a statistical analysis. Using random matrix theory we derive numerical and in particular…
In this paper we provide a unified treatment of some convex minimization problems, which allows for a better understanding and, in some cases, improvement of results in this direction proved recently in spaces of curvature bounded above.…
We prove almost sure strong asymptotic freeness of i.i.d. random unitaries with the following law: sample a Haar unitary matrix of dimension $n$ and then send this unitary into an irreducible representation of $U(n)$. The strong convergence…
The random geometric graph is obtained by sampling $n$ points from the unit square (uniformly at random and independently), and connecting two points whenever their distance is at most $r$, for some given $r=r(n)$. We consider the following…
We study semiclassical asymptotics for spectra of non-selfadjoint perturbations of selfadjoint analytic $h$-pseudodifferential operators in dimension 2, assuming that the classical flow of the unperturbed part is completely integrable.…
The statistics of chiral matrix ensembles with uncorrelated but multivariate Gaussian distributed elements is intuitively expected to be driven by many parameters. Contrary to intuition, however, our theoretical analysis reveals the…
A random graph order is a partial order obtained from a random graph on $[n]$ by taking the transitive closure of the adjacency relation. The dimension of the random graph orders from random bipartite graphs $B(n,n,p)$ and from $G(n,p)$…
We study harmonic chains with i.i.d. random spring constants $K_n$ and i.i.d. random masses $m_n$. We introduce a new combinatorial approach which allows to derive a compact approximate expression for the complex Lyapunov exponent, in terms…
In this paper we propose and analyse a hybrid numerical-asymptotic boundary element method for the solution of problems of high frequency acoustic scattering by a class of sound-soft nonconvex polygons. The approximation space is enriched…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
Let $\Gamma$ be a group of order $n^2$ and $SMS_{\Gamma}(n)=(a_{i,j})_{n\times n}$ be an $n\times n$ array whose entries are all distinct elements of $\Gamma$. If there exists an element $\mu\in\Gamma$ such that for every row $i$, there…
Asymptotic normality is frequently observed in large combinatorial structures, rigorously established for many quantities such as cycles or inversions in random permutations, the number of prime factors of random integers, and various…
Linear constrained switching systems are linear switched systems whose switching sequences are constrained by a deterministic finite automaton. This work investigates how to generate a sequence of matrices with an asymptotic growth rate…
A permutation of [n] induces a graph on [n] such that the edges of the graph correspond to inversion pairs of the permutation. This graph is connected if and only if the corresponding permutation is indecomposable. Let s(n,m) denote a…
In this paper, we investigate the non-symmetric Strong Spectral Property (nSSP) from a combinatorial perspective. To zero-nonzero patterns of matrices we associate directed graphs and study when they require or allow the nSSP, providing a…
We consider the spectrum of the totally asymmetric simple exclusion process on a periodic lattice of $L$ sites. The first eigenstates have an eigenvalue with real part scaling as $L^{-3/2}$ for large $L$ with finite density of particles.…