Related papers: On the reduction of a random basis

Lattice-based cryptography relies on generating random bases which are difficult to fully reduce. Given a lattice basis (such as the private basis for a cryptosystem), all other bases are related by multiplication by matrices in…

In [A dozen de {F}inetti-style results in search of a theory, Ann. Inst. H. Poincar\'{e} Probab. Statist. 23(2)(1987), 397--423], Diaconis and Freedman studied low-dimensional projections of random vectors from the Euclidean unit sphere and…

We study the problem of determining the probability that m vectors selected uniformly at random from the intersection of the full-rank lattice L in R^n and the window [0,B)^n generate $\Lambda$ when B is chosen to be appropriately large.…

Let $A$ be an $n\times n$ random matrix with independent rows $R_1(A),\dots,R_n(A)$, and assume that for any $i\leq n$ and any three-dimensional linear subspace $F\subset {\mathbb R}^n$ the orthogonal projection of $R_i(A)$ onto $F$ has…

This paper is about the rate of convergence of the Markov chain $X_{n+1}=AX_{n}+B_{n}$ (mod $p$), where $A$ is an integer matrix with nonzero eigenvalues and ${B_{n}}_{n}$ is a sequence of independent and identically distributed integer…

We consider the asymptotic behavior as $n\to\infty$ of the spectra of random matrices of the form \[\frac{1}{\sqrt{n-1}}\sum_{k=1}^{n-1}Z_{nk}\rho_n ((k,k+1)),\] where for each $n$ the random variables $Z_{nk}$ are i.i.d. standard Gaussian…

We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…

Let $G$ be a real Lie group, $\Lambda\subseteq G$ a lattice, and $X=G/\Lambda$. We fix a probability measure $\mu$ on $G$ and consider the left random walk induced on $X$. It is assumed that $\mu$ is aperiodic, has a finite first moment,…

For fixed $m>1$, we consider $m$ independent $n \times n$ non-Hermitian random matrices $X_1, ..., X_m$ with i.i.d. centered entries with a finite $(2+\eta)$-th moment, $ \eta>0.$ As $n$ tends to infinity, we show that the empirical…

In this note we study the error term R_{n,L}(x) in the generalized circle problem for a ball of volume x and a random lattice L of large dimension n. Our main result is the following functional central limit theorem: Fix an arbitrary…

Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…

In recent papers it has been demonstrated that sampling a Gibbs distribution from an appropriate time-irreversible Langevin process is, from several points of view, advantageous when compared to sampling from a time-reversible one. Adding…

Given two vectors in Euclidean space, how unlikely is it that a random vector has a larger inner product with the shorter vector than with the longer one? When the random vector has independent, identically distributed components, we…

We consider the point process \begin{align*} \frac{1}{Z_{n}}\prod_{1 \leq j < k \leq n} |e^{i\theta_{j}}-e^{-i\theta_{k}}|^{\beta}\prod_{j=1}^{n} d\theta_{j}, \qquad \theta_{1},\ldots,\theta_{n} \in (-\pi,\pi], \quad \beta > 0, \end{align*}…

Inspired by a recent paper of I. Grama, E. Le Page and M. Peign\'e, we consider a sequence $(g_n)_{n \geq 1}$ of i.i.d. random $d\times d$-matrices with non-negative entries and study the fluctuations of the process $(\log \vert g_n\cdots…

As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such…

Consider a $N\times n$ random matrix $Y_n=(Y_{ij}^{n})$ where the entries are given by $Y_{ij}^{n}=\frac{\sigma(i/N,j/n)}{\sqrt{n}} X_{ij}^{n}$, the $X_{ij}^{n}$ being centered i.i.d. and $\sigma:[0,1]^2 \to (0,\infty)$ being a continuous…

Let $X$ be an $n$-dimensional random centered Gaussian vector with independent but not identically distributed coordinates and let $T$ be an orthogonal trasformation of $\mathbb R^n$. We show that the random vector $Y=T(X)$ satisfies…

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

Let $\{Z_{n}\}_{n\geq0}$ be a critical Galton--Waston branching process with finite variance $\sigma^{2}$. Spitzer (unpublished), Lamperti and Ney (1968) proved that for any fixed $0<t<1$,…