Exponential random graphs as models of overlay networks

Details Exponential random graphs as models of overlay networks Exponential random graphs as models of overlay networks

2008-10-17

arxiv.org/abs/0810.3173v1

Mathematics

Probability

18 pages

Scientific paper

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 of G. We describe how this model naturally appears in the context of load balancing in communication networks, namely Peer-to-Peer overlays. We then analyse the degree distribution of such graphs and show that the degrees are concentrated around their mean value. Finally, we derive asymptotic results on the number of edges crossing a graph cut and use these results $(i)$ to compute the graph expansion and conductance, and $(ii)$ to analyse the graph resilience to random failures.

Affiliated with

Also associated with

No associations

Rating

Exponential random graphs as models of overlay networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exponential random graphs as models of overlay networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponential random graphs as models of overlay networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352601