English
Related papers

Related papers: The suprema of infinitely divisible processes

200 papers

This article establishes a universal robust limit theorem under a sublinear expectation framework. Under moment and consistency conditions, we show that, for $\alpha \in(1,2)$, the i.i.d. sequence \[ \left \{ \left(…

Probability · Mathematics 2022-10-31 Mingshang Hu , Lianzi Jiang , Gechun Liang , Shige Peng

This paper gives a complete characterization of infinitely divisible semimartingales, i.e., semimartingales whose finite dimensional distributions are infinitely divisible. An explicit and essentially unique decomposition of such…

Probability · Mathematics 2014-05-02 Andreas Basse-O'Connor , Jan Rosinski

This article relaxes the integrability condition imposed in the literature for the robust $\alpha$-stable central limit theorem under sublinear expectation. Specifically, for $\alpha \in(0,1]$, we prove that the normalized sums of i.i.d.…

Probability · Mathematics 2023-01-20 Lianzi Jiang , Gechun Liang

<i>H</i> is the theory extending &#946;-conversion by identifying all closed unsolvables. <i>H</i>&#969; is the closure of this theory under the &#969;-rule (and &#946;-conversion). A long-standing conjecture of H. Barendregt states that…

Logic in Computer Science · Computer Science 2017-01-11 Benedetto Intrigila , Richard Statman

This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is…

Logic in Computer Science · Computer Science 2015-06-08 Benjamin Lucien Kaminski , Joost-Pieter Katoen

While effective concentration inequalities for suprema of empirical processes exist under boundedness or strict tail assumptions, no comparable results have been available under considerably weaker assumptions. In this paper, we derive…

Probability · Mathematics 2014-10-23 Johannes Lederer , Sara van de Geer

We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional…

Combinatorics · Mathematics 2021-05-25 Keith Frankston , Jeff Kahn , Jinyoung Park

We introduce a formal definition of Wolfram's notion of computational process based on cellular automata, a physics-like model of computation. There is a natural classification of these processes into decidable, intermediate and complete.…

Computational Complexity · Computer Science 2009-06-18 Klaus Sutner

We study the supremum of some random Dirichlet polynomials and obtain sharp upper and lower bounds for supremum expectation that extend the optimal estimate of Hal\'asz-Queff\'elec and enable to cunstruct random polynomials with unusually…

Probability · Mathematics 2008-02-01 Mikhail Lifshits , Michel Weber

This note concerns bounded derivations on maximal triangular operator algebras on a Hilbert space. Given any bounded derivation $\delta$ on a maximal triangular algebra whose invariant lattice is continuous at 1, an operator which is shown…

Operator Algebras · Mathematics 2025-08-12 Mark Spivack

We derive an upper bound for the mean of the supremum of the empirical process indexed by a class of functions that are known to have variance bounded by a small constant $\delta$. The bound is expressed in the uniform entropy integral of…

Statistics Theory · Mathematics 2010-12-30 Aad van der Vaart , Jon A. Wellner

We derive, up to a constant factor, matching lower and upper bounds on the concentration functions of suprema of separable centered Gaussian processes and order statistics of Gaussian random fields. These bounds reveal that suprema of…

Probability · Mathematics 2023-10-19 Alexander Giessing

Write $\mathbf{A}_\lambda$ for what might be described as the most elementary nontrivial inverse system of abelian groups indexed by the functions from the cardinal $\lambda$ to the set of natural numbers. The question of whether for any…

Logic · Mathematics 2025-07-09 Jeffrey Bergfalk , Matteo Casarosa

The C_\ell-free process starts with the empty graph on n vertices and adds edges chosen uniformly at random, one at a time, subject to the condition that no copy of C_\ell is created. For every $\ell \geq 4$ we show that, with high…

Combinatorics · Mathematics 2017-12-12 Lutz Warnke

Let $X$ be a bounded c\`adl\`ag process with positive jumps defined on the canonical space of continuous paths. We consider the problem of optimal stopping the process $X$ under a nonlinear expectation operator $\cE$ defined as the supremum…

Probability · Mathematics 2013-02-12 Ibrahim Ekren , Nizar Touzi , Jianfeng Zhang

In the paper we pursue the analysis from the section 5 of the Talagrand's paper "Sample boundedness of stochastic processes under increment conditions." Ann. Probab. 18, No. 1, 1-49. In particular we give the proof of some Sobolev…

Probability · Mathematics 2007-05-23 Witold Bednorz

We consider diffusion processes in Hilbert spaces with constant non-degenerate diffusion operators and show that, under broad assumptions on the drift, the transition probabilities of the process are positive on ellipsoids associated with…

Probability · Mathematics 2016-02-09 Oxana Manita

Let $\mathcal{F}$ be a class of measurable functions on a measurable space $(S,\mathcal{S})$ with values in $[0,1]$ and let \[P_n=n^{-1}\sum_{i=1}^n\delta_{X_i}\] be the empirical measure based on an i.i.d. sample $(X_1,...,X_n)$ from a…

Probability · Mathematics 2016-08-16 Evarist Giné , Vladimir Koltchinskii

We consider the standard thermodynamic processes with constraints, but with additional uncertainty about the control parameters. Motivated by inductive reasoning, we assign prior distribution that provides a rational guess about likely…

Statistical Mechanics · Physics 2014-04-03 Preety Aneja , Ramandeep S. Johal

Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical…

Computational Complexity · Computer Science 2007-05-23 Jean-Charles Delvenne , Petr Kurka , Vincent Blondel