13 citations · 113 across the 34 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
Abelian networks IV. Dynamics of nonhalting networks
Swee Hong Chan, Lionel Levine
An abelian network is a collection of communicating automata whose state transitions and message passing each satisfy a local commutativity condition. This paper is a continuation…
A bijection between necklaces and multisets with divisible subset sum
Swee Hong Chan
Consider these two distinct combinatorial objects: (1) the necklaces of length with at most colors, and (2) the multisets of integers modulo with subset sum divisible b…