Exponential random graphs as models of overlay networks

Exponential random graphs as models of overlay networks

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 Pe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Draief, M, Ganesh, A, Massoulie, L
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Probability
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Draief, M
Ganesh, A
Massoulie, L
description 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.
doi_str_mv 10.48550/arxiv.0810.3173
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_0810_3173</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>0810_3173</sourcerecordid><originalsourceid>FETCH-LOGICAL-a653-a4a5d17823e378ce5915c29aabec15d85379554adfe13a9ffc081ea40b88246c3</originalsourceid><addsrcrecordid>eNotj7FuwjAURb10qCh7J-QfCI3z_LAzVghoJaQu7NHDfoaoSRzZiMLfA22nK53h6hwhXlU51xaxfKN0ac_z0t4BKAPPwqwuYxx4OLXUyUSDj708JBqPWVKWffTcZRmDjGdOHV3lwKefmL7zi3gK1GWe_u9E7Nar3fKj2H5tPpfv24IWCAVpQq-MrYDBWMdYK3RVTbRnp9BbBFMjavKBFVAdgrurMelyb22lFw4mYvZ3-yvejKntKV2bR0DzCIAbJJ5AmA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Exponential random graphs as models of overlay networks</title><source>arXiv.org</source><creator>Draief, M ; Ganesh, A ; Massoulie, L</creator><creatorcontrib>Draief, M ; Ganesh, A ; Massoulie, L</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.0810.3173</identifier><language>eng</language><subject>Mathematics - Probability</subject><creationdate>2008-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/0810.3173$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.0810.3173$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Draief, M</creatorcontrib><creatorcontrib>Ganesh, A</creatorcontrib><creatorcontrib>Massoulie, L</creatorcontrib><title>Exponential random graphs as models of overlay networks</title><description>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.</description><subject>Mathematics - Probability</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7FuwjAURb10qCh7J-QfCI3z_LAzVghoJaQu7NHDfoaoSRzZiMLfA22nK53h6hwhXlU51xaxfKN0ac_z0t4BKAPPwqwuYxx4OLXUyUSDj708JBqPWVKWffTcZRmDjGdOHV3lwKefmL7zi3gK1GWe_u9E7Nar3fKj2H5tPpfv24IWCAVpQq-MrYDBWMdYK3RVTbRnp9BbBFMjavKBFVAdgrurMelyb22lFw4mYvZ3-yvejKntKV2bR0DzCIAbJJ5AmA</recordid><startdate>20081017</startdate><enddate>20081017</enddate><creator>Draief, M</creator><creator>Ganesh, A</creator><creator>Massoulie, L</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20081017</creationdate><title>Exponential random graphs as models of overlay networks</title><author>Draief, M ; Ganesh, A ; Massoulie, L</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a653-a4a5d17823e378ce5915c29aabec15d85379554adfe13a9ffc081ea40b88246c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Mathematics - Probability</topic><toplevel>online_resources</toplevel><creatorcontrib>Draief, M</creatorcontrib><creatorcontrib>Ganesh, A</creatorcontrib><creatorcontrib>Massoulie, L</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Draief, M</au><au>Ganesh, A</au><au>Massoulie, L</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Exponential random graphs as models of overlay networks</atitle><date>2008-10-17</date><risdate>2008</risdate><abstract>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.</abstract><doi>10.48550/arxiv.0810.3173</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.0810.3173
ispartof
issn
language eng
recordid cdi_arxiv_primary_0810_3173
source arXiv.org
subjects Mathematics - Probability
title Exponential random graphs as models of overlay networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T22%3A51%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Exponential%20random%20graphs%20as%20models%20of%20overlay%20networks&rft.au=Draief,%20M&rft.date=2008-10-17&rft_id=info:doi/10.48550/arxiv.0810.3173&rft_dat=%3Carxiv_GOX%3E0810_3173%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true