English
Related papers

Related papers: On some estimates for bounded submartingales and t…

200 papers

In 2016, Bourgain, Gamburd, and Sarnak proved that Strong Approximation holds for the Markoff surface in most cases. That is, the modulo $p$ solutions to the equation $X_1^2+X_2^2+X_3^2=3X_1X_2X_3$ are covered by the integer solutions for…

Number Theory · Mathematics 2023-11-21 Elisa Bellah , Siran Chen , Elena Fuchs , Lynnelle Ye

We show that the maximizing point and the supremum of the standardized uniform empirical process converge in distribution. Here, the limit variable (Z, Y ) has independent components. Moreover, Z attains the values zero and one with equal…

Probability · Mathematics 2025-12-22 Dietmar Ferger

We consider the problem of learning Bayesian network classifiers that maximize the marginover a set of classification variables. We find that this problem is harder for Bayesian networks than for undirected graphical models like maximum…

Machine Learning · Computer Science 2012-07-09 Yuhong Guo , Dana Wilkinson , Dale Schuurmans

Scientific explanation often requires inferring maximally predictive features from a given data set. Unfortunately, the collection of minimal maximally predictive features for most stochastic processes is uncountably infinite. In such…

Statistical Mechanics · Physics 2017-05-31 Sarah E. Marzen , James P. Crutchfield

In this paper, we consider optimal control problems derived by stochastic systems with delay, where control domains are non-convex and the diffusion coefficients depend on control variables. By an estimate of the integral of…

Optimization and Control · Mathematics 2022-10-25 Qixia Zhang

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

Computational Geometry · Computer Science 2013-04-15 Natan Rubin

We analyze worst-case convergence guarantees of first-order optimization methods over a function class extending that of smooth and convex functions. This class contains convex functions that admit a simple quadratic upper bound. Its study…

Optimization and Control · Mathematics 2022-05-31 Baptiste Goujaud , Adrien Taylor , Aymeric Dieuleveut

For any quantity of interest in a system governed by ordinary differential equations, it is natural to seek the largest (or smallest) long-time average among solution trajectories, as well as the extremal trajectories themselves. Upper…

Dynamical Systems · Mathematics 2019-04-16 Ian Tobasco , David Goluskin , Charles R. Doering

In this paper we consider unbounded solutions of perturbed convolution Volterra summation equations. The equations studied are asymptotically sublinear, in the sense that the state--dependence in the summation is of smaller than linear…

Dynamical Systems · Mathematics 2016-07-05 John A. D. Appleby , Denis D. Patterson

Given a convex set $C$ in a real vector space $E$ and two points $x,y\in C$, we investivate which are the possible values for the variation $f(y)-f(x)$, where $f:C\longrightarrow [m,M]$ is a bounded convex function. We then rewrite the…

Optimization and Control · Mathematics 2015-03-18 Joon Kwon

Let $X_1,\dots,X_n$ be independent nonnegative random variables (r.v.'s), with $S_n:=X_1+\dots+X_n$ and finite values of $s_i:=E X_i^2$ and $m_i:=E X_i>0$. Exact upper bounds on $E f(S_n)$ for all functions $f$ in a certain class…

Probability · Mathematics 2017-01-17 Iosif Pinelis

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

Probability · Mathematics 2016-11-29 Omer Angel , Richárd Balka , András Máthé , Yuval Peres

Stochastic optimal control problems have a long tradition in applied probability, with the questions addressed being of high relevance in a multitude of fields. Even though theoretical solutions are well understood in many scenarios, their…

Statistics Theory · Mathematics 2024-05-28 Sören Christensen , Claudia Strauch , Lukas Trottner

We establish a local martingale $M$ associate with $f(X,Y)$ under some restrictions on $f$, where $Y$ is a process of bounded variation (on compact intervals) and either $X$ is a jump diffusion (a special case being a L\'evy process) or $X$…

Probability · Mathematics 2017-11-22 Offer Kella , Marc Yor

In the present work, we consider spectrally positive L\'evy processes $(X_t,t\geq0)$ not drifting to $+\infty$ and we are interested in conditioning these processes to reach arbitrarily large heights (in the sense of the height process…

Probability · Mathematics 2012-03-21 Mathieu Richard

This paper studies a class of exponential family models whose canonical parameters are specified as linear functionals of an unknown infinite-dimensional slope function. The optimal minimax rates of convergence for slope function estimation…

Statistics Theory · Mathematics 2011-12-25 Winston Wei Dou , David Pollard , Harrison H. Zhou

R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the $n^{\mathrm{th}}$ tree is uniformly distributed over the set of rooted, planar, binary trees with $2n+1$ vertices. We obtain a…

Probability · Mathematics 2020-03-05 Steven N. Evans , Rudolf Grübel , Anton Wakolbinger

Strassen's classical martingale coupling theorem states that two real-valued random variables are ordered in the convex (resp.\ increasing convex) stochastic order if and only if they admit a martingale (resp.\ submartingale) coupling. By…

Probability · Mathematics 2017-05-11 Lasse Leskelä , Matti Vihola

This paper deals with probabilistic upper bounds for the error in functional estimation defined on some interpolation and extrapolation designs, when the function to estimate is supposed to be analytic. The error pertaining to the estimate…

Statistics Theory · Mathematics 2011-01-26 Michel Broniatowski , Giorgio Celant , Marco Di Battista , Samuela Leoni-Aubin

In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…

Dynamical Systems · Mathematics 2023-06-22 Ronnie Pavlov