Polynomial time relatively computable triangular arrays for almost sure convergence

DOI10.1215/00192082-7768719zbMath1478.60137arXiv1603.04896OpenAlexW2301931005MaRDI QIDQ2315247

Marina Skyers, Lee J. Stanley, Patricia Garmirian, Vladimir Dobric

Publication date: 2 August 2019

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.04896

zbMATH Keywords

triangular arraysRademacher random variable

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50) Strong limit theorems (60F15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Polynomial time relatively computable triangular arrays for almost sure convergence, Rearrangements of the simple random walk

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Skorohod representation theorem for uniform distance
• Effective dimension of points visited by Brownian motion
• The descriptive complexity of Brownian motion
• A new direct proof of the central limit theorem
• The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
• Uniform constant-depth threshold circuits for division and iterated multiplication.
• Polynomial time relatively computable triangular arrays for almost sure convergence
• Skorohod representation theorem via disintegrations
• Kolmogorov complexity and strong approximation of Brownian motion
• Log Depth Circuits for Division and Related Problems
• Kolmogorov complexity and the geometry of Brownian motion