hrg
From igraph v1.0.1
by Gabor Csardi
Create a hierarchical random graph from an igraph graph
hrg creates a HRG from an igraph graph. The igraph graph must be
a directed binary tree, with \(n-1\) internal and \(n\) leaf
vertices. The prob argument contains the HRG probability labels
for each vertex; these are ignored for leaf vertices.
Usage
hrg(graph, prob)Arguments
- graph
The igraph graph to create the HRG from.
- prob
A vector of probabilities, one for each vertex, in the order of vertex ids.
Value
hrg returns an igraphHRG object.
See Also
Other hierarchical random graph functions: consensus_tree,
hrg.consensus; fit_hrg,
hrg.fit; hrg-methods;
hrg.game, sample_hrg;
hrg.predict, predict_edges;
hrg_tree;
print.igraphHRGConsensus;
print.igraphHRG
Community examples
Looks like there are no examples yet.