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.
hrg(graph, prob)
The igraph graph to create the HRG from.
A vector of probabilities, one for each vertex, in the order of vertex ids.
hrg
returns an igraphHRG
object.
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