net.holme.kim: Holme-Kim Network

Description Usage Arguments Details Value Author(s) References Examples

View source: R/net.holme.kim.R

Description

Simulate a scale-free network with relatively high clustering, comparing to B-A networks (Holme and Kim, 1999).

Usage

1

Arguments

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.

Details

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.

Value

A list containing the nodes of the network and their respective neighbors.

Author(s)

Xu Dong, Nazrul Shaikh

References

Holme, Petter, and Beom Jun Kim. "Growing scale-free networks with tunable clustering."Physical review E65, no. 2 (2002): 026107.

Examples

1
2
3
## Not run: 
x <- net.holme.kim (1000, 20, 0.1)
## End(Not run)

Example output



fastnet documentation built on Jan. 13, 2021, 5:28 p.m.