English
Related papers

Related papers: Polynomial Time Computable Triangular Arrays For A…

200 papers

We prove the analogue of the Martingale Convergence Theorem for polynomial spline sequences. Given a natural number $k $ and a sequence $(t_i)$ of knots in $[0,1]$ with multiplicity $\le k-1$, we let $P_n $ be the orthogonal projection onto…

Functional Analysis · Mathematics 2019-09-17 Paul F. X. Müller , Markus Passenbrunner

Let $\{Z_n\}_{n\geq 0 }$ be a $d$-dimensional supercritical branching random walk started from the origin. Write $Z_n(S)$ for the number of particles located in a set $S\subset\mathbb{R}^d$ at time $n$. Denote by…

Probability · Mathematics 2023-07-19 Shuxiong Zhang

We characterize the limiting distributions of random variables of the form $P_n\left( (X_i)_{i \ge 1} \right)$, where: (i) $(P_n)_{n \ge 1}$ is a sequence of multivariate polynomials, each potentially involving countably many variables;…

Probability · Mathematics 2024-12-10 Ronan Herry , Dominique Malicet , Guillaume Poly

Brownian motion and scaled and interpolated simple random walk can be jointly embedded in a probability space in such a way that almost surely the $n$-step walk is within a uniform distance $O(n^{-1/2}\log n)$ of the Brownian path for all…

Logic · Mathematics 2014-08-12 Bjørn Kjos-Hanssen , Tamás Szabados

Let $B_n(m)$ be a set picked uniformly at random among all $m$-elements subsets of $\{1,2,\ldots,n\}$. We provide a pathwise construction of the collection $(B_n(m))_{1\leq m\leq n}$ and prove that the logarithm of the least common multiple…

Probability · Mathematics 2020-04-14 Dariusz Buraczewski , Alexander Iksanov , Alexander Marynych

We consider certain Fibonacci-like sequences $(X_n)_{n\geq 0}$ perturbed with a random noise. Our main result is that $\frac{1}{X_n}\sum_{k=0}^{n-1}X_k$ converges in distribution, as $n$ goes to infinity, to a random variable $W$ with…

Probability · Mathematics 2017-09-18 Alexander Roitershtein , Zhirou Zhou

We give an explicit sequence of polarizations such that for every measurable function, the sequence of iterated polarizations converge to the symmetric rearrangement of the initial function.

Functional Analysis · Mathematics 2009-12-22 Jean Van Schaftingen

Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…

Rings and Algebras · Mathematics 2009-09-30 Bau-Sen Du

Knowing a sequence of moments of a given, infinitely supported, distribution we obtain quickly: coefficients of the power series expansion of monic polynomials $\left\{ p_{n}\right\} _{n\geq 0}$ that are orthogonal with respect to this…

Analysis of PDEs · Mathematics 2014-12-30 Paweł J. Szabłowski

Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the…

Data Analysis, Statistics and Probability · Physics 2011-08-26 Seung-Woo Son , Golnoosh Bizhani , Claire Christensen , Peter Grassberger , Maya Paczuski

We consider a random walk X_n in Z_+, starting at X_0=x>= 0, with transition probabilities P(X_{n+1}=X_n+1|X_n=y>=1)=1/2-\delta/(4y+2\delta) P(X_{n+1}=X_n+1|X_n=y>=1)=1/2+\delta/(4y+2\delta) and X_{n+1}=1 whenever X_n=0. We prove that the…

Probability · Mathematics 2009-11-13 Joël De Coninck , François Dunlop , Thierry Huillet

We consider a one-dimensional random walk $S_n$ with i.i.d. increments with zero mean and finite variance. We study the asymptotic expansion for the tail distribution $\mathbf P(\tau_x>n)$ of the first passage times…

Probability · Mathematics 2024-01-19 Denis Denisov , Alexander Tarasov , Vitali Wachtel

For any real number $p > 0$, we nearly completely characterize the space complexity of estimating $\|A\|_p^p = \sum_{i=1}^n \sigma_i^p$ for $n \times n$ matrices $A$ in which each row and each column has $O(1)$ non-zero entries and whose…

Data Structures and Algorithms · Computer Science 2017-03-21 Yi Li , David P. Woodruff

This paper presents both a proof method and a result. The proof method presented is particularly suitable for uniformly proving families of identities satisfied by a family of recursive sequences. To illustrate the method, we study the…

Combinatorics · Mathematics 2021-07-09 Russell Jay Hendel

We consider the Pickands process {equation*} P_{n}(s)=\log (1/s)^{-1}\log \frac{X_{n-k+1,n}-X_{n-[k/s]+1,n}}{% X_{n-[k/s]+1,n}-X_{n-[k/s^{2}]+1,n}}, {equation*} {equation*} (\frac{k}{n}\leq s^2 \leq 1), {equation*} which is a generalization…

Methodology · Statistics 2011-11-21 Gane Samb Lo , Adja Mbarka Fall

The arithmetic average of the first $n$ primes, $\bar p_n = {1\over n} \sum_{i=1}^n p_i$, exhibits very many interesting and subtle properties. Since the transformation from $p_n \to \bar p_n$ is extremely easy to invert, $p_n = n\bar p_n -…

Number Theory · Mathematics 2025-07-17 Matt Visser

Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…

Combinatorics · Mathematics 2024-06-28 Roy Meshulam , Omer Moyal

Let $P_n^1,\dots, P_n^d$ be $n\times n$ permutation matrices drawn independently and uniformly at random, and set $S_n^d:=\sum_{\ell=1}^d P_n^\ell$. We show that if $\log^{12}n/(\log \log n)^{4} \le d=O(n)$, then the empirical spectral…

Probability · Mathematics 2018-04-05 Anirban Basak , Nicholas Cook , Ofer Zeitouni

Let $\{X_i\}$ be a sequence of independent identically distributed random variables with an intermediate regularly varying (IR) right tail $\bar{F}$. Let $(N, C_1, ..., C_N)$ be a nonnegative random vector independent of the $\{X_i\}$ with…

Probability · Mathematics 2012-04-18 Mariana Olvera-Cravioto

We study the complexity of representing polynomials as a sum of products of polynomials in few variables. More precisely, we study representations of the form $$P = \sum_{i = 1}^T \prod_{j = 1}^d Q_{ij}$$ such that each $Q_{ij}$ is an…

Computational Complexity · Computer Science 2015-04-24 Mrinal Kumar , Shubhangi Saraf