Description Usage Arguments Details Value Warning Author(s) References See Also Examples
network.density
computes the density of its argument.
1 | network.density(x, na.omit=TRUE, discount.bipartite=FALSE)
|
x |
an object of class |
na.omit |
logical; omit missing edges from extant edges when assessing density? |
discount.bipartite |
logical; if |
The density of a network is defined as the ratio of extant edges to potential edges. We do not currently consider edge values; missing edges are omitted from extent (but not potential) edge count when na.omit==TRUE
.
The network density.
network.density
relies on network attributes (see network.indicators) to determine the properties of the underlying network object. If these are set incorrectly (e.g., multiple edges in a non-multiplex network, network coded with directed edges but set to “undirected”, etc.), surprising results may ensue.
Carter T. Butts buttsc@uci.edu
Butts, C. T. (2008). “network: a Package for Managing Relational Data in R.” Journal of Statistical Software, 24(2). http://www.jstatsoft.org/v24/i02/
Wasserman, S. and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.
network.edgecount
, network.size
1 2 3 4 5 6 | #Create an arbitrary adjacency matrix
m<-matrix(rbinom(25,1,0.5),5,5)
diag(m)<-0
g<-network.initialize(5) #Initialize the network
network.density(g) #Calculate the density
|
network: Classes for Relational Data
Version 1.15 created on 2019-04-01.
copyright (c) 2005, Carter T. Butts, University of California-Irvine
Mark S. Handcock, University of California -- Los Angeles
David R. Hunter, Penn State University
Martina Morris, University of Washington
Skye Bender-deMoll, University of Washington
For citation information, type citation("network").
Type help("network-package") to get started.
[1] 0
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.