most citedServices within a busy period of an M/M/1 queue and Dyck paths

7 citations · 9 across the 3 of their papers we have counts for

collaborators
Showing math.PRShow all

1 paper · 1 filter

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…