搜索结果: 1-6 共查到“概率论 Inequality”相关记录6条 . 查询时间(0.078 秒)
Log-Harnack Inequality for Gruschin Type Semigroups
Gruschin semigroup log-Harnack inequality coupling regular conditional probability
2012/6/19
By constructing a coupling in two steps and using the Girsanov theorem under a regular conditional probability, the log-Harnack inequality is established for a large class of Gruschin type semigroups ...
Chevet type inequality and norms of submatrices
Chevet type inequality norms of submatrices Probability
2011/9/15
Abstract: We prove a Chevet type inequality which gives an upper bound for the norm of an isotropic log-concave unconditional random matrix in terms of expectation of the supremum of "symmetric expone...
An inequality for the distance between densities of free convolutions
densities of free convolutions inequality Probability
2011/8/24
Abstract: It is shown that under some conditions the distance between densities of free convolutions of two pairs of probability measures is smaller than the maximum of the Levy distance between the c...
A sharp correlation inequality with an application to almost sure local limit theorem
Correlation inequality i.i.d. random variables lattice distributed
2011/2/21
We prove a new sharp correlation inequality for sums of i.i.d.square integrable lattice distributed random variables. We also apply it to establish an almost sure local limit theorem for iid square in...
Poincaré inequality for Markov random fields via disagreement percolation
Poincar´ e inequality weak Poincar´ e inequality Gibbs mea-
2011/1/20
We consider Markov random fields of discrete spins on the lattice Zd. We use a technique of coupling of conditional distributions. If under the coupling the disagreement cluster is “sufficiently” subc...
Sharp Norm Inequality for Bounded Submartingales and Stochastic Integrals
Martingale Submartingale Stochastic integral Norm inequality Differential subordination
2010/1/22
Let be a fixed number and be a nonnegative submartingale bounded from above by . Assume is a process satisfying, with probability , We provide a sharp bound for the first moment of the proc...