Searcharxiv⌕ Search

arXiv subjects

Iosif Pinelis

Publications and source records attributed to Iosif Pinelis.

103 records · Page 6Linked to original sources

Binomial upper bounds on generalized moments and tail probabilities of (super)martingales with differences bounded from above

Let $(S_0,S_1,...)$ be a supermartingale relative to a nondecreasing sequence of $σ$-algebras $H_{\le0},H_{\le1},...$, with $S_0\le0$ almost surely (a.s.) and differences $X_i:=S_i-S_{i-1}$. Suppose that $X_i\le d$ and $\mathsf {Var}(X_i|H_{\le i-1})\le σ_i^2$ a.s. for every $i=1,2,...$, where $d>0$ and $σ_i>0$ are non-random constants. Let $T_n:=Z_1+...+Z_n$, where $Z_1,...,Z_n$ are i.i.d. r.v.'s each taking on only two values, one of which is $d$, and satisfying the conditions $\mathsf {E}Z_i=0$ and $\mathsf {Var}Z_i=σ^2:=\frac{1}{n}(σ_1^2+...+σ_n^2)$. Then, based on a comparison inequality between generalized moments of $S_n$ and $T_n$ for a rich class of generalized moment functions, the tail comparison inequality $$ \mathsf P(S_n\ge y) \le c \mathsf P^{\mathsf Lin,\mathsf L C}(T_n\ge y+\tfrach2)\quad\forall y\in \mathbb R$$ is obtained, where $c:=e^2/2=3.694...$, $h:=d+σ^2/d$, and the function $y\mapsto \mathsf {P}^{\mathsf {Lin},\mathsf {LC}}(T_n\ge y)$ is the least log-concave majorant of the linear interpolation of the tail function $y\mapsto \mathsf {P}(T_n\ge y)$ over the lattice of all points of the form $nd+kh$ ($k\in \mathbb {Z}$). An explicit formula for $\mathsf {P}^{\mathsf {Lin},\mathsf {LC}}(T_n\ge y+\tfrac{h}{2})$ is given. Another, similar bound is given under somewhat different conditions. It is shown that these bounds improve significantly upon known bounds.

math.PR↗

An order-refined and generalized version of the Erdos-Szekeres theorem on convex polygons

The Erdos-Szekeres theorem states that for any natural k there is a natural number g(k) such that any set of at least g(k) points on a plane in general position contains a set of k points that are the extreme points of a convex polytope. We generalize and refine this theorem, having the general-position condition removed and a convex polygon defined as an ordered sequence of points such that the union of the edges of the polygon coincides with the boundary of its convex hull.

math.CO↗

"Non-strict" l'Hospital-Type Rules for Monotonicity: Intervals of Constancy

Assuming that a "derivative" ratio rho:=f'/g' of the ratio r:=f/g of differentiable functions f and g is strictly monotonic (that is, rho is increasing or decreasing), it was shown in previous papers that then r can switch at most once, from decrease to increase or vice versa. In the present paper, it is shown that, if rho is non-strictly monotonic (that is, non-increasing or non-decreasing), then r can have at most one maximal interval of constancy (m.i.c.); on the other hand, any one m.i.c. of a given derivative ratio rho is the m.i.c. of an appropriately constructed original ratio r.

math.CA↗

L'Hospital-type rules for monotonicity and limits: Discrete case

Assuming that a "derivative" ratio rho:=f'/g' of the ratio r:=f/g of differentiable functions f and g is monotonic (that is, rho is increasing or decreasing), it was shown in previous papers that then r can switch at most once, from decrease to increase or vice versa. In the present paper, "discrete" versions of such l'Hospital-type rules for monotonicity (as well as "discrete" versions of l'Hospital's rules for limits) are obtained, for functions f and g defined on an interval of integers.

math.CA↗

A Characterization of the Convexity of Cyclic Polygons in Terms of the Central Angles

Let P be a cyclic n-gon with n\ge3, the central angles þ_0,...,þ_{n-1} in (-π,π], and the winding number w:=(þ_0+...+þ_{n-1})/(2π). The vertices of P are assumed to be all distinct from one another. It is then proved that P is convex if and only if one of the following four conditions holds: (I) w=1 and þ_0,...,þ_{n-1}>0; (II) w=-1 and þ_0,...,þ_{n-1}<0; (III) w=0 and exactly one of the angles þ_0,...,þ_{n-1} is negative; (IV) w=0 and exactly one of the angles þ_0,...,þ_{n-1} is positive.

math.GM↗

Convexity of Sub-polygons of Convex Polygons

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices {V_0,...,V_{n-1}}. It is proved that all sub-polygons of any convex polygon with distinct vertices are convex. It is also proved that, if all sub-(n-1)-gons of an n-gon with n\ge5 are convex, then the n-gon is convex. Other related results are given.

math.GM↗

Student's t-test without symmetry conditions

An explicit representation of an arbitrary zero-mean distribution as the mixture of (at-most-)two-point zero-mean distributions is given. Based in this representation, tests for (i) asymmetry patterns and (ii) for location without symmetry conditions can be constructed. Exact inequalities implying conservative properties of such tests are presented. These developments extend results established earlier by Efron, Eaton, and Pinelis under a symmetry condition.

