generate_holme_kim: Generates a Holme-Kim Network

In seekme94/influence.mining: Provides various methods for influence mining on Graphs

Generates a Holme-Kim Network

Description

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

Usage

generate_holme_kim(size, m, triad_prob = 0.1, directed = FALSE)

Arguments

size	is the number of nodes of the network
m	is the number of nodes to which a new node connects at each iteration
triad_prob	is Triad formation probability after each preferential attachment mechanism
directed	whether the graph is directed or not. Default is FALSE

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

{generate_holme_kim (1000, 20, 0.1)}

seekme94/influence.mining documentation built on Aug. 2, 2022, 10:19 p.m.