activity
20042020
most citedGenerating Random Vectors in (Z/pZ)^d Via an Affine Random Process

4 citations · 6 across the 6 of their papers we have counts for

collaborators

7 papers

math.PR2020★ 1 cited

A multiplicatively symmetrized version of the Chung-Diaconis-Graham random process

Martin Hildebrand

This paper considers random processes of the form where is odd, , are i.i.d., and and are…

math.PR2015

A Condition for Distinguishing Sceneries on Non-abelian Groups

Martin Hildebrand

A scenery on a finite group is a function from to . A random walk on is said to be reconstructive if the distributions of 2 sceneries evaluated on t…

math.PR2008

A lower bound for the Chung-Diaconis-Graham random process

Martin Hildebrand

Chung, Diaconis, and Graham considered random processes of the form X_{n+1}=a_n X_n+b_n (mod p) where p is odd, X_0=0, a_n=2 always, and b_n are i.i.d. for n=0,1,2,... . In this pa…

math.PR2007★ 4 cited

Generating Random Vectors in (Z/pZ)^d Via an Affine Random Process

Martin Hildebrand, Joseph McCollum

This paper considers some random processes of the form X_{n+1}=TX_n+B_n (mod p) where B_n and X_n are random variables over (Z/pZ)^d and T is a fixed d x d integer matrix which is…

math.PR2005

On the Chung-Diaconis-Graham random process

Martin Hildebrand

Chung, Diaconis, and Graham considered random processes of the form X_{n+1}=2X_n+b_n (mod p) where X_0=0, p is odd, and b_n for n=0,1,2,... are i.i.d. random variables on {-1,0,1}.…

math.CO2004

Bounding quantities related to the packing density of 1(L+1)L...2

Martin Hildebrand, Bruce E. Sagan, Vincent Vatter

We bound several quantities related to the packing density of the patterns 1(L+1)L...2. These bounds sharpen results of Bóna, Sagan, and Vatter and give a new proof of the packing…