3 papers
math.PR2022
Most transient random walks have infinitely many cut times
Noah Halberstam, Tom Hutchcroft
We prove that if is a random walk on a transient graph such that the Green's function decays at least polynomially along the random walk, then h…
math.PR2020
Lower Gaussian heat kernel bounds for the Random Conductance Model in a degenerate ergodic environment
Sebastian Andres, Noah Halberstam
We study the random conductance model on with ergodic, unbounded conductances. We prove a Gaussian lower bound on the heat kernel given a polynomial moment condition…
math.PR2020
Collisions of Random Walks in Dynamic Random Environments
Noah Halberstam, Tom Hutchcroft
We study dynamic random conductance models on in which the environment evolves as a reversible Markov process that is stationary under space-time shifts. We prove un…