math.ST↗

Exact inequalities for sums of asymmetric random variables, with applications

Let $\BS_1,...,\BS_n$ be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter $p\in(0,1)$. Let $m_*(p):=(1+p+2p^2)/(2\sqrt{p-p^2}+4p^2)$ if $0<p\le 1/2$ and $m_*(p):=1$ if $1/2\le p<1$. Let $m\ge m_*(p)$. Let $f$ be such a function that $f$ and $f''$ are nondecreasing and convex. Then it is proved that for all nonnegative numbers $c_1,...,c_n$ one has the inequality $$\E f(c_1\BS_1+...+c_n\BS_n)\le\E f(s^{(m)}\cdot(\BS_1+...+\BS_n)),$$ where $s^{(m)}:=(\frac1n \sum_{i=1}^n c_i^{2m})^\frac1{2m}$. The lower bound $m_*(p)$ on $m$ is exact for each $p\in(0,1)$. Moreover, $\E f(c_1\BS_1+...+c_n\BS_n)$ is Schur-concave in $(c_1^{2m},...,c_n^{2m})$. A number of related results are presented, including ones for the ``symmetric'' case. A number of corollaries are obtained, including upper bounds on generalized moments and tail probabilities of (super)martingales with differences of bounded asymmetry, and also upper bounds on the maximal function of such (super)martingales. It is shown that these results may be important in certain statistical applications.

math.PR↗

Toward the best constant factor for the Rademacher-Gaussian tail comparison

Let S_n:=a_1\vp_1+...+a_n\vp_n, where \vp_1,...,\vp_n are independent Rademacher random variables (r.v.'s) and a_1,...,a_n are any real numbers such that a_1^2+...+a_n^2=1. Let Z be a standard normal r.v. It is proved that the best constant factor c in inequality ¶(S_n>x) \leq c¶(Z>x) for all x in \R is between two explicitly defined absolute constants c_1 and c_2 such that c_1<c_2 \approx 1.01c_1.

math.PR↗

On inequalities for sums of bounded random variables

Let $η_{1},η_2,...$ be independent (not necessarily identically distributed) zero-mean random variables (r.v.'s) such that $|η_i|\le1$ almost surely for all $i$, and let $Z$ stand for a standard normal r.v. Let $a_1,a_2,...$ be any real numbers such that $a_1^2+a_2^2+...=1.$ It is shown that then $$ ¶(a_1η_1+a_2η_2+...\ge x) \le ¶(Z\ge x-\la/x) \forall x>0, $$ where $\la := \ln\frac{2e^3}9=1.495...$. The proof relies on (i) another probability inequality and (ii) a l'Hospital-type rule for monotonicity, both developed elsewhere. A multidimensional analogue of this result is given, based on a dimensionality reduction device, also developed elsewhere. In addition, extensions to (super)martingales are indicated.

math.PR↗

Normal domination of (super)martingales

Let (S_0,S_1,...) be a supermartingale relative to a nondecreasing sequence of σ-algebras (H_{\le0},H_{\le1},...), with S_0\le0 almost surely (a.s.) and differences X_i:=S_i-S_{i-1}. Suppose that for every i=1,2,... there exist H_{\le(i-1)}-measurable r.v.'s C_{i-1} and D_{i-1} and a positive real number s_i such that C_{i-1}\le X_i\le D_{i-1} and D_{i-1}-C_{i-1}\le 2 s_i a.s. Then for all real t and natural n one has \E f_t(S_n)\le\E f_t(sZ), where f_t(x):=\max(0,x-t)^5, s:=\sqrt{s_1^2+...+s_n^2}, and Z is N(0,1). In particular, this implies P(S_n\ge x)\le c_{5,0}P(Z\ge x/s) for all x in \R, where c_{5,0}=5!(e/5)^5=5.699.... Results for \max_{0\le k\le n}S_k in place of S_n and for concentration of measure also follow.

math.PR↗

Generalized Lorentzian Adjustment of Reference Frames and Waves of Transformation of Spacetime

It is demonstrated that any two reference frames (RFs), which are uniformly and rectilinearly moving relative to each other, can be adjusted via (possibly anisotropic) rescaling and re-synchronization so that the resulting pair of RFs is Lorentzian; this statement remains true if the word "Lorentzian" is replaced by "Galilean" or "Riemannian", i.e., if a finite positive value of $c^2$ is replaced by $\infty$ or by a negative real number. In this particular sense, the Lorentzian, as well as Galilean or Riemannian, phenomenon turns out to be merely a matter of an arbitrary choice of appropriate rescaling and re-synchronization of any given pair of RFs. Generalizations and refinements of this result are obtained, including universal generalized Lorentzian adjustment via rescaling and re-synchronization of arbitrarily large families of RFs. Alternatively, the generalized Lorentzian property of a pair of RFs is shown to be a consequence of reciprocity and isotropy, with no adjustment needed in this case. The universality of light and of the corresponding Lorentzian property of the spacetime is questioned. Waves of transformation of spacetime are introduced, which have in a certain sense a more universal character than electromagnetic or gravitational waves.

physics.class-ph↗