17 citations · 61 across the 21 of their papers we have counts for
Showing 2018 · math.PRShow all
2 papers · 2 filters
math.PR2018
One-ended spanning trees in amenable unimodular graphs
Adam Timar
We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended amenable unimodular random graph we construct a facto…
math.PR2018★ 3 cited
Controllability, matching ratio and graph convergence
Dorottya Beringer, Ádám Timár
There is an important parameter in control theory which is closely related to the directed matching ratio of the network, as shown by Liu, Slotine and Barabási (2011). We give proo…