English
Related papers

Related papers: Quantifying minimal non-collinearity among random …

200 papers

We study random partitions $\lambda=(\lambda_1,\lambda_2,...,\lambda_d)$ of $n$ whose length is not bigger than a fixed number $d$. Suppose a random partition $\lambda$ is distributed according to the Jack measure, which is a deformation of…

Combinatorics · Mathematics 2009-02-12 Sho Matsumoto

We analyze statistical features of the ``optimization landscape'' in a random version of one of the simplest constrained optimization problems of the least-square type: finding the best approximation for the solution of an overcomplete…

Mathematical Physics · Physics 2022-06-08 Yan V. Fyodorov , Rashel Tublin

Consider a population of $N$ individuals, each having $d\geq 1$ different traits, and an additive measure, called dispersion, which rewards large pairwise separations between traits. The goal is to select $M\leq N$ individuals such that…

Statistical Mechanics · Physics 2026-05-01 Fabio Deelan Cunden , Noemi Cuppone , Giovanni Gramegna , Pierpaolo Vivo

We consider the scaling solutions of Smoluchowski's equation of irreversible aggregation, for a non gelling collision kernel. The scaling mass distribution f(s) diverges as s^{-tau} when s->0. tau is non trivial and could, until now, only…

Statistical Mechanics · Physics 2016-08-31 Stephane Cueille , Clement Sire

Estimating Kullback-Leibler divergence from identical and independently distributed samples is an important problem in various domains. One simple and effective estimator is based on the k nearest neighbor distances between these samples.…

Information Theory · Computer Science 2020-02-27 Puning Zhao , Lifeng Lai

The problem of sampling according to the probability distribution minimizing a given free energy, using interacting particles unadjusted kinetic Langevin Monte Carlo, is addressed. In this setting, three sources of error arise, related to…

Probability · Mathematics 2024-12-05 Pierre Monmarché , Katharina Schuh

We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…

Probability · Mathematics 2021-07-20 Mario Correddu , Dario Trevisan

Kullback-Leibler (KL) divergence is one of the most important divergence measures between probability distributions. In this paper, we prove several properties of KL divergence between multivariate Gaussian distributions. First, for any two…

Information Theory · Computer Science 2023-01-24 Yufeng Zhang , Wanwei Liu , Zhenbang Chen , Ji Wang , Kenli Li

We establish sharp non-asymptotic probabilistic bounds for the star discrepancy of double-infinite random matrices -- a canonical model for sequences of random point sets in high dimensions. By integrating the recently proved…

Statistics Theory · Mathematics 2026-01-09 Xiaoda Xu , Jun Xian

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong

If the rates, $K(x,y)$, at which particles of size $x$ coalesce with particles of size $y$ is known, then the mean-field evolution of the particle-size distribution of an ensemble of irreversibly coalescing particles is described by the…

Statistical Mechanics · Physics 2015-06-12 Peter P. Jones , Robin C. Ball , Colm Connaughton

The following class of problems arose out of vain attempts to show that the Pascal's triangle adic transformation has trivial spectrum. Partition a set of size $N$ into sets of size $S \equiv S(N)$ (ignoring leftovers). What is the…

Probability · Mathematics 2016-08-30 David Handelman

Consider random k-circulants A_{k,n} with n tends to infinity, k=k(n) and whose input sequence \{a_l\}_{l \ge 0} is independent with mean zero and variance one and \sup_n n^{-1}\sum_{l=1}^n \E |a_l|^{2+\delta}< \infty for some \delta > 0.…

Probability · Mathematics 2009-12-07 Arup Bose , Joydip Mitra , Arnab Sen

Fix a number field $K$. For each nonzero $\alpha \in \mathbb{Z}_K$, let $\nu(\alpha)$ denote the number of distinct, nonassociate irreducible divisors of $\alpha$. We show that $\nu(\alpha)$ is normally distributed with mean proportional to…

Number Theory · Mathematics 2016-03-18 Paul Pollack

Let $K\subset\mathbb S^{d-1}$ be a convex spherical body. Denote by $\Delta(K)$ the distance between two random points in $K$ and denote by $\sigma(K)$ the length of a random chord of $K$. We explicitly express the distribution of…

Probability · Mathematics 2020-07-16 Tatiana Moseeva , Alexander Tarasov , Dmitry Zaporozhets

If a partition $\lambda$ of size n is chosen randomly according to the Plancherel measure $P_n[\lambda] = (\dim \lambda)^2/n!$, then as n goes to infinity, the rescaled shape of $\lambda$ is with high probability very close to a non-random…

Representation Theory · Mathematics 2010-09-22 Pierre-Loïc Méliot

Pick $n$ independent and uniform random points $U_1,\ldots,U_n$ in a compact convex set $K$ of $\mathbb{R}^d$ with volume 1, and let $P^{(d)}_K(n)$ be the probability that these points are in convex position. The Sylvester conjecture in…

Combinatorics · Mathematics 2024-11-14 Jean-François Marckert , Ludovic Morin

This work examines various statistical distributions in connection with random Vandermonde matrices and their extension to $d$--dimensional phase distributions. Upper and lower bound asymptotics for the maximum singular value are found to…

Probability · Mathematics 2012-11-19 Gabriel H. Tucci , Philip A. Whiting

In terms of the minimal $N$-point diameter $D_d(N)$ for $R^d,$ we determine, for a class of continuous real-valued functions $f$ on $[0,+\infty],$ the $N$-point $f$-best-packing constant $\min\{f(\|x-y\|)\, :\, x,y\in \R^d\}$, where the…

Mathematical Physics · Physics 2012-04-20 A. V. Bondarenko , D. P. Hardin , E. B. Saff

A partition $\mathcal{P}$ of $\mathbb{R}^d$ is called a $(k,\varepsilon)$-secluded partition if, for every $\vec{p} \in \mathbb{R}^d$, the ball $\overline{B}_{\infty}(\varepsilon, \vec{p})$ intersects at most $k$ members of $\mathcal{P}$. A…

Computational Complexity · Computer Science 2023-04-12 Jason Vander Woude , Peter Dixon , A. Pavan , Jamie Radcliffe , N. V. Vinodchandran