slides - SNAP - Stanford University

slides - SNAP - Stanford University

[Leskovec et al. PKDD ‘05]

Kronecker graph: a growing sequence of graphs

by b iterating it ti the th Kronecker K k product d t

Each h Kronecker k multiplication l l exponentially ll

increases the size of the graph

Kk has N k

1 nodes and E1


k 1 1 edges, so we get


One can easily y use multiple p initiator matrices

(K ’

1 , K1

’’ , K1

’’’ ) that can be of different sizes


Jure Leskovec, Stanford CS322: Network Analysis

K 1


More magazines by this user
Similar magazines