fused.trans:
The graph based penalty transformation matrix
Description
Get the graph based penalty transformation matrix, i.e. $D_p$ in $p_{\lambda}(\beta) = \lambda\|D_p\beta\|_1.$
Usage
fused.trans(A)
Arguments
A
input matrix -- adjacency matrix of an observed graph based on the non-isolated nodes, of dimension n.noniso x n.noniso, where n.noniso is the number of the non-isolated nodes.
Value
the graph based penalty transformation matrix, of dimension $|E| \times n$, where $|E|$ is the number of edges in the graph and $n$ is the number of nodes.
References
Yang Feng, Richard J. Samworth and Yi Yu, Community Detection via Fused Principal Component Analysis, manuscript.
## to generate an adjacency matrixA = matrix(c(0,1,1,1,0,0,1,0,0), byrow = TRUE, ncol = 3)
## have a look at AA
## the graph based transformation matrixfused.trans(A)