Learn R Programming

noisySBM (version 0.1.4)

Noisy Stochastic Block Mode: Graph Inference by Multiple Testing

Description

Variational Expectation-Maximization algorithm to fit the noisy stochastic block model to an observed dense graph and to perform a node clustering. Moreover, a graph inference procedure to recover the underlying binary graph. This procedure comes with a control of the false discovery rate. The method is described in the article "Powerful graph inference with false discovery rate control" by T. Rebafka, E. Roquain, F. Villers (2020) .

Copy Link

Version

Install

install.packages('noisySBM')

Monthly Downloads

230

Version

0.1.4

License

GPL-2

Maintainer

Tabea Rebafka

Last Published

December 16th, 2020

Functions in noisySBM (0.1.4)

ARI

Evalute the adjusted Rand index
classInd

convert a clustering into a 0-1-matrix
addRowToTau

split group q of provided tau randomly into two into
ICL_Q

computation of the Integrated Classification Likelihood criterion
JEvalMstep

evaluation of the objective in the Gauss model
convertGroupPairIdentifier

takes a scalar indice of a group pair (q,l) and returns the values q and l
convertGroupPair

transform a pair of block identifiers (q,l) into an identifying integer
Mstep

M-step
J.gamma

evaluate the objective in the Gamma model
VEstep

VE-step
getBestQ

optimal number of SBM blocks
graphInference

new graph inference procedure
plotICL

plot ICL curve
getTauql

Evaluate tau_q*tau_l in the noisy stochastic block model
plotGraphs

plot the data matrix, the inferred graph and/or the true binary graph
mainVEM_Q_par

main function of VEM algorithm for fixed number of latent blocks in parallel computing
q_delta_ql

auxiliary function for the computation of q-values
modelDensity

evaluate the density in the current model
qvaluesNSBM

compute q-values in the noisy stochastic block model
initialPointsByMerge

Construct initial values with Q groups by meging groups of a solution obtained with Q+1 groups
initialPoints

compute a list of initial points for the VEM algorithm
convertNodePair

transform a pair of nodes (i,j) into an identifying integer
lvaluesNSBM

compute conditional l-values in the noisy stochastic block model
mainVEM_Q

main function of VEM algorithm with fixed number of SBM blocks
correctTau

corrects values of the variational parameters tau that are too close to the 0 or 1
getRho

compute rho associated with given values of w, nu0 and nu
fitNSBM

VEM algorithm to adjust the noisy stochastic block model to an observed dense adjacency matrix
emv_gamma

compute the MLE in the Gamma model using the Newton-Raphson method
tauUp

Create new values of tau by splitting groups of provided tau
initialTau

compute intial values for tau
initialRho

compute initial values of rho
res_exp

Output of fitNSBM() on a dataset applied in the exponential NSBM
initialPointsBySplit

Construct initial values with Q groups by splitting groups of a solution obtained with Q-1 groups
listNodePairs

returns a list of all possible node pairs (i,j)
spectralClustering

spectral clustering with absolute values
res_gamma

Output of fitNSBM() on a dataset applied in the Gamma NSBM
tauUpdate

Compute one iteration to solve the fixed point equation in the VE-step
update_newton_gamma

Perform one iteration of the Newton-Raphson to compute the MLE of the parameters of the Gamma distribution
rnsbm

simulation of a graph according the noisy stochastic block model
res_gauss

Output of fitNSBM() on a dataset applied in the Gaussian NSBM
tauDown

Create new initial values by merging pairs of groups of provided tau