Related papers: Counting coprime pairs in random squares
This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…
Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
We enumerate arrangements of $n$ couples, i.e. pairs of people, placed in a single-file queue, and consider four statistics from the vantage point of a distinguished given couple. In how many arrangements are exactly $p$ of the $n-1$ other…
We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently this technique…
This work aims at providing new bounds for the diversity multiplexing gain trade-off of a general class of division algebra based lattice codes. In the low multiplexing gain regime, some bounds were previously obtained from the high…
We consider finite Bernoulli convolutions with a parameter $1/2 < r < 1$ supported on a discrete point set, generically of size $2^N$. These sequences are uniformly distributed with respect to the infinite Bernoulli convolution measure…
In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…
We derive the distribution of the maximum number of common neighbours of a pair of vertices in a dense random regular graph.The proof involves two important steps. One step is to establish the extremal independence property: the asymptotic…
It is known that after an appropriate rescaling the maximum degree of the binomial random graph converges in distribution to a Gumbel random variable. The same holds true for the maximum number of common neighbours of a $k$-vertex set, and…
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit…
We introduce a conditional pair distribution function (CPDF) which characterizes the probability density of finding an object (e.g., a particle in a fluid) to certain distance of other, with each of these two having a nearest neighbor to a…
The distribution of the first positive position reached by a random walker starting at the origin is central to the analysis of extremes and records in one-dimensional random walks. In this work, we present a detailed and self-contained…
Strict frequentism defines probability as the limiting relative frequency in an infinite sequence. What if the limit does not exist? We present a broader theory, which is applicable also to random phenomena that exhibit diverging relative…
In this paper we obtain a couple of explicit expressions for the derivative of the probability of an increasing event in the random interlacements model. The event is supported in a finite subset of the lattice, and the derivative is with…
We provide an asymptotic expression for the probability that a randomly chosen polynomial with given degree, having integral coefficients bounded by some B, has a prescribed signature. We also give certain related formulas and numerical…
We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…
A pair of natural numbers (a,b) such that a is both squarefree and coprime to b is called a carefree couple. A result conjectured by Manfred Schroeder (in his book `Number theory in science and communication') on carefree couples and a…
In this paper, we introduce the statistically multiplicative convergent sequences in locally solid Riesz algebras with respect to the algebra multiplication and the solid topology. We study on this concept and we give the notion of…
We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a…