activity
20172021
most citedGeometry of the random walk range conditioned on survival among Bernoulli obstacles

9 citations · 19 across the 7 of their papers we have counts for

collaborators

7 papers

math.PR2021★ 1 cited

Frozen -RSB structure of the symmetric Ising perceptron

Will Perkins, Changji Xu

We prove, under an assumption on the critical points of a real-valued function, that the symmetric Ising perceptron exhibits the `frozen 1-RSB' structure conjectured by Krauth and…

math.PR2019★ 4 cited

Distribution of the random walk conditioned on survival among quenched Bernoulli obstacles

Jian Ding, Ryoki Fukushima, Rongfeng Sun +1

Place an obstacle with probability independently at each vertex of and consider a simple symmetric random walk that is killed upon hitting one of the obstacles.…

math.PR2019★ 2 cited

Sharp threshold for the Ising perceptron model

Changji Xu

Consider the discrete cube and a random collection of half spaces which includes each half space for $x \in \{…

math.PR2019★ 1 cited

Biased random walk conditioned on survival among Bernoulli obstacles: subcritical phase

Jian Ding, Ryoki Fukushima, Rongfeng Sun +1

We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on () up to time . This model is known to undergo a phase transi…

math.PR2018★ 2 cited

Localization for random walks among random obstacles in a single Euclidean ball

Jian Ding, Changji Xu

Place an obstacle with probability independently at each vertex of , and run a simple random walk until hitting one of the obstacles. For and stric…

math.PR2018★ 9 cited

Geometry of the random walk range conditioned on survival among Bernoulli obstacles

Jian Ding, Ryoki Fukushima, Rongfeng Sun +1

We consider a discrete time simple symmetric random walk among Bernoulli obstacles on , , where the walk is killed when it hits an obstacle. It is known that…

math.PR2017

Poly-logarithmic localization for random walks among random obstacles

Jian Ding, Changji Xu

Place an obstacle with probability independently at each vertex of , and run a simple random walk until hitting one of the obstacles. For and stric…