相关论文: The LIL for canonical $U$-statistics
In this paper, we discuss the laws of the iterated logarithm (LIL) for occupation times of Markov processes $Y$ in general metric measure space both near zero and near infinity under some minimal assumptions. We first establish LILs of…
We derive exponential bounds for tail of distribution for natural, i.e. under ordinary logarithm, normalized sums of arrays of random variables, not necessarily independent.
It is known that the set of log canonical thresholds (lcts) on any varieties with fixed dimension satisfies the ascending chain condition. Inspired by the foliated minimal model program, it is intriguing to study the foliated version of…
We give an analytic proof of the norm index theorem $[I_:K^* N(I_L)] =[L:K]$ for cyclic extensions of number fields using spectral theory of the idele class group.
This paper investigates the behavior of statistical ensembles under iteration map induced by discrete integrable Hamiltonian systems in deterministic case and stochastic case, addressing the problem from two perspectives: the Law of Large…
Non-iterative normal modal logics are defined by axioms of modal degree 1. In this paper we use calculations with normal forms to determine the set of all possible non-iterative normal modal logics, unimodal propositional extensions of K.…
In this paper non-asymptotic exponential estimates are derived for tail of maximum martingale distribution by naturally norming in the spirit of the classical Law of Iterated Logarithm. Key words: Martingales, exponential estimations,…
For a fixed positive integer $\;k,\;$ limit laws of linearly normalized $\;k$-th upper order statistics are well known. In this article, a comprehensive study of tail behaviours of limit laws of normalized $k$-th upper order statistics…
Motivated by applications in declarative data analysis, we study $\mathit{Datalog}_{\mathbb{Z}}$---an extension of positive Datalog with arithmetic functions over integers. This language is known to be undecidable, so we propose two…
We give a dual, separated-tree formulation of Latala's majorizing measure theorem for canonical processes with log-concave tails. Under the same assumptions as in Latala's characterization, we introduce parameterized separation trees and…
We give sufficient conditions for the bounded law of the iterated logarithms for strictly stationary random fields when the summation is done on rectangle. The study is done by the control of an appropriated maximal function. The case of…
In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…
In this paper, motivated by the notion of independent identically distributed (IID) random variables under sub-linear expectations initiated by Peng, we investigate a law of the iterated logarithm for capacities. It turns out that our…
We consider a linear equation $\partial_t u = \mathcal{L}u$, where $\mathcal{L}$ is a generator of a semigroup of linear operators on a certain Hilbert space related to an initial condition $u(0)$ being a generalised stationary random field…
Let $T$ be a bounded linear operator on $L^p$. We study the rate of growth of the norms of the powers of $T$ under resolvent conditions or Ces\`aro boundedness assumptions. Actually the relevant properties of $L^p$ spaces in our study are…
We deduce in this paper the sufficient conditions for weak convergence of centered and normed deviation of the u-statistics with values in the space of the real valued continuous function defined on some compact metric space. We obtain also…
We prove oracle inequalities for a penalized log-likelihood criterion that hold even if the data are not independent and not stationary, based on a martingale approach. The assumptions are checked for various contexts: density estimation…
The population $\mathrm{KL}_{\inf}$ is a fundamental quantity that appears in lower bounds for (asymptotically) optimal regret of pure-exploration stochastic bandit algorithms, and optimal stopping time of sequential tests. Motivated by…
We prove an O(log n) bound for the expectation of the logarithm of the condition number K for the computation of optimizers of linear programs.
We present a procedure for computing the log-canonical threshold of an arbitrary ideal generated by binomials and monomials. The computation of the log canonical threshold is reduced to the problem of computing the minimum of a function,…