239:
34:
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
141:
280:
66:
101:
122:
Bodine, E.; Hassibi, B.; Wierman, A. (2009-09-01). "Generalizing
Kronecker graphs in order to model searchable networks".
155:
20:
304:
273:
24:
299:
23:
for modeling systems. The method constructs a sequence of graphs from a small base graph by iterating the
85:
266:
215:
189:
147:
75:
57:
207:
137:
250:
199:
129:
97:
177:
93:
125:
2009 47th Annual
Allerton Conference on Communication, Control, and Computing (Allerton)
89:
293:
53:
151:
246:
219:
133:
61:
211:
123:
203:
31:
180:(2013-05-01). "An In-depth Analysis of Stochastic Kronecker Graphs".
238:
194:
80:
27:. A variety of generalizations of Kronecker graphs exist.
254:
35:
happens due to large multiplicity of kronecker graph.
62:"Kronecker graphs: an approach to modeling networks"
274:
8:
281:
267:
193:
79:
52:Leskovec, Jure; Chakrabarti, Deepayan;
44:
7:
235:
233:
67:Journal of Machine Learning Research
253:. You can help Knowledge (XXG) by
19:are a construction for generating
14:
237:
158:from the original on 2020-09-17
104:from the original on 2016-07-29
1:
134:10.1109/ALLERTON.2009.5394816
60:; Ghahramani, Zoubin (2010),
176:Seshadhri, C.; Pinar, Ali;
321:
232:
204:10.1145/2450142.2450149
249:-related article is a
128:. pp. 194–201.
90:2008arXiv0812.4905L
58:Faloutsos, Christos
305:Graph theory stubs
262:
261:
188:(2): 13:1–13:32.
143:978-1-4244-5870-7
25:Kronecker product
312:
283:
276:
269:
241:
234:
224:
223:
197:
178:Kolda, Tamara G.
173:
167:
166:
164:
163:
119:
113:
111:
110:
109:
83:
49:
17:Kronecker graphs
320:
319:
315:
314:
313:
311:
310:
309:
290:
289:
288:
287:
230:
228:
227:
175:
174:
170:
161:
159:
144:
121:
120:
116:
107:
105:
51:
50:
46:
41:
12:
11:
5:
318:
316:
308:
307:
302:
300:Graph families
292:
291:
286:
285:
278:
271:
263:
260:
259:
242:
226:
225:
168:
142:
114:
54:Kleinberg, Jon
43:
42:
40:
37:
13:
10:
9:
6:
4:
3:
2:
317:
306:
303:
301:
298:
297:
295:
284:
279:
277:
272:
270:
265:
264:
258:
256:
252:
248:
243:
240:
236:
231:
221:
217:
213:
209:
205:
201:
196:
191:
187:
183:
179:
172:
169:
157:
153:
149:
145:
139:
135:
131:
127:
126:
118:
115:
103:
99:
95:
91:
87:
82:
77:
73:
69:
68:
63:
59:
55:
48:
45:
38:
36:
33:
28:
26:
22:
18:
255:expanding it
247:graph theory
244:
229:
185:
181:
171:
160:. Retrieved
124:
117:
106:, retrieved
74:: 985–1042,
71:
65:
47:
29:
16:
15:
294:Categories
162:2024-05-03
108:2016-07-05
39:References
212:0004-5411
195:1102.5046
81:0812.4905
156:Archived
152:12692876
102:archived
32:Graph500
220:6491828
98:2600637
86:Bibcode
218:
210:
182:J. ACM
150:
140:
96:
21:graphs
245:This
216:S2CID
190:arXiv
148:S2CID
76:arXiv
251:stub
208:ISSN
138:ISBN
30:The
200:doi
130:doi
296::
214:.
206:.
198:.
186:60
184:.
154:.
146:.
136:.
100:,
94:MR
92:,
84:,
72:11
70:,
64:,
56:;
282:e
275:t
268:v
257:.
222:.
202::
192::
165:.
132::
112:.
88::
78::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.