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}
}
  • Minas Gjoka, Maciej Kurant, Athina Markopoulou
  • Published 2013
  • Computer Science, Physics
  • 2013 Proceedings IEEE INFOCOM
  • 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

    Figures, Tables, and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 30 CITATIONS

    2K+ Graph Construction Framework: Targeting Joint Degree Matrix and Beyond

    VIEW 6 EXCERPTS
    CITES METHODS & BACKGROUND

    Construction of simple graphs with a target joint degree matrix and beyond

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Estimating clique composition and size distributions from sampled network data

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Estimating clustering coefficients and size of social networks via random walk

    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Impact of sampling design in estimation of graph characteristics

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Analysis of realized peer-to-peer streaming topologies by Kronecker graphs

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    FILTER CITATIONS BY YEAR

    2013
    2020

    CITATION STATISTICS

    • 2 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 35 REFERENCES

    Multigraph Sampling of Online Social Networks

    VIEW 1 EXCERPT

    Measurement-calibrated graph models for social network experiments

    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    Tuning clustering in random networks with arbitrary degree distributions.

    VIEW 1 EXCERPT

    Random graphs with clustering.

    VIEW 1 EXCERPT