2 citations · 2 across the 11 of their papers we have counts for
7 papers · 1 filter
Poisson occupancy of paths on permuted regular graphs
Rafael Chiclana
In the classical occupancy problem, balls are placed independently and uniformly into boxes. We study a graph analogue of this model. Let be a directed -regular grap…
Randomly Permuted Orthogonal Products and Fast Dimension Reduction
Rafael Chiclana
We study the effect of random signed permutations on products of orthogonal matrices and their applications to fast dimension reduction. Let be ort…
Nonconcentration of hitting times for random walks on graphs
Rafael Chiclana
We study nonconcentration of hitting times for simple random walk on finite graphs. We prove that, for every connected graph with vertices, \[ \operatorname{Var}_x(τ_y)+\mathbb…
Fast Dimensionality Reduction from to
Rafael Chiclana, Mark Iwen
The Johnson-Lindenstrauss (JL) lemma is a fundamental result in dimensionality reduction, ensuring that any finite set can be embedded into a lower-dimen…
Optimal lower bound for the variance of hitting times for simple random walks on graphs
Rafael Chiclana, Yuval Peres
We study hitting times in simple random walks on graphs, which measure the time required to reach specific target vertices. Our main result establishes a sharp lower bound for the…
A local central limit theorem for random walks on expander graphs
Rafael Chiclana, Yuval Peres
There is a long history of establishing central limit theorems for Markov chains. Quantitative bounds for chains with a spectral gap were proved by Mann and refined later. Recently…
No cutoff in Spherically symmetric trees
Rafael Chiclana, Yuval Peres
We show that for lazy simple random walks on finite spherically symmetric trees, the ratio of the mixing time and the relaxation time is bounded by a universal constant. Consequent…