31 citations · 53 across the 12 of their papers we have counts for
Showing 2013 · math.PRShow all
2 papers · 2 filters
math.PR2013★ 1 cited
Asymptotic properties of a random graph with duplications
Ágnes Backhausz, Tamás F. Móri
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic de…
math.PR2013★ 31 cited
Ramanujan graphings and correlation decay in local algorithms
Agnes Backhausz, Balazs Szegedy, Balint Virag
Let be a large-girth -regular graph and be a random process on the vertices of produced by a randomized local algorithm. We prove the upper bound $(k+1-2k/d)\Bigl(\f…