20 citations · 20 across the 3 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2005
On the expansion of the giant component in percolated (n,d,λ) graphs
Eran Ofek
Let d \geq d_0 be a sufficiently large constant. A (n,d,c \sqrt{d}) graph G is a d-regular graph over n vertices whose second largest (in absolute value) eigenvalue is at most c \s…
math.PR2004
Routing Complexity of Faulty Networks
Omer Angel, Itai Benjamini, Eran Ofek +1
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper invest…