中文
相关论文

相关论文: A Thinning Analogue of de Finetti's Theorem

200 篇论文

Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…

数据结构与算法 · 计算机科学 2025-05-14 Elisabet Burjons , Peter Rossmanith

Consider a sphere of radius root(n) in n dimensions, and consider X, a random variable uniformly distributed on its surface. Poincare's Observation states that for large n, the distribution of the first k coordinates of X is close in total…

概率论 · 数学 2007-06-13 Oliver Johnson

For a given random sequence $(C,T_{1},T_{2},\ldots)$ with nonzero $C$ and a.s. finite number of nonzero $T_{k}$, the nonhomogeneous smoothing transform $\mathcal{S}$ maps the law of a real random variable $X$ to the law of $\sum_{k\ge…

概率论 · 数学 2015-10-23 Gerold Alsmeyer , Piotr Dyszewski

We derive a necessary and sufficient condition for the sum of M independent continuous random variables modulo 1 to converge to the uniform distribution in L^1([0,1]), and discuss generalizations to discrete random variables. A consequence…

概率论 · 数学 2010-09-15 Steven J. Miller , Mark J. Nigrini

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

概率论 · 数学 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

We present a simple solution to a question posed by Candes, Romberg and Tao on the uniform uncertainty principle for Bernoulli random matrices. More precisely, we show that a rectangular k*n random subgaussian matrix (with k < n) has the…

统计理论 · 数学 2007-06-13 Shahar Mendelson , Alain Pajor , Nicole Tomczak-Jaegermann

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

计算复杂性 · 计算机科学 2016-08-31 Peter Gacs

We present an efficient algorithm for uniformly sampling from an arbitrary compact body $\mathcal{X} \subset \mathbb{R}^n$ from a warm start under isoperimetry and a natural volume growth condition. Our result provides a substantial common…

数据结构与算法 · 计算机科学 2026-03-27 Santosh S. Vempala , Andre Wibisono

Given a parametric polynomial curve $\gamma:[a,b]\rightarrow \mathbb{R}^n$, how can we sample a random point $\mathfrak{x}\in \mathrm{im}(\gamma)$ in such a way that it is distributed uniformly with respect to the arc-length? Unfortunately,…

计算几何 · 计算机科学 2022-09-28 Apostolos Chalkis , Christina Katsamaki , Josué Tonelli-Cueto

The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the…

概率论 · 数学 2013-04-17 Alexander Iksanov , Alexander Marynych , Vladimir Vatutin

In this paper, we develop a general theory of truncated inverse binomial sampling. In this theory, the fixed-size sampling and inverse binomial sampling are accommodated as special cases. In particular, the classical Chernoff-Hoeffding…

统计理论 · 数学 2019-08-20 Xinjia Chen

We study the basic statistical problem of testing whether normally distributed $n$-dimensional data has been truncated, i.e. altered by only retaining points that lie in some unknown truncation set $S \subseteq \mathbb{R}^n$. As our main…

数据结构与算法 · 计算机科学 2024-11-25 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…

经典分析与常微分方程 · 数学 2019-03-19 Ethan Goolish , Robert S. Strichartz

Given a sequence $(X_n)$ of real or complex random variables and a sequence of numbers $(a_n)$, an interesting problem is to determine the conditions under which the series $\sum_{n=1}^\infty a_n X_n$ is almost surely convergent. This paper…

泛函分析 · 数学 2021-03-18 Safari Mukeru

We analyze the asymptotic behavior of random variables $x(n,x\_0)$ defined by $x(0,x\_0)=x\_0$ and $x(n+1,x\_0)=A(n)x(n,x\_0)$, where $\sAn$ is a stationary and ergodic sequence of random matrices with entries in the semi-ring…

概率论 · 数学 2007-05-23 Glenn Merlet

Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…

概率论 · 数学 2012-03-27 Charles Bordenave , Pietro Caputo , Djalil Chafai

Let $\xi_0,\xi_1,...$ be independent identically distributed (i.i.d.) random variables such that $\E \log (1+|\xi_0|)<\infty$. We consider random analytic functions of the form $$ G_n(z)=\sum_{k=0}^{\infty} \xi_k f_{k,n} z^k, $$ where…

概率论 · 数学 2012-10-02 Zakhar Kabluchko , Dmitry Zaporozhets

We extend de Finetti's (1937) notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than (linear) previsions. We prove…

概率论 · 数学 2008-01-09 Gert de Cooman , Erik Quaeghebeur , Enrique Miranda

A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…

概率论 · 数学 2021-01-13 Jake Koenig , Hoi Nguyen

In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…

概率论 · 数学 2009-12-11 A. D. Barbour , E. Kowalski , A. Nikeghbali