gen.A.from.P: generates a network from the given connection probability

In HCD: Hierarchical Community Detection by Recursive Partitioning

Description

Generates an adjacency matrix from a given probability matrix, according independent Bernoulli – the so-called inhomogeneous Erdos-Renyi model. It is used to generate new networks from a given model.

Usage

gen.A.from.P(P, undirected = TRUE)

Arguments

P	connection probability between nodes
undirected	logic value. FALSE (default) if the network is undirected, so the adjacency matrix will be symmetric with only upper diagonal entries being generated as independent Bernoulli.

Value

An adjacency matrix

Author(s)

Tianxi Li, Lihua Lei, Sharmodeep Bhattacharyya, Purnamrita Sarkar, Peter Bickel, and Elizaveta Levina.

Maintainer: Tianxi Li <[e-mail]>

References

Tianxi Li, Lihua Lei, Sharmodeep Bhattacharyya, Purnamrita Sarkar, Peter Bickel, and Elizaveta Levina. Hierarchical community detection by recursive partitioning. arXiv:1810.01509

HCD documentation built on Aug. 24, 2019, 5:03 p.m.