On superposition of heterogeneous edge processes in dynamic random graphs

—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive states, which represent churn behavior of modern distributed systems. We prove that despite heterogeneity of node lifetimes, different initial out-degree, non-Poisson arrival/failure dynamics, and complex spatial and temporal dependency among creation of both initial and replacement edges, a superposition of edgearrival processes to a live node under uniform selection converges to a Poisson process when system size becomes sufficiently large. Due to the convoluted dependency and non-renewal nature of various point processes, this result significantly advances classical Poisson convergence analysis and offers a simple analytical platform for future modeling of networks under churn in a wide range of degree-regular and -irregular graphs with arbitrary node lifetime distributions.

• Type: Journal
• Year: 2012
• Where: INFOCOM
• Authors: Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
• Keywords: Communications, INFOCOM 2012, Irregular Graphs, Lifetime Distributions, Random Graphs