31 citations · 142 across the 24 of their papers we have counts for
31 papers
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…
Physical networks as network-of-networks
Gábor Pete, Ádám Timár, Sigurdur Örn Stefánsson +2
Physical networks are made of nodes and links that are physical objects embedded in a geometric space. Understanding how the mutual volume exclusion between these elements affects…
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…
Finite-energy infinite clusters without anchored expansion
Gábor Pete, Ádám Timár
Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond percolation on any nonamenable transitive graph G, at any p > p_c(G), the probabil…
Sparse reconstruction in spin systems I: iid spins
Pál Galicza, Gábor Pete
For a sequence of Boolean functions , defined on increasing configuration spaces of random inputs, we say that there is sparse recons…
The Free Uniform Spanning Forest is disconnected in some virtually free groups, depending on the generator set
Gábor Pete, Ádám Timár
We prove the rather counterintuitive result that there exist finite transitive graphs H and integers k such that the Free Uniform Spanning Forest in the direct product of the k-reg…