We derive some results on contrarian and one-sided strategies by Skeptic for the fair-coin game in the framework of the game-theoretic probability of Shafer and Vovk [8]. In particular, concerning the rate of convergence of the strong law of large numbers (SLLN), we prove that Skeptic can force that the convergence has to be slower than or equal to O(n−1/2). This is achieved by a very simple co...

We introduce a new type of convergence in probability theory, which we call “mod-Gaussian convergence”. It is directly inspired by theorems and conjectures, in random matrix theory and number theory, concerning moments of values of characteristic polynomials or zeta functions. We study this type of convergence in detail in the framework of infinitely divisible distributions, and exhibit some un...

Convergence analysis for optimization problems with chance constraints concerns impact of variation of probability measure in the chance constraints on the optimal value and the optimal solutions and research on this topic has been well documented in the literature of stochastic programming. In this paper, we extend such analysis to optimization problems with distributionally robust chance cons...

Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...

in the present work‎, ‎a new stochastic algorithm is proposed to solve multiple dimensional fredholm integral equations of the second kind‎. ‎the solution of the‎ integral equation is described by the neumann series expansion‎. ‎each term of this expansion can be considered as an expectation which is approximated by a continuous markov chain monte carlo method‎. ‎an algorithm is proposed to sim...