persistence (version 0.2.0)

local_persistence: local_persistence

Description

Given the incidence vector of a vertex subset, it calculates the persistence probability or the null-adjusted persistence of C.

Usage

local_persistence(vertex, edge_list, weights, cluster, H0 = TRUE)

Value

the value of the null-adjusted persistence if H0 = T, the value of the persistence probability if H0 = F

Arguments

vertex

the vertices of the graph, whose label are integers and they must be consistent with the edge sets

edge_list

the graph edge list in the form of an integer matrix with two columns

weights

the graph edge weights.

cluster

A binary vector representing the incidence vector of the cluster: x_i = 1 if i in C, 0 otherwise.

H0

if true, it calculates the null-adjusted persistence, if false, the persistence probability.

Examples

library(persistence)
library(igraph)

edg = c(1, 2, 1, 3, 1, 4, 2, 3, 3, 4, 4, 5, 5, 6, 5, 7, 5, 8, 5, 9, 6, 7, 6, 8, 7, 9, 8, 9)
print(length(edg) / 2.0)
vertex = unique(edg)
edg = t(matrix(as.integer(edg), nrow = 2 ))
rete <- graph_from_edgelist(edg, directed = FALSE) # I graph this matrix
plot(rete)

cluster = rep(0, length(vertex))
v1 = c(1, 2, 3, 4)
cluster[v1] = 1
f1 = local_persistence(vertex, edg, weights=NULL, cluster, H0 = TRUE)
f2 = local_persistence(vertex, edg, weights=NULL, cluster, H0 = FALSE)