Kronecker graph explained

Kronecker graphs are a construction for generating graphs for modeling systems. The method constructs a sequence of graphs from a small base graph by iterating the Kronecker product.[1] A variety of generalizations of Kronecker graphs exist.[2]

The Graph500 benchmark for supercomputers is based on the use of a stochastic version of Kronecker graphs. Stochastic kronecker graph is a kronecker graph with each component of the matrix made by real numbers between 0 and 1. The stochastic version of kronecker graph eliminates the staircase effect, which happens due to large multiplicity of kronecker graph.[3]

Notes and References

  1. .
  2. Book: Bodine. E.. Hassibi. B.. Wierman. A.. 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton). Generalizing Kronecker graphs in order to model searchable networks. 2009-09-01. 194–201. 10.1109/ALLERTON.2009.5394816. 978-1-4244-5870-7. 12692876. 2024-05-03. 2020-09-17. https://web.archive.org/web/20200917162225/https://authors.library.caltech.edu/19283/. live.
  3. Seshadhri. C.. Pinar. Ali. Kolda. Tamara G.. Tamara G. Kolda. 2013-05-01. An In-depth Analysis of Stochastic Kronecker Graphs. J. ACM. 60. 2. 13:1–13:32. 1102.5046. 10.1145/2450142.2450149. 6491828 . 0004-5411.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Kronecker graph".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.