Related papers: Some compact notations for concentration inequalit…
We give a new proof of the compactness of minimizing sequences of the Sobolev inequalities in the critical case. Our approach relies on a simplified version of the concentration-compactness principle, which does not require any refinement…
Symbolic relative entropy, an efficient nonlinear complexity parameter measuring probabilistic divergences of symbolic sequences, is proposed in our nonlinear dynamics analysis of heart rates considering equal states. Equalities are not…
We introduce new invariants associated to collections of compact subsets of a symplectic manifold. They are defined through an elementary-looking variational problem involving Poisson brackets. The proof of the non-triviality of these…
We introduce amorphic complexity as a new topological invariant that measures the complexity of dynamical systems in the regime of zero entropy. Its main purpose is to detect the very onset of disorder in the asymptotic behaviour. For…
Multivariate regular variation plays a role assessing tail risk in diverse applications such as finance, telecommunications, insurance and environmental science. The classical theory, being based on an asymptotic model, sometimes leads to…
An infinite convergent sum of independent and identically distributed random variables discounted by a multiplicative random walk is called perpetuity, because of a possible actuarial application. We give three disjoint groups of sufficient…
We study the characteristic function and moments of the integer-valued random variable $\lfloor X+\alpha\rfloor$, where $X$ is a continuous random variables. The results can be regarded as exact versions of Sheppard's correction. Rounded…
Concentration results and probabilistic analysis for combinatorial problems like the TSP, MWST, graph coloring have received much attention, but generally, for i.i.d. samples (i.i.d. points in the unit square for the TSP, for example).…
We clarify the asymptotic of the limsup of the size of the neighborhood of concentration of Sinai's walk improving the result in \cite{Pierre3}. Also we get the almost sure limit of the number of points visited more than a small but fixed…
In this paper, we derive variational formulas for the asymptotic exponents (i.e., convergence rates) of the concentration and isoperimetric functions in the product Polish probability space under certain mild assumptions. These formulas are…
In this paper two properties of recognized interest in variational analysis, known as Lipschitz lower semicontinuity and calmness, are studied with reference to a general class of variational systems, i.e. to solution mappings to…
The notion of weak cyclic monotonicity of set-valued maps generalizing the cyclic monotonicity is introduced. The existence of solutions of differential inclusions with compact, upper semi-continuous, not necessarily convex right-hand sides…
In this article two methods to distinguish between polynomial and exponential tails are introduced. The methods are mainly based on the properties of the residual coefficient of variation for the exponential and non-exponential…
We study settings where gradient penalties are used alongside risk minimization with the goal of obtaining predictors satisfying different notions of monotonicity. Specifically, we present two sets of contributions. In the first part of the…
Approximate Bayesian computation allows for statistical analysis in models with intractable likelihoods. In this paper we consider the asymptotic behaviour of the posterior distribution obtained by this method. We give general results on…
Let F be a distribution function with negative mean and regularly varying right tail. Under a mild smoothness condition we derive higher order asymptotic expansions for the tail distribution of the maxima of the random walk generated by F.…
Probabilistic puzzles can be confusing, partly because they are formulated in natural languages - full of unclarities and ambiguities - and partly because there is no widely accepted and intuitive formal language to express them. We propose…
We present a technique for approximating generic normalization constants subject to constraints. The method is then applied to derive the exact asymptotics for the conditional normalization constant of constrained exponential random graphs.
Sums of independent, bounded random variables concentrate around their expectation approximately as well a Gaussian of the same variance. Well known results of this form include the Bernstein, Hoeffding, and Chernoff inequalities and many…
On the one hand, classical terminological knowledge representation excludes the possibility of handling uncertain concept descriptions involving, e.g., "usually true" concept properties, generalized quantifiers, or exceptions. On the other…