10 citations · 33 across the 23 of their papers we have counts for
6 papers · 1 filter
Slowdown for the geodesic-biased random walk
Mikhail Beliayeu, Petr Chmel, Bhargav Narayanan +1
Given a connected graph with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on , a random walker moves as follows: from an…
Exceptional graphs for the random walk
Juhan Aru, Carla Groenland, Tom Johnston +3
If is the simple random walk on the square lattice , then induces a random walk on any spanning subgraph $G\subset \mathbb…
Coalescence on the real line
Paul Balister, Béla Bollobás, Jonathan Lee +1
We study a geometrically constrained coalescence model derived from spin systems. Given two probability distributions and on the positive reals with f…
Balancing sums of random vectors
Juhan Aru, Bhargav Narayanan, Alex Scott +1
We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition thes…
Connections in randomly oriented graphs
Bhargav Narayanan
Given an undirected graph , let us randomly orient by tossing independent (possibly biased) coins, one for each edge of . Writing for the event that ther…
Line percolation
Paul Balister, Béla Bollobás, Jonathan Lee +1
We study a new geometric bootstrap percolation model, line percolation, on the -dimensional integer grid . In line percolation with infection parameter , infection spr…