Related papers: Size dependence of the largest distance between ra…
Rudnick and Wigman (Ann. Henri Poincar\'{e}, 2008; arXiv:math-ph/0702081) conjectured that the variance of the volume of the nodal set of arithmetic random waves on the $d$-dimensional torus is $O(E/\mathcal{N})$, as $E\to\infty$, where $E$…
We show that the maximal value in a size $n$ sample from GEM$(\theta)$ distribution is distributed as a sum of independent geometric random variables. This implies that the maximal value grows as $\theta\log(n)$ as $n\to\infty$. For the…
Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…
We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…
Stochastic separation theorems play important role in high-dimensional data analysis and machine learning. It turns out that in high dimension any point of a random set of points can be separated from other points by a hyperplane with high…
An ab-initio numerical study of the density-dependent, evolutionary stable dispersal strategy is presented. The simulations are based on a simple discretei generation island model with four processes: reproduction, dispersal, competition…
The maximum size of a cosmic structure is given by the maximum turnaround radius -- the scale where the attraction due to its mass is balanced by the repulsion due to dark energy. We derive generic formulae for the estimation of the maximum…
Let $\alpha(\mathbb{F}_q^{d},p)$ be the maximum possible size of a point set in general position in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^{d},p)$ up to a polylogarithmic factor…
For a rational number $r>1$, a set $A$ of positive integers is called an $r$-multiple-free set if $A$ does not contain any solution of the equation $rx = y$. The extremal problem on estimating the maximum possible size of $r$-multiple-free…
The dynamics of a nonequilibrium system can become complex because the system has many components (e.g., a human brain), because the system is strongly driven from equilibrium (e.g., large Reynolds-number flows), or because the system…
Consider an experiment with a finite set of design points representing permissible trial conditions. Suppose that each trial is associated with a cost that depends on the selected design point. In this paper, we study the problem of…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We…
The distribution function of a random distance in three dimensions is given and some new three-dimensional d2-tests of randomness are suggested. We show that our test statistics are not correlated with the usual test statistics and are…
The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…
We consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at…
The well-known Sauer lemma states that a family $\mathcal{F}\subseteq 2^{[n]}$ of VC-dimension at most $d$ has size at most $\sum_{i=0}^d\binom{n}{i}$. We obtain both random and explicit constructions to prove that the corresponding…
A sequence $D = \{d_1,...d_n\}$ is a feasible degree sequence if there is a graph on $\{1,...,n\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uniformly at random from those with the given degree sequence.…
Consider error terms x(i) of a moving average process MA(q), where x(i)=e(i) + e(i-1)+...+e(i-q) and e(i) - independent identically distributed (i.i.d.) random variables. We recognize a term x(i) as a local maximum if the following…
We investigate the maximal size of an increasing subset among points randomly sampled from certain probability densities. Kerov and Vershik's celebrated result states that the largest increasing subset among $N$ uniformly random points on…