Sciweavers

Share
SIGMETRICS
2008
ACM

Densification arising from sampling fixed graphs

11 years 5 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer networks. A recently observed feature is known as network densification, which occurs when the number of edges grows much faster than the number of nodes, as the network evolves over time. This surprising phenomenon has been empirically validated in a variety of networks that emerge in the real world and mathematical models have been recently proposed to explain it. Leveraging on how real data is usually gathered and used, we propose a new model called Edge Sampling to explain how densification can arise. Our model is innovative, as we consider a fixed underlying graph and a process that discovers this graph by probabilistically sampling its edges. We show that this model possesses several interesting features, in particular, that edges and nodes discovered can exhibit densification. Moreover, when the node de...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where SIGMETRICS
Authors Pedram Pedarsani, Daniel R. Figueiredo, Matthias Grossglauser
Comments (0)
books