bibliometrix (version 1.8)

networkPlot: Plotting Bibliographic networks

Description

networkPlot plots a bibliographic network.

Usage

networkPlot(NetMatrix, n = NULL, Degree = NULL, Title = "Plot",
  type = "kamada", label = TRUE, labelsize = 1, halo = FALSE,
  cluster = "walktrap", vos.path = NULL, size = FALSE, curved = FALSE,
  noloops = TRUE, remove.multiple = TRUE, remove.isolates = FALSE,
  weighted = NULL, edgesize = 1)

Arguments

NetMatrix

is a network matrix obtained by the function biblioNetwork.

n

is an integer. It indicates the number of vertices to plot.

Degree

is an integer. It idicates the min frequency of a vertex. If Degree is not NULL, n is ignored.

Title

is a character indicating the plot title.

type

is a character object. It indicates the network map layout:

type="circle"		Circle layout
type="sphere"		Sphere layout
type="mds"		Multidimensional Scaling layout
type="fruchterman"		Fruchterman-Reingold layout
type="kamada"		Kamada-Kawai layout
type="vosviewer"		Network is plotted using VOSviewer software

label

is logical. If TRUE vertex labels are plotted.

labelsize

is an integer. It indicates the label size in the plot. Default is labelsize=1

halo

is logical. If TRUE communities are plotted using different colors. Default is halo=FALSE

cluster

is a character. It indicates the type of cluster to perform among ("null", optimal", "lovain","infomap","edge_betweenness","walktrap").

vos.path

is a character indicating the full path whre VOSviewer.jar is located.

size

is logical. If TRUE the point size of each vertex is proportional to its degree.

curved

is a logical. If TRUE edges are plotted with an optimal curvature. Default is curved=FALSE

noloops

is logical. If TRUE loops in the network are deleted.

remove.multiple

is logical. If TRUE multiple links are plotted using just one edge.

remove.isolates

is logical. If TRUE isolates vertices are not plotted.

weighted

This argument specifies whether to create a weighted graph from an adjacency matrix. If it is NULL then an unweighted graph is created and the elements of the adjacency matrix gives the number of edges between the vertices. If it is a character constant then for every non-zero matrix entry an edge is created and the value of the entry is added as an edge attribute named by the weighted argument. If it is TRUE then a weighted graph is created and the name of the edge attribute will be weight.

edgesize

is an integer. It indicates the network edge size.

Value

It is a network object of the class igraph.

Details

The function networkPlot can plot a bibliographic network previously created by biblioNetwork. The network map can be plotted using internal R routines or using VOSviewer by Nees Jan van Eck and Ludo Waltman.

See Also

biblioNetwork to compute a bibliographic network.

cocMatrix to compute a co-occurrence matrix.

biblioAnalysis to perform a bibliometric analysis.

Examples

# NOT RUN {
# EXAMPLE Co-citation network

data(scientometrics)

NetMatrix <- biblioNetwork(scientometrics, analysis = "co-citation", 
network = "references", sep = ";")

net <- networkPlot(NetMatrix, n = 20, type = "kamada", Title = "Co-Citation")

# }