Related papers: On the reduction of a random basis

For each $n$, let $U_n$ be Haar distributed on the group of $n\times n$ unitary matrices. Let $\bfx_{n,1},\ldots,\bfx_{n,m} $ denote orthogonal nonrandom unit vectors in ${\Bbb C}^n$ and let $\text{\bf…

Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density $\rho$ and a pair of nodes separated by an Euclidean distance $x$ are directly connected with probability…

In this paper we consider ensemble of random matrices $\X_n$ with independent identically distributed vectors $(X_{ij}, X_{ji})_{i \neq j}$ of entries. Under assumption of finite fourth moment of matrix entries it is proved that empirical…

The classical Galton--Watson process works with a fixed probability of fission at each time step. One of the generalizations is that the probabilities depend on time. We consider one of the most complex and interesting cases when we do not…

We study a natural extension of classical empirical risk minimization, where the hypothesis space is a random subspace of a given space. In particular, we consider possibly data dependent subspaces spanned by a random subset of the data,…

Let $U_n=[u_{i,j}]$ be the eigenvectors matrix of a Wigner matrix. We prove that under some moments conditions, the bivariate random process indexed by $[0,1]^2$ with value at $(s,t)$ equal to the sum, over $1\le i \le ns$ and $1\le j \le…

Using the Zhelobenko's approach we investigate a branching of an irreducible representation of $g_n$ under the restriction of algebras $g_n\downarrow g_{n-1}$, where $g_n$ is a Lie algebra of type $B_n$, $C_n$, $D_n$ or a Lie algebra of…

We consider the random matrix obtained by picking vectors randomly from a large collection of mutually unbiased bases of $\mathbb{C}^n$, and prove that the spectral distribution converges to the Marchenko-Pastur law. This shows that vectors…

We use an idea from sieve theory to estimate the distribution of the lengths of $k$th shortest vectors in a random lattice of covolume 1 in dimension $n$. This is an improvement of the results of Rogers and S\"odergren in that it allows $k$…

Let A be an n*n random matrix with mean zero and independent inhomogeneous non-constant subgaussian entries. We get that for any k<c\sqrt{n}, the probability of the matrix has a lower rank than n-k that is sub-exponential. Furthermore, we…

The O(n) vector model with logarithmic action on a lattice of coordination 3 is related to a gas of self-avoiding loops on the lattice. This formulation allows for analytical continuation in n: critical behaviour is found in the real…

Normalized random measures with independent increments represent a large class of Bayesian nonaprametric priors and are widely used in the Bayesian nonparametric framework. In this paper, we provide the posterior consistency analysis for…

Let $\a$ be a real-valued random variable of mean zero and variance 1. Let $M_n(\a)$ denote the $n \times n$ random matrix whose entries are iid copies of $\a$ and $\sigma_n(M_n(\a))$ denote the least singular value of $M_n(\a)$.…

We study properties of distributions of random variables with independent identically distributed symbols of generalized L\"{u}roth series (GLS) expansions (the family of GLS-expansions contains L\"{u}roth expansion and $Q_{\infty}$- and…

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

Let $L_{n}$ be the least common multiple of a random set of integers obtained from $\{1,\ldots,n\}$ by retaining each element with probability $\theta\in (0,1)$ independently of the others. We prove that the process $(\log L_{\lfloor…

Consider a sequence of Poisson random connection models (X_n,lambda_n,g_n) on R^d, where lambda_n / n^d \to lambda > 0 and g_n(x) = g(nx) for some non-increasing, integrable connection function g. Let I_n(g) be the number of isolated…

A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. We define a class of bases called…

The Asymmetric BA model extends the Barab\'asi-Albert scale-free network model by introducing a parameter $\omega$. As $\omega$ varies, the model transitions through different network structures: an extended lattice at $\omega = -1$, a…

We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…