sna (version 2.8)

bicomponent.dist: Calculate the Bicomponents of a Graph

Description

bicomponent.dist returns the bicomponents of an input graph, along with size distribution and membership information.

Usage

bicomponent.dist(dat, symmetrize = c("strong", "weak"))

Value

A list containing

members

A list, with one entry per bicomponent, containing component members.

memberships

A vector of component memberships, by vertex. (Note: memberships may not be unique.) Vertices not belonging to any bicomponent have membership values of NA.

csize

A vector of component sizes, by bicomponent.

cdist

A vector of length \(|V(G)|\) with the (unnormalized) empirical distribution function of bicomponent sizes.

Arguments

dat

a graph or graph stack.

symmetrize

symmetrization rule to apply when pre-processing the input (see symmetrize).

Author

Carter T. Butts

Details

The bicomponents of undirected graph G are its maximal 2-connected vertex sets. bicomponent.dist calculates the bicomponents of \(G\), after first coercing to undirected form using the symmetrization rule in symmetrize. In addition to bicomponent memberships, various summary statistics regarding the bicomponent distribution are returned; see below.

References

Brandes, U. and Erlebach, T. (2005). Network Analysis: Methodological Foundations. Berlin: Springer.

See Also

component.dist, cutpoints, symmetrize

Examples

#Draw a moderately sparse graph
g<-rgraph(25,tp=2/24,mode="graph")

#Compute the bicomponents
bicomponent.dist(g)