activity
19922016
most citedPolynomial Time Computable Triangular Arrays For Almost Sure Convergence

2 citations · 3 across the 8 of their papers we have counts for

collaborators
Showing 2016Show all

2 papers · 1 filter

math.PR2016★ 2 cited

Polynomial Time Computable Triangular Arrays For Almost Sure Convergence

Vladimir Dobric, Marina Skyers, Lee J. Stanley

For 0 < x < 1, take the binary expansion with infinitely many 0's, replace each 0 with -1, this gives the polarized binary expansion of x. Let R_i(x) be the ith "polarized bit" and…

math.PR2016★ 1 cited

Polynomial Time Relatively Computable Triangular Arrays in a Multinomial Setting

Vladimir Dobric, Patricia Garmirian, Lee J. Stanley

We extend the methods and results of [arXiv 1603.04896] to the setting of multinomial distributions satisfying certain properties. These include all the multinomial distributions a…