English
Related papers

Related papers: On approximation by random L\"uroth expansions

200 papers

We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…

Probability · Mathematics 2007-05-23 Mathew D. Penrose , J. E. Yukich

In this article we generalize the classical Edgeworth expansion for the probability density function (PDF) of sums of a finite number of symmetric independent identically distributed random variables with a finite variance to sums of…

Statistical Mechanics · Physics 2015-05-20 Netanel Hazut , Shlomi Medalion , David A. Kessler , Eli Barkai

We establish two theorems for assessing the accuracy in total variation of multivariate discrete normal approximation to the distribution of an integer valued random vector $W$. The first is for sums of random vectors whose dependence…

Probability · Mathematics 2018-07-19 A. D. Barbour , A. Xia

Motivated by recent work of George Andrews and Mircea Merca on the expansion of the quotient of the truncation of Euler's pentagonal number series by the complete series, we provide similar expansion results for averages involving…

Combinatorics · Mathematics 2023-12-27 Michael J. Schlosser , Nian Hong Zhou

We prove large deviation principles (LDPs) for random matrices in the orthogonal group and Stiefel manifold, determining both the speed and good convex rate functions that are explicitly given in terms of certain log-determinants of…

Probability · Mathematics 2022-11-04 Zakhar Kabluchko , Joscha Prochno

It is well-known that for a quickly increasing sequence $(n_k)_{k \geq 1}$ the functions $(\cos 2 \pi n_k x)_{k \geq 1}$ show a behavior which is typical for sequences of independent random variables. If the growth condition on $(n_k)_{k…

Number Theory · Mathematics 2014-03-10 Christoph Aistleitner , Katusi Fukuyama

Let $g$, $h$ be a random pair of generators of $G=Sym(n)$ or $G=Alt(n)$. We show that, with probability tending to $1$ as $n\to \infty$, (a) the diameter of $G$ with respect to $S = \{g,h,g^{-1},h^{-1}\}$ is at most $O(n^2 (\log n)^c)$, and…

Group Theory · Mathematics 2014-03-11 Harald A. Helfgott , Ákos Seress , Andrzej Zuk

Using the LePage representation, a strictly stable random element in a Banach space with $\alpha\in(0,2)$ can be represented as a sum of points of a Poisson process. This point process is union-stable, i.e. the union of its two independent…

Probability · Mathematics 2007-05-23 Youri Davydov , Ilya Molchanov , Sergei Zuyev

The Minkowski's Question-Mark function is a singular homeomorphism of the unit interval that maps the set of quadratic surds into the rationals. This function has deserved the attention of several authors since the beginning of the…

Dynamical Systems · Mathematics 2014-07-02 Aubin Arroyo

This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

Probability · Mathematics 2019-11-14 Joel Friedman , David Kohler

A sequence $(x_n)$ in a lattice-normed space $(X,p,E)$ is statistical $p$-convergent to $x\in X$ if there exists a statistical $p$-decreasing sequence $q\stpd 0$ with an index set $K$ such that $\delta(K)=1$ and $p(x_{n_k}-x)\leq q_{n_k}$…

Functional Analysis · Mathematics 2022-04-25 Abdullah Aydın , Reha Yapalı , Erdal Korkmaz

The main result of this article establishes strong convergence rates on the whole probability space for explicit space-time discrete numerical approximations for a class of stochastic evolution equations with possibly non-globally monotone…

Probability · Mathematics 2020-01-15 Martin Hutzenthaler , Arnulf Jentzen , Felix Lindner , Primož Pušnik

$ \newcommand{\kalg}{{k_{\mathrm{alg}}}} \newcommand{\kopt}{{k_{\mathrm{opt}}}} \newcommand{\algset}{{T}} \renewcommand{\Re}{\mathbb{R}} \newcommand{\eps}{\varepsilon} \newcommand{\pth}[2][\!]{#1\left({#2}\right)} \newcommand{\npoints}{n}…

Computational Geometry · Computer Science 2017-07-04 Avrim Blum , Sariel Har-Peled , Benjamin Raichel

We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex…

Combinatorics · Mathematics 2017-09-28 Jaehoon Kim , Daniela Kühn , Deryk Osthus , Mykhaylo Tyomkyn

A step reinforced random walk is a discrete time process with memory such that at each time step, with fixed probability $p \in (0,1)$, it repeats a previously performed step chosen uniformly at random while with complementary probability…

Probability · Mathematics 2022-10-04 Alejandro Rosales-Ortiz

We establish arithmetical properties and provide essential bounds for bi-sequences of approximation coefficients associated with the natural extension of maps, leading to continued fraction-like expansions. These maps are realized as the…

Number Theory · Mathematics 2012-11-22 Avraham Bourla

This article studies some numerical approximations of the homogenized matrix for stochastic linear elliptic partial differential equations in divergence form. We focus on the case when the underlying random field is a small perturbation of…

Numerical Analysis · Mathematics 2011-02-21 Ronan Costaouec

We introduce a parametrised family of maps $\{S_{\eta}\}_{\eta \in [1,2]}$, called symmetric doubling maps, defined on $[-1,1]$ by $S_\eta (x)=2x-d\eta$, where $d\in \{-1,0,1 \}$. Each map $S_\eta$ generates binary expansions with digits…

Dynamical Systems · Mathematics 2019-03-12 Karma Dajani , Charlene Kalle

A common tool in the practice of Markov Chain Monte Carlo is to use approximating transition kernels to speed up computation when the desired kernel is slow to evaluate or intractable. A limited set of quantitative tools exist to assess the…

Probability · Mathematics 2026-01-14 Jeffrey Negrea , Jeffrey S. Rosenthal

Let $S_r(p,q)$ be the $r$-associated Stirling numbers of the second kind, the number of ways to partition a set of size $p$ into $q$ subsets of size at least $r$. For $r=1$, these are the standard Stirling numbers of the second kind, and…

Combinatorics · Mathematics 2024-09-04 E. Rodney Canfield , J. William Helton , Jared A. Hughes