Kronecker Graphs: An Approach to Modeling Networks

@article{Leskovec2010KroneckerGA,
  title={Kronecker Graphs: An Approach to Modeling Networks},
  author={Jure Leskovec and Deepayan Chakrabarti and Jon M. Kleinberg and Christos Faloutsos and Zoubin Ghahramani},
  journal={Journal of Machine Learning Research},
  year={2010},
  volume={11},
  pages={985-1042}
}
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of networ k properties? Real networks exhibit a long list of surprising properties: Heavy tails for the ina nd out-degree distribution; heavy tails for the eigenvalues and eigenvectors; small diameters; and de sification and shrinking diameters over time. The present network models and generators either fail to match several of the above properties, are… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 541 CITATIONS, ESTIMATED 30% COVERAGE

Counting Triangles in Massive Graphs with MapReduce

VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Influence Maximization in Continuous Time Diffusion Networks

VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Streaming graph partitioning for large distributed graphs

VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2009
2019

CITATION STATISTICS

  • 107 Highly Influenced Citations

  • Averaged 71 Citations per year over the last 3 years

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…