Exponential Random Graphs as Models of Overlay Networks

DOI10.1239/JAP/1238592125zbMath1162.60343arXiv0810.3173OpenAlexW2017792738MaRDI QIDQ3621156

Ayalvadi J. Ganesh, Laurent Massoulié, Moez Draief

Publication date: 14 April 2009

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.3173

zbMATH Keywords

expansiondegree distributionload balancingconductancepeer-to-peer networkgraph cutexponential random graphfailure resilienceoverlay optimisation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (1)

Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms

Cites Work

• A local limit theorem for large deviations of sums of independent, nonidentically distributed random variables
• Asymptotic enumeration by degree sequence of graphs of high degree
• Thresholds for virus spread on networks
• The Probability That a Random Multigraph is Simple
• Markov Graphs
• An Exponential Family of Probability Distributions for Directed Graphs
• Poisson approximation for some epidemic models
• Markov Chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exponential Random Graphs as Models of Overlay Networks