| build_simplicial | R Documentation |
Constructs a simplicial complex from a network or higher-order pathway object. Three construction methods are available:
Clique complex ("clique"): every clique in the
thresholded graph becomes a simplex. The standard bridge from graph
theory to algebraic topology.
Pathway complex ("pathway"): each higher-order
pathway from a net_hon or net_hypa becomes a simplex.
Vietoris-Rips ("vr"): nodes with edge weight
\geq threshold are connected; all cliques in the
resulting graph become simplices.
build_simplicial(
x,
type = "clique",
threshold = 0,
max_dim = 10L,
max_pathways = NULL,
...
)
x |
A square matrix, |
type |
Construction type: |
threshold |
Minimum absolute edge weight to include an edge (default 0). Edges below this are ignored. |
max_dim |
Maximum simplex dimension (default 10). A k-simplex has k+1 nodes. |
max_pathways |
For |
... |
Additional arguments passed to |
A simplicial_complex object.
betti_numbers, persistent_homology,
simplicial_degree, q_analysis
mat <- matrix(c(0,.6,.5,.6,0,.4,.5,.4,0), 3, 3)
colnames(mat) <- rownames(mat) <- c("A","B","C")
sc <- build_simplicial(mat, threshold = 0.3)
print(sc)
betti_numbers(sc)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.