克罗内克图

此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。

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.<ref>{{citation

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. A variety of generalizations of Kronecker graphs exist.

Kronecker 图是为建模系统生成图的一种构造方法。该方法通过迭代克罗内克积图，从一个小的基图构造一个图序列。Kronecker 图的各种推广都是存在的。

| last1 = Leskovec | first1 = Jure

| last2 = Chakrabarti | first2 = Deepayan

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.

用于超级计算机的 Graph500基准是基于 Kronecker 图的一个随机版本的使用。随机 kronecker 图是一个 kronecker 图，其矩阵的每个分量由0到1之间的实数构成。Kronecker 图的随机形式消除了由于 kronecker 图的大多重性而产生的阶梯效应。

| last3 = Kleinberg | first3 = Jon | author3-link = Jon Kleinberg

| last4 = Faloutsos | first4 = Christos | author4-link = Christos Faloutsos

| last5 = Ghahramani | first5 = Zoubin

| arxiv = 0812.4905

| journal = Journal of Machine Learning Research

Category:Graph families

类别: 图族

| mr = 2600637

This page was moved from wikipedia:en:Kronecker graph. Its edit history can be viewed at 克罗内克图/edithistory