相关论文: Integrals over Grassmannians and Random permutatio…

Random hyperspherical harmonics are Gaussian Laplace eigenfunctions on the unit $d$-dimensional sphere ($d\ge 2$). We study the convergence in Total Variation distance for their nonlinear statistics in the high energy limit, i.e., for…

We find lower bounds on the number of intersection points between two relatively exact Hamiltonian isotopic Lagrangians. The bounds are given in terms of the cuplength of the Lagrangian in various multiplicative generalised cohomology…

The Karhunen-Lo\`eve expansion and the Fredholm determinant formula are used to derive an asymptotic Rosenblatt-type distribution of a sequence of integrals of quadratic functions of Gaussian stationary random fields on R^d displaying…

We investigate the problem of percolation of words in a random environment. To each vertex, we independently assign a letter $0$ or $1$ according to Bernoulli r.v.'s with parameter $p$. The environment is the resulting graph obtained from…

We investigate the variance of the length of the longest common subsequences of two independent random words of size $n$, where the letters of one word are i.i.d. uniformly drawn from $\{\alpha_1, \alpha_2, \cdots, \alpha_m\}$, while the…

Various ensembles of random matrices with independent entries are analyzed by the replica formalism in the large-N limit. A result on the Laplacian random matrix with Wigner-rescaling is generalized to arbitrary probability distribution.

We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…

The present work is concerned with Gaussian integrals on simply connected non-positively curved Riemannian symmetric spaces. It is motivated by the aim of explicitly finding the high-rank limit of these integrals for each of the eleven…

One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix $A$ and storing the permutation matrix factor $P$ from the resulting GEPP factorization $PA=LU$. We are…

We consider the problem of recovering conditional independence relationships between $p$ jointly distributed Hilbertian random elements given $n$ realizations thereof. We operate in the sparse high-dimensional regime, where $n \ll p$ and no…

Considering the optimal alignment of two i.i.d. random sequences of length $n$, we show that when the scoring function is chosen randomly, almost surely the empirical distribution of aligned letter pairs in all optimal alignments converges…

We use a probabilistic approach to describe the behavior as $n -> \infty$ of the Laplace transforms of $P^n$, where $P$ a fixed complex polynomial. As a consequence we obtain a new elementary proof of an result of Gillis-Ismail-Offer in the…

We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate…

An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…

Approximating complex probability distributions, such as Bayesian posterior distributions, is of central interest in many applications. We study the expressivity of geometric Gaussian approximations. These consist of approximations by…

The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…

For a pair of random Gaussian integers chosen uniformly and independently from the set of Gaussian integers of norm $x$ or less as $x$ goes to infinity, we find asymptotics for the average norm of their greatest common divisor, with…

We develop a principled way of identifying probability distributions whose independent and identically distributed (iid) realizations are compressible, i.e., can be well-approximated as sparse. We focus on Gaussian random underdetermined…

We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…

The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the…