activity
20042025
most citedDistributions of order patterns of interval maps

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

collaborators

9 papers

math.PR2025

An iterated random function with Lipschitz number one

Aaron Abrams, Henry Landau, Zeph Landau +2

Consider the set of functions on . Define a Markov process that starts with a point and continues with …

math.CO2025

Evasive Random Walks and the Clairvoyant Demon

Aaron Abrams, Henry Landau, Zeph Landau +2

A pair of random walks on the vertices of a graph is {\it successful} if two tokens can be scheduled (moving only one token at a time) to travel along and witho…

math.ST2025

Optimal estimators for threshold-based quality measures

Aaron Abrams, Sandy Ganzell, Henry Landau +3

We consider a problem in parametric estimation: given samples from an unknown distribution, we want to estimate which distribution, from a given one-parameter family, produced…

math.CO2018

Germ order for one-dimensional packings

Aaron Abrams, Henry Landau, Zeph Landau +3

Every set of natural numbers determines a generating function convergent for whose behavior as determines a germ. These germs admit a natural par…

math.PR2016

Sums of twisted circulants

Aaron Abrams, Henry Landau, Zeph Landau +1

The rate of convergence of simple random walk on the Heisenberg group over with a standard generating set was determined by Bump et al [1,2]. We extend this result to random…

math.PR2012

Dull cut off for circulants

Aaron Abrams, Eric Babson, Henry Landau +2

Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3]…