2 papers
math.PR2026
On the self-intersection time of non-backtracking random walks
Ferenc Bencs, Leslie Ann Goldberg, Matthew Jenssen +4
We study the self-intersection time of the non-backtracking random walk on connected undirected graphs. For every fixed we show that the expected self-intersection time i…
math.PR2026
Stake-governed tug-of-war and the biased infinity Laplacian
Yujie Fu, Alan Hammond, Gábor Pete
In tug-of-war, two players compete by moving a counter along edges of a graph, each winning the right to move at a given turn according to the flip of a possibly biased coin. The g…