degree_similarity.multiplex: Degree based similarity of vertices in the multiplex network

In Issamfalih/MUNA: MUNA: A Multiplex Network Analysis Library

Description

The degree of vertices in the multiplex network, the number of its similar neighbors ie neighbors_similarity.multiplex

Usage

degree_similarity.multiplex(multiplex,node_name,similarity_function,delta)

Arguments

multiplex	: The multiplex object.
node_name	: Character scalar, or list. The vertex name of which the degree vertices are queried.
similarity_function	: Character scalar, the name of the similarity function.
delta	: Numeric scalar, the minimum pourcentage of layers in which the neighbors must be adjacent to the vertex.

Value

Dataframe the name of vertices and the degree of each vertex.

Author(s)

Issam Falih <[e-mail]>

Examples

M <- Multiplex_Lazega
degree_similarity.multiplex(M,"2" ,similarity.jaccard, 0)
degree_similarity.multiplex(M,c("2","4","45"), similarity.jaccard, 0.3)
degree_similarity.multiplex(M, similarity_function = similarity.jaccard, delta=0.8)
degree_similarity.multiplex(M, similarity_function = similarity.invlogweighted,delta= 0.3)
degree_similarity.multiplex(M, similarity_function = similarity.dice, delta=0.3)

Issamfalih/MUNA documentation built on May 8, 2019, 11:52 a.m.