2 papers
math.PR2018
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…
math.PR2016
On percolation critical probabilities and unimodular random graphs
Dorottya Beringer, Gábor Pete, Ádám Timár
We investigate generalisations of the classical percolation critical probabilities , and the critical probability defined by Duminil-Copin and Tassion (201…