相关论文: A Chain Rule for the Expected Suprema of Bernoulli…
In this paper, we establish uniform a priori estimates for positive solutions to the (higher) critical order superlinear Lane-Emden system in bounded domains with Navier boundary conditions in arbitrary dimensions $n\geq3$. First, we prove…
We establish that Laplace transforms of the posterior Dirichlet process converge to those of the limiting Brownian bridge process in a neighbourhood about zero, uniformly over Glivenko-Cantelli function classes. For real-valued random…
We consider the behavior of spatial point processes when subjected to a class of linear transformations indexed by a variable T. It was shown in Ellis [Adv. in Appl. Probab. 18 (1986) 646-659] that, under mild assumptions, the transformed…
We obtain an optimal deviation from the mean upper bound \begin{equation} D(x)\=\sup_{f\in \F}\mu\{f-\E_{\mu} f\geq x\},\qquad\ \text{for}\ x\in\R\label{abstr} \end{equation} where $\F$ is the class of the integrable, Lipschitz functions on…
An upper bound of the expected order of magnitude is established for the number of rational points of bounded height on Ch\^atelet surfaces defined over the rationals.
For a class of systems of semi-linear elliptic equations, including \[ -\Delta u_i=f_i(x,u_i) - \beta u_i\sum_{j\neq i}a_{ij}u_j^p,\qquad i=1,\dots,k, \] for $p=2$ (variational-type interaction) or $p = 1$ (symmetric-type interaction), we…
This paper addresses the question of predicting when a positive self-similar Markov process X attains its pathwise global supremum or infimum before hitting zero for the first time (if it does at all). This problem has been studied in…
A fundamental algorithm for selecting ranks from a finite subset of an ordered set is Radix Selection. This algorithm requires the data to be given as strings of symbols over an ordered alphabet, e.g., binary expansions of real numbers. Its…
We establish sharp global regularity results for solutions to nonhomogeneous, nonunifomrly elliptic systems with zero boundary conditions. In particular, we obtain everywhere Lipschitz continuity under borderline Lorentz assumptions on the…
Trace monoids and heaps of pieces appear in various contexts in combinatorics. They also constitute a model used in computer science to describe the executions of asynchronous systems. The design of a natural probabilistic layer on top of…
The unitarily invariant probability measures on infinite Hermitian matrices have been classified by Pickrell, and by Olshanski and Vershik. This classification is equivalent to determining the boundary of a certain inhomogeneous Markov…
In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…
Cohen and Kontorovich (COLT 2023) initiated the study of what we call here the Binomial Empirical Process: the maximal absolute value of a sequence of inhomogeneous normalized and centered binomials. They almost fully analyzed the case…
It is not uncommon in analysis that existence of extremal objects is obtained via an iterative procedure: we start from a given admissible object, then modify it, then modify again etc... If being extremal means maximimizing a real valued…
Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a…
The well-known von Bahr--Esseen bound on the absolute $p$th moments of martingales with $p\in(1,2]$ is extended to a large class of moment functions, and now with a best possible constant factor (which depends on the moment function). This…
In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. The constrained problem is reduced to a discontinuous unconstrained problem…
A bound uniform over various loss-classes is given for data generated by stationary and phi-mixing processes, where the mixing time (the time needed to obtain approximate independence) enters the sample complexity only in an additive way.…
We study the density of the supremum of a strictly stable L\'evy process. We prove that for almost all values of the index $\alpha$ -- except for a dense set of Lebesgue measure zero -- the asymptotic series which were obtained in A.…
An upper estimate for the Lempert function of any $C^{1+\epsilon}$-smooth bounded domain in $\Bbb C^n$ is found in terms of the boundary distance.