Related papers: Polynomial Time Computable Triangular Arrays For A…

In this article, we study critical points (zeros of derivative) of random polynomials. Take two deterministic sequences $\{a_n\}_{n\geq1}$ and $\{b_n\}_{n\geq1}$ of complex numbers whose limiting empirical measures are same. By choosing…

We analyze the asymptotic behavior of random variables $x(n,x\_0)$ defined by $x(0,x\_0)=x\_0$ and $x(n+1,x\_0)=A(n)x(n,x\_0)$, where $\sAn$ is a stationary and ergodic sequence of random matrices with entries in the semi-ring…

Given a triangular array $\left\{X_{n,k}, \, 1 \leqslant k \leqslant n, n \geqslant 1 \right\}$ of random variables satisfying $\mathbb{E} \lvert X_{n,k} \rvert^{p} < \infty$ for some $p \geqslant 1$ and sequences $\{b_{n} \}$, $\{c_{n} \}$…

We consider the distribution of polygonal paths joining the partial sums of normalized Kloosterman sums modulo an increasingly high power p^n of a fixed odd prime p, a pure depth-aspect analogue of theorems of Kowalski-Sawin and…

We introduce the concept of Random Sequential Renormalization (RSR) for arbitrary networks. RSR is a graph renormalization procedure that locally aggregates nodes to produce a coarse grained network. It is analogous to the (quasi-)parallel…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

We study the distributions of the splitting primes in certain families of number fields. The first and main example is the family Pn,N of integer polynomials monic of degree n with height less or equal then N, and then let N go to infinity.…

For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…

Let \begin{equation*} S_{0}=0,\quad S_{n}=X_{1}+...+X_{n},\ n\geq 1, \end{equation*} be a random walk whose increments belong without centering to the domain of attraction of a stable law with scaling constants $a_{n}$, that provide…

Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…

In this paper we characterize all distributional limits of the random quadratic form $T_n =\sum_{1\le u< v\le n} a_{u, v} X_u X_v$, where $((a_{u, v}))_{1\le u,v\le n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal and…

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

In the noisy $k$-XOR problem, one is given $y \in \mathbb{F}_2^M$ and must distinguish between $y$ uniform and $y = A x + e$, where $A$ is the adjacency matrix of a $k$-left-regular bipartite graph with $N$ variables and $M$ constraints,…

Let $X_1$, $X_2$,... be a sequence of independent random variables with common distribution function $F$ in the domain of attraction of a Gumbel extreme value distribution and for each integer $n\geq 1$, let $X_{1,n} \leq ... X_{n,n}$…

For a symmetric random walk in $Z^2$ with $2+\delta$ moments, we represent $|\mathcal{R}(n)|$, the cardinality of the range, in terms of an expansion involving the renormalized intersection local times of a Brownian motion. We show that for…

We introduce an error resilient distributed computing method based on an extension of the channel polarization phenomenon to distributed algorithms. The method leverages an algorithmic split operation that transforms two identical compute…

Consider a random trigonometric polynomial $X_n: \mathbb R \to \mathbb R$ of the form $$ X_n(t) = \sum_{k=1}^n \left( \xi_k \sin (kt) + \eta_k \cos (kt)\right), $$ where $(\xi_1,\eta_1),(\xi_2,\eta_2),\ldots$ are independent identically…

For a sample of absolutely bounded i.i.d. random variables with a continuous density the cumulative distribution function of the sample variance is represented by a univariate integral over a Fourier series. If the density is a polynomial…

A real number $x$ is absolutely normal if, for every base $b\ge 2$, every two equally long strings of digits appear with equal asymptotic frequency in the base-$b$ expansion of $x$. This paper presents an explicit algorithm that generates…

This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied in the past, the problem of designing efficient algorithms…