2.5K-graphs: From sampling to generation

@article{Gjoka201325KgraphsFS,
  title={2.5K-graphs: From sampling to generation},
  author={Minas Gjoka and Maciej Kurant and Athina Markopoulou},
  journal={2013 Proceedings IEEE INFOCOM},
  year={2013},
  pages={1968-1976}
}
Understanding network structure and having access to realistic graphs plays a central role in computer and social networks research. In this paper, we propose a complete, practical methodology for generating graphs that resemble a real graph of interest. The metrics of the original topology we target to match are the joint degree distribution (JDD) and the degree-dependent average clustering coefficient (c̅(k)). We start by developing efficient estimators for these two metrics based on a node… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS
12 Citations
24 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Similar Papers

Loading similar papers…