中文
相关论文

相关论文: A note on the binomial distribution motivated by C…

200 篇论文

Let $T\subset\mathbb{R}$, $M$ be a metric space with metric $d$, and $M^T$ be the set of all functions mapping $T$ into $M$. Given $f\in M^T$, we study the properties of the approximate variation $\{V_\varepsilon(f)\}_{\varepsilon>0}$,…

泛函分析 · 数学 2021-11-05 Vyacheslav V. Chistyakov

We show that for every $k$, the probability that a randomly selected vertex of a random binary search tree on $n$ nodes is at distance $k-1$ from the closest leaf converges to a rational constant $c_k$ as $n$ goes to infinity.

组合数学 · 数学 2013-04-24 Miklos Bona

Let $N$ be a finite set, let $p \in (0,1)$, and let $N_p$ denote a random binomial subset of $N$ where every element of $N$ is taken to belong to the subset independently with probability $p$ . This defines a product measure $\mu_p$ on the…

组合数学 · 数学 2014-09-25 Ehud Friedgut , Jeff Kahn , Clara Shikhelman

For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…

组合数学 · 数学 2015-05-05 Anna Gundert , Uli Wagner

In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$. We provide quantitative estimates showing that the distribution function of the minimal…

信息论 · 计算机科学 2020-07-15 Jing Hao , Han Huang , Galyna Livshyts , Konstantin Tikhomirov

We prove that, for every $k=1,2,...,$ every shortest-path metric on a graph of pathwidth $k$ embeds into a distribution over random trees with distortion at most $c$ for some $c=c(k)$. A well-known conjecture of Gupta, Newman, Rabinovich,…

度量几何 · 数学 2012-10-09 James R. Lee , Anastasios Sidiropoulos

It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be…

概率论 · 数学 2011-12-22 Martien C. A. van Zuijlen

Let $\log^{2+\varepsilon} n \le d \le n/2$ for some fixed $\varepsilon \in (0,1)$, and let $M_n$ be an $n\times n$ random matrix with entries in ${0,1}$, where each row is independently and uniformly sampled from the set of all vectors in…

概率论 · 数学 2026-04-14 Dongbin Li , Alexander E. Litvak , Tingzhou Yu

Within the Kolmogorov theory of probability, Bayes' rule allows one to perform statistical inference by relating conditional probabilities to unconditional probabilities. As we show here, however, there is a continuous set of alternative…

概率论 · 数学 2014-12-05 Samuel G. Rodriques

Let A be a matrix whose entries are real i.i.d. centered random variables with unit variance and suitable moment assumptions. Then the smallest singular value of A is of order n^{-1/2} with high probability. The lower estimate of this type…

概率论 · 数学 2016-12-23 Mark Rudelson , Roman Vershynin

We investigate the weighted Bojanov-Chebyshev extremal problem for trigonometric polynomials, that is, the minimax problem of minimizing $\|T\|_{w,C({\mathbb T})}$, where $w$ is a sufficiently nonvanishing, upper bounded, nonnegative weight…

经典分析与常微分方程 · 数学 2023-09-13 Béla Nagy , Szilárd Gy. Révész

For arbitrary Borel probability measures with compact support on the real line, characterizations are established of the best finitely supported approximations, relative to three familiar probability metrics (Levy, Kantorovich, and…

概率论 · 数学 2018-03-29 Arno Berger , Chuang Xu

Many statistical hypotheses can be formulated in terms of polynomial equalities and inequalities in the unknown parameters and thus correspond to semi-algebraic subsets of the parameter space. We consider large sample asymptotics for the…

统计理论 · 数学 2009-04-03 Mathias Drton

In this short note, we address two problems in extremal set theory regarding intersecting families. The first problem is a question posed by Kupavskii: is it true that given two disjoint cross-intersecting families $\mathcal{A}, \mathcal{B}…

组合数学 · 数学 2018-05-01 Hao Huang

Every element $\theta=(\theta_1,\ldots,\theta_n)$ of the probability $n$-simplex induces a probability distribution $P_\theta$ of a random variable $X$ that can assume only a finite number of real values $x_1 < \cdots < x_n$ by defining…

概率论 · 数学 2020-09-08 S. Fried

Let $(\epsilon_i)$ be a Rademacher sequence, i.e., a sequence of independent and identically distributed random variables satisfying $P(\epsilon_i=1)=P(\epsilon_i=-1)=1/2$. Set $S_n=a_1\epsilon_1+\cdots+a_n\epsilon_n$ for…

概率论 · 数学 2023-10-26 Shi-Zhen Liu , Ze-Yu Tao , Ze-Chun Hu

A random variable $\xi$ has a {\it light-tailed} distribution (for short: is light-tailed) if it possesses a finite exponential moment, $\E \exp (\lambda \xi) <\infty$ for some $\lambda >0$, and has a {\it heavy-tailed} distribution (is…

概率论 · 数学 2026-03-09 Sergey Foss , Michael Scheutzow , Anton Tarasenko

We present a simple proof to a fact recently established in [5]: let $\xi$ be a symmetric random variable that has variance $1$, let $\Gamma=(\xi_{ij})$ be an $N \times n$ random matrix whose entries are independent copies of $\xi$, and set…

泛函分析 · 数学 2019-02-06 Shahar Mendelson

Let $X_N$ be a $N \times N$ real Wishart random matrix with aspect ratio $M/N$. The limit eigenvalue distribution of $X_N$ is the Marchenko-Pastur law with parameter $c = \lim_N M/N$. The limit moments $\{m_n\}_n$ are given by $m_n =…

概率论 · 数学 2025-07-30 James A. Mingo , Josue Vazquez-Becerra

Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…

概率论 · 数学 2019-11-13 Dainius Dzindzalieta , Matas Šileikis , Tomas Juškevičius