9 citations · 9 across the 3 of their papers we have counts for
3 papers
math.PR2008
Exponential random graphs as models of overlay networks
M. Draief, A. Ganesh, L. Massoulie
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence…
math.PR2008
A model for infection on graphs
M. Draief, A. Ganesh
We address the question of understanding the effect of the underlying network topology on the spread of a virus and the dissemination of information when users are mobile performin…
math.PR2005★ 9 cited
Routing in Poisson small-world networks
M. Draief, A. Ganesh
In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present bet…