42 citations · 45 across the 10 of their papers we have counts for
14 papers
Universality of cutoff for independent random walks on the circle conditioned not to intersect
Anna Ben-Hamou, Pierre Tarrago
In the present paper, we consider a class of Markov processes on the discrete circle which has been introduced by König, O'Connell and Roch. These processes describe movements of e…
Mixing time of a matrix random walk generated by elementary transvections
Anna Ben-Hamou
We consider a Markov chain on invertible matrices with entries in which moves by picking an ordered pair of distinct rows and add the first one to the ot…
Robust and non asymptotic estimation of probability weighted moments with application to extreme value analysis
Anna Ben-Hamou, Philippe Naveau, Maud Thomas
In extreme value theory and other related risk analysis fields, probability weighted moments (PWM) have been frequently used to estimate the parameters of classical extreme value d…
Inference in balanced community modulated recursive trees
Anna Ben-Hamou, Vasiliki Velona
We introduce a random recursive tree model with two communities, called balanced community modulated random recursive tree, or BCMRT in short. In this setting, pairs of nodes of di…
On deviation probabilities in non-parametric regression with heavy-tailed noise
Anna Ben-Hamou, Arnaud Guyader
This paper is devoted to the problem of determining the concentration bounds that are achievable in non-parametric regression. We consider the setting where features are supported…
Cutoff for permuted Markov chains
Anna Ben-Hamou, Yuval Peres
Let be a bistochastic matrix of size , and let be a permutation matrix of size . In this paper, we are interested in the mixing time of the Markov chain whose transit…
A threshold for cutoff in two-community random graphs
Anna Ben-Hamou
In this paper, we are interested in the impact of communities on the mixing behavior of the non-backtracking random walk. We consider sequences of sparse random graphs of size …
Estimating graph parameters with random walks
Anna Ben-Hamou, Roberto I. Oliveira, Yuval Peres
An algorithm observes the trajectories of random walks over an unknown graph , starting from the same vertex , as well as the degrees along the trajectories. For all finite c…
Comparing mixing times on sparse random graphs
Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres
It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregu…
Cutoff for a stratified random walk on the hypercube
Anna Ben-Hamou, Yuval Peres
We consider the random walk on the hypercube which moves by picking an ordered pair of distinct coordinates uniformly at random and adding the bit at location to the bi…
Pattern Coding Meets Censoring: (almost) Adaptive Coding on Countable Alphabets
Anna Ben-Hamou, Stephane Boucheron, Elisabeth Gassiat
Adaptive coding faces the following problem: given a collection of source classes such that each class in the collection has non-trivial minimax redundancy rate, can we design a si…
Weighted sampling without replacement
Anna Ben-Hamou, Yuval Peres, Justin Salez
Comparing concentration properties of uniform sampling with and without replacement has a long history which can be traced back to the pioneer work of Hoeffding (1963). The goal of…
Cutoff for non-backtracking random walks on sparse random graphs
Anna Ben-Hamou, Justin Salez
A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on…
Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass, with applications
Anna Ben-Hamou, Stéphane Boucheron, Mesrob I. Ohannessian
An infinite urn scheme is defined by a probability mass function over positive integers. A random allocation consists of a sample of independent drawings accor…