The integral of a symmetric unimodal function over a symmetric convex set and some probability inequalities
Citations
16 citations
16 citations
16 citations
Cites background or methods from "The integral of a symmetric unimoda..."
...Lemma 4.3. Let m,n ∈ N, n ≤ 2m. Let A,B be (possibly random) n × m matrices, and set W = A ⊙ G + B, where G is the standard n× m Gaussian matrix, independent of A,B. Assume that, a.s., (1) ai,j ∈ {0}∪[r,1] for some constant r > 0 and all i,j; (2) the graph ΓAT is broadly connected. Then for any c0 and any u,v > 0, such that u ≥ c0 and (1+κ/2)u < 1, and for any z ∈ Rn P ∃x ∈ Comp((1+κ/2)u,(v/K)...
[...]
...nd a set of rows of a fixed matrix with big ℓ2 norms, provided that the graph of the matrix has a large minimal degree. Lemma 6.1. Let k < n, and let A be an n ×n matrix. Assume that (1) ai,j ∈ {0}∪[r,1] for some constant r > 0 and all i,j; (2) the graph ΓA satisfies deg(j) ≥ δn for all j ∈ [n]. Then for any J ⊂ [n] there exists a set I ⊂ [n] of cardinality |I| ≥ (r2δ/2)n, such that for any i ∈ I X...
[...]
... ball estimate. Lemma 4.1. Let m,n ∈ N. Let A,B be (possibly random) n × m matrices, and let W = A ⊙ G + B, where G is the n × m Gaussian matrix, independent of A,B. Assume that, a.s., (1) ai,j ∈ {0}∪[r,1] for some constant r > 0 and all i,j; (2) the graph ΓA satisfies deg(j) ≥ δn for all j ∈ [m]. Then for any x ∈ Sm−1, z ∈ Rn and for any t > 0 P(kWx −zk2 ≤ t √ n) ≤ (Ct)cn. Proof. Let x ∈ Sm−1. Se...
[...]
... ≤ n ≤ 2m. Let A,B be an n×m matrices, and set W = A ⊙ G + B, where G is the standard n × m Gaussian matrix, independent of A,B. Assume that SINGULAR VALUES AND PERMANENT ESTIMATORS 15 (1) ai,j ∈ {0}∪[r,1] for some constant r > 0 and all i,j; (2) the graph ΓAT is broadly connected. Then for all z ∈ Rn P ∃x ∈ Comp(1−κ/2,K−C) : kWx− zk2 ≤ K −C √ n and kWk ≤ K √ n ≤ e cn. Proof. Set u0 = c0, v0 = c...
[...]
...t will be useful for the application of the theorem in the proof of Theorem 2.7 Theorem 2.3. Let W be an n × n matrix with independent normal entries wi,j ∼ N(bi,j,a2 i,j). Assume that (1) ai,j ∈ {0}∪[r,1] for some constant r > 0 and all i,j; (2) the graph ΓA is broadly connected; (3) kEWk ≤ K √ n for some K ≥ 1. Then for any t > 0 P(sn(W) ≤ ctK−Cn−1/2) ≤ t+e−c ′n. Theorem 2.4. Let n/2 < m ≤ n...
[...]
16 citations
16 citations
Cites background from "The integral of a symmetric unimoda..."
...Furthermore, as an one dimensional special case of the celebrated theorem of Anderson (Anderson 1955) on multidimensional convex symmetric set, the probability of any interval which is symmetric about the expectation is increases as variance decreases....
[...]
...We do not need to prove it, because it is well-known from probability theory and theory of multivariate statistical analysis (for example, Anderson 1986)....
[...]
References
3,082 citations
"The integral of a symmetric unimoda..." refers background in this paper
...In Theorem 1 the equality in (1) holds for k<l if and only if, for every u, (E+y)r\Ku=Er\Ku-\-y....
[...]
...It will be noticed that we obtain strict inequality in (1) if and only if for at least one u, H(u)>H*(u) (because H(u) is continuous on the left)....
[...]
1,660 citations
927 citations
140 citations
"The integral of a symmetric unimoda..." refers background in this paper
...f ud[H*(u) - H(u)} = b[H*(b) - H(b)] - a[H*(a) - H(a)} (3) " + f [(H(u) - H*(u)]du....
[...]
...J a Since/(x) has a finite integral over E, bH(b)—>0 as b—>oo and hence also bH*(b)—>0 as b—*<x>; therefore the first term on the right in (3) can be made arbitrarily small in absolute value....
[...]