Exponential random graphs as models of overlay networks

Journal of Applied Probability

Volumn 46, Issue 1, 2009, Pages 199-220

  Draief, M ^a   Ganesh, A ^b   Massoulie L ^c,d  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

^c Thomson Research   (France)

^d FCA UNESP   (Brazil)

Author keywords

Conductance; Degree distribution; Expansion; Exponential random graph; Failure resilience; Graph cut; Load balancing; Overlay optimization; Peer to peer network

Indexed keywords

EID: 64249146358     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1238592125     Document Type: Article

References (27)

1. BALL, F. AND BARBOUR, A. (1990). Poisson approximation for some epidemic models. J. Appl. Prob. 27, 479-490.
2. BESAG, J. E. (1974). Spatial interaction and the statistical analysis of lattice systems. J. R. Statist. Soc. Ser. B 36, 192-236.
3. BOLLOBÀS, B. (2001). Random Graphs (Camb. Stud. Adv. Math. 73). Cambridge Univeristy Press.
4. BRÉMAUD, P. (1999). Markov chains, Gibbs fields, Monte Carlo Simulation, and Queues. Springer, New York.
5. CHUNG, F (1996). Laplacians of graphs and Cheeger's inequalities. In Combinatorics, Paul Erdös is Eighty, Vol. 2 (Keszthely, 1993), János Bolyai Mathematical Society, Budapest, pp. 157-172.
6. DRAIEF, M., GANESH, A. AND MASSOULIÉ, L. (2008). Thresholds for virus spread on networks. Ann. Appl. Prob. 18, 359-378.
7. DURRETT, R. (2007). Random Graph Dynamics. Cambridge University Press.
8. ERDÖS. P. AND RÉNYI, A. (1960). On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5, 17-61.
9. FRANK, O. AND STRAUSS, D. (1986). Markov graphs. J. Amer. Statist. Assoc. 81, 832-842.
10. GANESH, A. J., KERMARREC, A.-M. AND MASSOULIÉ, L. (2003). Network awareness and failure resilience in self-organizing overlay networks. In Proc. IEEE Symp. Reliab. Distributed Systems, IEEE, pp. 47-55.
11. GANESH, A. J. AND MASSOULIÉ, L. (2003). Failure resilience in balanced overlay networks. In Proc. 41st Allerton Conf. Commun., Control Comput., IEEE.
12. GANESH, A. J., KERMARREC, A.-M. AND MASSOULIÉ, L. (2003). Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parallel Distributed Systems 14, 248-258.
13. GANESH, A. J., MASSOULIÉ, L. AND TOWSLEY, D. (2005). The effect of network topology on the spread of epidemics. In Proc. IEEE INFOCOM 2005, IEEE, pp. 1455-1466
14. GKANTSIDIS, C., MIHAIL, M. AND SABERI A. (2003). Conductance and congestion in power law graphs. In Proc. ACM SIGMETRICS 2003, ACM, pp. 148-159.
15. HOLLAND, P. W. AND LEINHARDT, S. (1981). An exponential family of probability densities for directed graphs. J. Amer. Statist. Assoc. 76, 33-65.
16. JANSON, S. (2009). The probability that a random multigraph is simple. To appear in Combinatorics Prob. Comput..
17. LOVÁSZ, L. (1996). Random walks on graphs: a survey. In Combinatorics, Paul Erdös is Eighty, Vol. 2, (Keszthely, 1993), János Bolyai Mathematical Society, Budapest, pp. 353-397.
18. LUA, E. K. et al. (2005). A survey and comparison of peer-to-peer overlay network schemes. IEEE Commun. Surveys Tutorials 7, 72-93.
19. MCDONALD, D. (1979). A local limit theorem for large deviations of sums of independent, nonidentically distributed random variables. Ann. Prob. 7, 526-531.
20. MCKAY, B. D. AND WORMALD, N. C. (1990). Asymptotic enumeration by degree sequence of graphs of high degree. Europ. J. Combinatorics 11, 565-580.
21. METROPOLIS, N. et al. (1953). Equations of state calculations by fast computing machines. J. Chemical Physics 21, 1087-1092.
22. MOHAR, B. (1997). Some applications of Laplace eigenvalues of graphs. In Graph Symmetry, eds G. Hahn and G. Sabidussi, Kluwer, Dordrecht, pp. 225-275.
23. PARK, J. AND NEWMAN, M. E. J. (2004). Statistical mechanics of networks. Phys. Rev. E 70, 066117.
24. SNIJDERS, T. A. B. (2002). Markov chain Monte Carlo estimation of exponential random graph models. J. Social Structure 3, 1-40.
25. SOLOMONOFF, R. AND RAPOPORT, A. (1951). Connectivity of random nets. Bull. Math. Biophysics 13, 107-117.
26. STEINMETZ, R. AND WEHRLE, K. (2005). What is this peer-to-peer about? In Peer-to-Peer Systems and Applications, Springer, Berlin, pp. 9-16.
27. VAN DER HOFSTAD, R. (2009). Random. Graphs and Complex Networks. Available at http://www.win.tue.nl/rhof-stad/ NotesRGCN2009.pdf.