slides - SNAP - Stanford University
slides - SNAP - Stanford University
slides - SNAP - Stanford University
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
[Leskovec et al. PKDD ‘05]<br />
Kronecker graph: a growing sequence of graphs<br />
by b iterating it ti the th Kronecker K k product d t<br />
Each h Kronecker k multiplication l l exponentially ll<br />
increases the size of the graph<br />
Kk has N k<br />
1 nodes and E1<br />
k<br />
k 1 1 edges, so we get<br />
densification<br />
One can easily y use multiple p initiator matrices<br />
(K ’<br />
1 , K1<br />
’’ , K1<br />
’’’ ) that can be of different sizes<br />
11/12/2009<br />
Jure Leskovec, <strong>Stanford</strong> CS322: Network Analysis<br />
K 1<br />
6
Change language