sparsify.with.lspar: Extract Satuluri et al's (2011) L-spar backbone

Description

sparsify.with.lspar is a wrapper for sparsify() that extracts the L-spar backbone described by Satuluri et al. (2011). It is equivalent to sparsify(escore = "jaccard", normalize = "rank", filter = "degree", umst = FALSE).

Usage

sparsify.with.lspar(U, s, class = "original", narrative = FALSE)

Arguments

An unweighted unipartite graph, as: (1) an adjacency matrix in the form of a matrix or sparse Matrix; (2) an edgelist in the form of a two-column dataframe; (3) an igraph object; (4) a network object.

numeric: Sparsification exponent, 0 < s < 1; smaller values yield sparser graphs

class

string: the class of the returned backbone graph, one of c("original", "matrix", "sparseMatrix", "igraph", "network", "edgelist"). If "original", the backbone graph returned is of the same class as U.

narrative

boolean: TRUE if suggested text & citations should be displayed.

Value

An unweighted, undirected, unipartite graph of class class.

References

Satuluri, V., Parthasarathy, S., & Ruan, Y. (2011, June). Local graph sparsification for scalable clustering. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of data (pp. 721-732). 10.1145/1989323.1989399

Examples

Run this code

# NOT RUN {
U <- igraph::sbm.game(60, matrix(c(.75,.25,.25,.25,.75,.25,.25,.25,.75),3,3), c(20,20,20))
plot(U) #A hairball
sparse <- sparsify.with.lspar(U, s = 0.6, narrative = TRUE)
plot(sparse) #Clearly visible communities
# }