Related papers: Random chords and point distances in regular polyg…
We prove that the distribution density of any non-constant polynomial $f(\xi_1,\xi_2,\ldots)$ of degree $d$ in independent standard Gaussian random variables $\xi$ (possibly, in infinitely many variables) always belongs to the…
In this paper, we extend our earlier result (see [Y-2008]) on the distribution of normalized zero-sets of random entire functions to random entire functions with small random perturbation.
We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic…
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…
We use the generating function approach to derive simple expressions for the factorial moments of the distance distribution over Reed-Solomon codes. We obtain better upper bounds for the error term of a counting formula given by Li and Wan,…
The discrepancy function measures the deviation of the empirical distribution of a point set in $[0,1]^d$ from the uniform distribution. In this paper, we study the classical discrepancy function with respect to the BMO and exponential…
We derive a closed-form expression for the orthogonal polynomials associated with the general lognormal density. The result can be utilized to construct easily computable approximations for probability density function of a product of…
According to Berry a wave-chaotic state may be viewed as a superposition of monochromatic plane waves with random phases and amplitudes. Here we consider the distribution of nodal points associated with this state. Using the property that…
Consider a graph on randomly scattered points in an arbitrary space, with two points $x,y$ connected with probability $\phi(x,y)$. Suppose the number of points is large but the mean number of isolated points is $O(1)$. We give general…
The statistical precision of a chord method for estimating fractal dimension from a correlation integral is derived. The optimal chord length is determined, and a comparison is made to other estimators. These calculations use the…
One of the questions of distribution of prime numbers is considered in the article. It is shown what error is obtained from the assumption that the asymptotic density of a sequence of primes is a probability. Various forms of an analogue of…
This article is an introduction to parton distribution functions and their generalizations which describe the quark and gluon structure of hadrons, and can be measured in various high-energy scattering processes. We provide the theoretical…
The densest amorphous packing of rigid particles is known as random close packing. It has long been appreciated that higher densities are achieved by using collections of particles with a variety of sizes. The variety of sizes is often…
This paper presents a distance function between sets based on an average of distances between their elements. The distance function is a metric if the sets are non-empty finite subsets of a metric space. It can be applied to produce various…
In this paper we deduce a universal result about the asymptotic distribution of roots of random polynomials, which can be seen as a complement to an old and famous result of Erdos and Turan. More precisely, given a sequence of random…
We study distance properties of a general class of random directed acyclic graphs (DAGs). In a DAG, many natural notions of distance are possible, for there exists multiple paths between pairs of nodes. The distance of interest for circuits…
We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly…
Graphons have traditionally served as limit objects for dense graph sequences, with the cut distance serving as the metric for convergence. However, sparse graph sequences converge to the trivial graphon under the conventional definition of…
We introduce the problem of variable-length source resolvability, where a given target probability distribution is approximated by encoding a variable-length uniform random number, and the asymptotically minimum average length rate of the…
A stochastic algorithm is proposed, finding the set of generalized means associated to a probability measure on a compact Riemannian manifold M and a continuous cost function on the product of M by itself. Generalized means include p-means…