Description Usage Arguments Details Value Author(s) References Examples
Simulate a scale-free network with relatively high clustering, comparing to B-A networks (Holme and Kim, 1999).
1 | net.holme.kim(n, m, pt)
|
n |
Number of nodes of the network. |
m |
Number of nodes to which a new node connects at each iteration. |
pt |
Triad formation probability after each preferential attachment mechanism. |
The Holme-Kim network model is a simple extension of B-A model. It adds an additional step, called "Triad formation", with the probability pt that compensates the low clustering in B-A networks.
A list containing the nodes of the network and their respective neighbors.
Xu Dong, Nazrul Shaikh
Holme, Petter, and Beom Jun Kim. "Growing scale-free networks with tunable clustering."Physical review E65, no. 2 (2002): 026107.
1 2 3 | ## Not run:
x <- net.holme.kim (1000, 20, 0.1)
## End(Not run)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.