The proportional probability model creates a binary graph via a node addition process. At the addition of node n, all edges between node n and nodes 1,..., n-1 are added with probability p = n/nNodes, where nNodes is the total number of nodes in the final graph. This creates an Erdos Renyi graph with one more node at each step. Since we used a node addition process to create the graph, the ordering of the nodes is the standard 1:nNodes.

Code

Code

Local GraphMeasures |
Mesoscale TopologicalFeatures |
Global NetworkProperties |