activity
20132026
most citedIntroduction to the combinatorial atlas

13 citations · 113 across the 34 of their papers we have counts for

collaborators
Showing math.PRShow all

6 papers · 1 filter

math.PR2025

Normalized matching property for competing urn models

Swee Hong Chan

We study the competing urn model in which balls are placed independently into urns according to (possibly distinct) ball distributions. Kahn and Neiman (2010) showed that,…

math.PR2020★ 1 cited

Recurrence of horizontal-vertical walks

Swee Hong Chan

Consider a nearest neighbor random walk on the two-dimensional integer lattice, where each vertex is initially labeled either `H' or `V', uniformly and independently. At each discr…

math.PR2019★ 1 cited

Infinite-step stationarity of rotor walk and the wired spanning forest

Swee Hong Chan

We study rotor walk, a deterministic counterpart of the simple random walk, on infinite transient graphs. We show that the final rotor configuration of the rotor walk follows the l…

math.PR2018★ 3 cited

A rotor configuration with maximum escape rate

Swee Hong Chan

Rotor walk is a deterministic analogue of simple random walk. For any given graph, we construct a rotor configuration for which the escape rate of the corresponding rotor walk is e…

math.PR2018★ 4 cited

Rotor walks on transient graphs and the wired spanning forest

Swee Hong Chan

We study rotor walks on transient graphs with initial rotor configuration sampled from the oriented wired uniform spanning forest (OWUSF) measure. We show that the expected number…

math.PR2018★ 3 cited

Random walks with local memory

Swee Hong Chan, Lila Greco, Lionel Levine +1

We prove a quenched invariance principle for a class of random walks in random environment on , where the walker alters its own environment. The environment consists…