Preferential Attachment in Graphs with Affinities

Abstract

Here, we give a full proof of Theorem 1. Recall that an equivalent construction of the PAGA graphs is obtained by collapsing the graph G 1 to G t m leading to t super nodes. Accordingly, based on G t m, we can directly generate G m by (temporarily) adding m more nodes, each linking with a single edge, and then collapsing these m nodes to the (t+ 1)th super… (More)

Topics

1 Figure or Table

Statistics

01020201520162017
Citations per Year

Citation Velocity: 4

Averaging 4 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics