5 problems
Matching
Let be an infinite, locally finite, transitive graph. Replace each undirected edge of by two oppositely directed edges, independently declaring each directed edge open with…
Let and be connected locally finite graphs, and let be a weak covering map. Determine hypotheses on , the fibres, a…
For every integer , consider the nearest-neighbor contact process on with infection rate and recovery rate . Let be the critical val…
Consider the directed random graph on in which each vertex independently chooses one of its four nearest-neighbour directions uniformly, places an arrow in that dire…
For every there exists such that the following holds uniformly over every finite graph , every percolation parameter , every origin vertex…