101.28 The versatile exponential inequality ex ⩾ 1 + x

2017 ◽  
Vol 101 (552) ◽  
pp. 470-475
Author(s):  
Nick Lord
2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Guodong Xing ◽  
Shanchao Yang

The exponential inequality for weighted sums of a class of linearly negative quadrant dependent random variables is established, which extends and improves the corresponding ones obtained by Ko et al. (2007) and Jabbari et al. (2009). In addition, we also give the relevant precise asymptotics.


2009 ◽  
Vol 103 (1) ◽  
pp. 50-55
Author(s):  
John Robert Perrin

An algebra problem with a graphical solution challenges precalculus and calculus students to determine an analytical solution.


1999 ◽  
Vol 31 (3) ◽  
pp. 596-609 ◽  
Author(s):  
T. K. Chalker ◽  
A. P. Godbole ◽  
P. Hitczenko ◽  
J. Radcliff ◽  
O. G. Ruehr

We approach sphere of influence graphs (SIGs) from a probabilistic perspective. Ordinary SIGs were first introduced by Toussaint as a type of proximity graph for use in pattern recognition, computer vision and other low-level vision tasks. A random sphere of influence graph (RSIG) is constructed as follows. Consider n points uniformly and independently distributed within the unit square in d dimensions. Around each point, Xi, draw an open ball (‘sphere of influence’) with radius equal to the distance to Xi's nearest neighbour. Finally, draw an edge between two points if their spheres of influence intersect. Asymptotically exact values for the expected number of edges in a RSIG are determined for all values of d; previously, just upper and lower bounds were known for this quantity. A modification of the Azuma-Hoeffding exponential inequality is employed to exhibit the sharp concentration of the number of edges around its expected value.


2011 ◽  
Vol 40 (1) ◽  
pp. 109-114 ◽  
Author(s):  
Soo Hak Sung ◽  
Patchanok Srisuradetchai ◽  
Andrei Volodin

2004 ◽  
Vol 14 (04) ◽  
pp. 409-429 ◽  
Author(s):  
JEAN-CAMILLE BIRGET

We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd–Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linearly decreased (unless it is the identity map). We present a new proof of the Double Exponential Inequality, based on context-free languages.


Sign in / Sign up

Export Citation Format

Share Document