compute_BC_ranking: Function to compute the Betweenness Centrality ranking.

In Diderot: Bibliographic Network Analysis

Description

This function computes the Betweenness Centrality (BC) for each graph node (i.e. publication).

Usage

compute_BC_ranking(gr, labels, write_to_graph = F)

Arguments

gr	Citation graph
labels	Labels (i.e. names) of the two corpora featured in the graph.
write_to_graph	Flag to indicate whether to write results to the graph (i.e. save BC values as node attributes).

Value

If write_to_graph is FALSE, returns a list of entries (authors, title, year, corpus, BC) sorted by decreasing BC. Else, returns the graph given as input to which BC values are added as node attributes.

Author(s)

Christian Vincenot ([e-mail])

See Also

compute_citation_ranking, compute_Ji_ranking

Examples

labels<-c("Corpus1","Corpus2")

# Build a bibliographical dataset from Scopus exports
db<-create_bibliography(corpora_files=c(tempfi1,tempfi2), 
                        labels=labels, keywords=NA)


# Build graph
gr<-build_graph(db=db,small.year.mismatch=TRUE, attrs=c("Corpus","Year","Authors"), nb.cores=1)

# Compute BC
compute_BC_ranking(gr, labels)

Diderot documentation built on April 19, 2020, 4:16 p.m.