English
Related papers

Related papers: Polynomial Time Computable Triangular Arrays For A…

200 papers

Let $S_n^{(2)}$ denote the iterated partial sums. That is, $S_n^{(2)}=S_1+S_2+ ... +S_n$, where $S_i=X_1+X_2+ ... s+X_i$. Assuming $X_1, X_2,....,X_n$ are integrable, zero-mean, i.i.d. random variables, we show that the persistence…

Probability · Mathematics 2015-06-05 Amir Dembo , Jian Ding , Fuchang Gao

Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated , in particular when X 1 is not…

Probability · Mathematics 2020-10-20 Thierry Klein , Agnès Lagnoux , Pierre Petit

Let X_1,X_2, . . . be a sequence of i.i.d. mean zero random variables and let S_n the sum of the first n random variables. We show that whenever lim sup_n |S_n|/c_n is finite with probability one and the normalizing sequence {c_n} is…

Probability · Mathematics 2007-05-23 Uwe Einmahl

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.…

Probability · Mathematics 2012-03-27 Charles Bordenave , Pietro Caputo , Djalil Chafai

Let $x \in \mathbb{R}$ be arbitrary and consider the `greedy' approximation of $x$ by signed harmonic sums: given $a_n = \sum_{k \leq n} \varepsilon_k/k$ with $\varepsilon_k \in \left\{-1,1\right\}$, we set $\varepsilon_{n+1} = 1$ if $a_n…

Dynamical Systems · Mathematics 2025-08-05 Stefan Steinerberger

Two new information-theoretic methods are introduced for establishing Poisson approximation inequalities. First, using only elementary information-theoretic techniques it is shown that, when $S_n=\sum_{i=1}^nX_i$ is the sum of the (possibly…

Probability · Mathematics 2010-10-21 Ioannis Kontoyiannis , Peter Harremoes , Oliver Johnson

We consider a notion of uniform thinning for a finite sequence of random variables $(X_1,...,X_n)$ obtained by removing one random variable, uniformly at random. If a triangular array of random variables $(X_{n,k} : n \in \mathbb{N}_+, 1…

Probability · Mathematics 2007-05-23 Shannon Starr

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…

Probability · Mathematics 2009-12-11 A. D. Barbour , E. Kowalski , A. Nikeghbali

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

Functional Analysis · Mathematics 2025-04-04 Michael Anshelevich , Anh Nguyen

Let $S_n$ be a centered random walk with a finite variance, and define the new sequence $A_n:=\sum_{i=1}^n S_i$, which we call an integrated random walk. We are interested in the asymptotics of $$p_N:=P(\min_{1 \le k \le N} A_k \ge 0)$$ as…

Probability · Mathematics 2010-05-06 Vladislav Vysotsky

Given a multiset $X=\{x_1,..., x_n\}$ of real numbers, the {\it floating-point set summation} problem asks for $S_n=x_1+...+x_n$. Let $E^*_n$ denote the minimum worst-case error over all possible orderings of evaluating $S_n$. We prove that…

Data Structures and Algorithms · Computer Science 2024-09-21 Ming-Yang Kao , Jie Wang

Let $\mathcal{C}=\{C_1,\ldots,C_n\}$ be a set of $n$ pairwise-disjoint convex sets of constant description complexity, and let $\pi$ be a probability density function (pdf for short) over the non-negative reals. For each $i$, let $K_i$ be…

Computational Geometry · Computer Science 2013-10-22 Pankaj Agarwal , Sariel Har-Peled , Haim Kaplan , Micha Sharir

We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose…

Functional Analysis · Mathematics 2013-01-16 Almut Burchard , Marc Fortier

A permutation $\pi \in S_n$ is said to {\it avoid} a permutation $\sigma \in S_k$ whenever $\pi$ contains no subsequence with all of the same pairwise comparisons as $\sigma$. For any set $R$ of permutations, we write $S_n(R)$ to denote the…

Combinatorics · Mathematics 2007-05-23 Eric S. Egge , Toufik Mansour

For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…

Probability · Mathematics 2024-04-08 Marcus Michelen , Sean O'Rourke

Under the Strong Exponential Time Hypothesis, an integer linear program with $n$ Boolean-valued variables and $m$ equations cannot be solved in $c^n$ time for any constant $c < 2$. If the domain of the variables is relaxed to $[0,1]$, the…

Data Structures and Algorithms · Computer Science 2019-04-11 Joshua Brakensiek , Venkatesan Guruswami

We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$…

Classical Analysis and ODEs · Mathematics 2026-03-19 Stefan Kahler , Josef Obermaier

Let $\{X, X_n, n\geq 1\}$ be a sequence of independent identically distributed non-degenerate random variables. Put $S_0=0, S_n = \sum^n_{i=1} X_i$ and $V_n^2=\sum^n_{i=1} X_i^2, n\ge 1.$ A weak convergence theorem is established for the…

Probability · Mathematics 2013-06-21 Miklós Csörgő , Zhishui Hu

We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…

Probability · Mathematics 2012-04-12 Olivier Raimond , Bruno Schapira

We investigate here sums of triangular numbers $f(x):=\sum_i b_i T_{x_i}$ where $T_n$ is the $n$-th triangular number. We show that for a set of positive integers $S$ there is a finite subset $S_0$ such that $f$ represents $S$ if and only…

Number Theory · Mathematics 2009-09-15 Ben Kane
‹ Prev 1 2 3 10 Next ›