English
Related papers

Related papers: Quantifying minimal non-collinearity among random …

200 papers

In this short note, we prove a version of the Johnson-Lindenstrauss flattening Lemma for point sets taking values in discrete subgroups. More precisely, given $d,\lambda_0,N_0\in\mathbb{N}$ and $\epsilon\in \left(0,\frac{1}{2}\right)$…

Metric Geometry · Mathematics 2025-01-22 Rodolfo Viera

In this paper, we consider the symmetric KL-divergence between the sum of independent variables and a Gaussian distribution, and obtain a convergence rates of order $O\left( \frac{\ln n}{\sqrt{n}}\right)$. The proof is based on Stein's…

Probability · Mathematics 2024-08-20 Liu-Quan Yao , Song-Hao Liu

Consider the projection of an $n$-dimensional random vector onto a random $k_n$-dimensional basis, $k_n \leq n$, drawn uniformly from the Haar measure on the Stiefel manifold of orthonormal $k_n$-frames in $\mathbb{R}^n$, in three different…

Probability · Mathematics 2021-10-28 Steven Soojin Kim , Yin-Ting Liao , Kavita Ramanan

$\Lambda$-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to initially $n$ singletons we study the collision…

Probability · Mathematics 2017-08-15 Alexander Gnedin , Alexander Iksanov , Alexander Marynych , Martin Möhle

The major contributions of this paper lie in two aspects. Firstly, we focus on deriving Bernstein-type inequalities for both geometric and algebraic irregularly-spaced NED random fields, which contain time series as special case.…

Statistics Theory · Mathematics 2025-03-20 Zihao Yuan , Martin Spindler

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and…

Classical Analysis and ODEs · Mathematics 2021-04-21 Richárd Balka , Márton Elekes , Viktor Kiss

We study random surfaces constructed by glueing together $N/k$ filled $k$-gons along their edges, with all $(N-1)!! = (N-1)(N-3)...3\cdot 1$ pairings of the edges being equally likely. (We assume that lcm $\{2,k\}$ divides $N$.) The Euler…

Probability · Mathematics 2009-02-23 Kevin Fleming , Nicholas Pippenger

This article presents certain recent methodologies and some new results for the statistical analysis of probability distributions on manifolds. An important example considered in some detail here is the 2-D shape space of k-ads, comprising…

Geometric Topology · Mathematics 2008-12-18 Abhishek Bhattacharya , Rabi Bhattacharya

For $S\subseteq V(G)$ and $|S|\geq 2$, $\lambda(S)$ is the maximum number of edge-disjoint trees connecting $S$ in $G$. For an integer $k$ with $2\leq k\leq n$, the \emph{generalized $k$-edge-connectivity} $\lambda_k(G)$ of $G$ is then…

Combinatorics · Mathematics 2013-07-10 Xueliang Li , Yaping Mao

Consider a 2-dimensional soft random geometric graph $G(\lambda,s,\phi)$, obtained by placing a Poisson($\lambda s^2$) number of vertices uniformly at random in a square of side $s$, with edges placed between each pair $x,y$ of vertices…

Probability · Mathematics 2022-04-25 Mathew D. Penrose

We conduct a KL-divergence based procedure for testing elliptical distributions. The procedure simultaneously takes into account the two defining properties of an elliptically distributed random vector: independence between length and…

Methodology · Statistics 2025-11-04 Yin Tang , Yanyuan Ma , Bing Li

We consider the discrete three dimensional scan statistics. Viewed as the maximum of an 1-dependent stationary r.v.'s sequence, we provide approximations and error bounds for the probability distribution of the three dimensional scan…

Computation · Statistics 2013-03-18 Alexandru Amarioarei , Cristian Preda

Let $d$ be a probability distribution. Under certain mild conditions we show that $$ \lim_{x\to\infty}x\sum_{n=1}^\infty \frac{d^{*n}(x)}{n}=1,\qquad\text{where}\quad d^{*n}:=\underbrace{\,d*d*\cdots*d\,}_{n\text{ times}}. $$ For a…

Number Theory · Mathematics 2015-05-14 William D. Banks , Konstantin A. Makarov

For a fixed $k\in\{1,\dots,d\}$ consider random vectors $X_0,\dots, X_{k}\in\mathbb R^d$ with an arbitrary spherically symmetric joint density function. Let $A$ be any non-singular $d\times d$ matrix. We show that the $k$-dimensional volume…

Probability · Mathematics 2019-08-08 Friedrich Götze , Anna Gusakova , Dmitry Zaporozhets

We show that several versions of Floyd and Rivest's algorithm Select for finding the $k$th smallest of $n$ elements require at most $n+\min\{k,n-k\}+o(n)$ comparisons on average and with high probability. This rectifies the analysis of…

Data Structures and Algorithms · Computer Science 2007-05-23 Krzysztof C. Kiwiel

Let $X, Y$ be two independent identically distributed (i.i.d.) random variables taking values from a separable Banach space $(\mathcal{X}, \|\cdot\|)$. Given two measurable subsets $F, K\subseteq\cal{X}$, we established distribution free…

Probability · Mathematics 2018-05-01 Zhao Dong , Jiange Li , Wenbo V. Li

Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…

Combinatorics · Mathematics 2007-05-23 Rod Canfield , Sylvie Corteel , Pawel Hitczenko

Let $K, D$ be $n$-dimensional convex bodes. Define the distance between $K$ and $D$ as $$ d(K,D) = \inf \{\lambda | T K \subset D+x \subset \lambda \cdot TK \}, $$ where the infimum is taken over all $x \in R^n$ and all invertible linear…

Functional Analysis · Mathematics 2007-05-23 M. Rudelson

We consider the following problem about dispersing points. Given a set of points in the plane, the task is to identify whether by moving a small number of points by small distance, we can obtain an arrangement of points such that no pair of…

Computational Geometry · Computer Science 2023-08-15 Fedor V. Fomin , Petr A. Golovach , Tanmay Inamdar , Saket Saurabh , Meirav Zehavi

The largest volume ratio of given convex body $K \subset \mathbb{R}^n$ is defined as $$\mbox{lvr}(K):= \sup_{L \subset \mathbb{R}^n} \mbox{vr}(K,L),$$ where the $\sup$ runs over all the convex bodies $L$. We prove the following sharp lower…

Metric Geometry · Mathematics 2020-04-21 Daniel Galicer , Mariano Merzbacher , Damián Pinasco