| network-package {network} | R Documentation |
Tools to create and modify network objects. The network class can represent a range of relational data types, and supports arbitrary vertex/edge/graph attributes.
The network package provides tools for creation, access, and modification of network class objects. These objects allow for the representation of more complex structures than can be readily handled by other means (e.g., adjacency matrices), and are substantially more efficient in handling large, sparse networks. While the full capabilities of the network class can only be exploited by means of the various custom interface methods (see below), many simple tasks are streamlined through the use of operator overloading; in particular, network objects can often be treated as if they were adjacency matrices (a representation which will be familiar to users of the sna package). network objects are compatible with the sna package, and are required for many packages in the statnet bundle.
Basic information on the creation of network objects can be found by typing help(network). To learn about setting, modifying, or deleting network, vertex, or edge attributes, see help(attribute.methods). For information on custom network operators, type help(network.operators); information on overloaded operators can be found via help(network.extraction). Additional help topics are listed below.
| Package: | network |
| Version: | 1.9 |
| Date: | January 3, 2014 |
| Depends: | R (>= 2.10), utils |
| Suggests: | sna |
| License: | GPL (>=2) |
Index od documentation pages:
add.edges Add Edges to a Network Object
add.vertices Add Vertices to an Existing Network
as.matrix.network Coerce a Network Object to Matrix Form
as.network.matrix Coercion from Matrices to Network Objects
as.sociomatrix Coerce One or More Networks to Sociomatrix Form
attribute.methods Attribute Interface Methods for the Network Class
deletion.methods Remove Elements from a Network Object
edgeset.constructors Edgeset Constructors for Network Objects
emon Interorganizational Search and Rescue Networks (Drabek et
al.)
flo Florentine Wedding Data (Padgett)
get.edges Retrieve Edges or Edge IDs Associated with a Given Vertex
get.inducedSubgraph Retrieve Induced Subgraphs and Cuts
get.neighborhood Obtain the Neighborhood of a Given Vertex
is.adjacent Determine Whether Two Vertices Are Adjacent
loading.attributes Examples of how to load vertex and edge attributes into
networks
missing.edges Identifying and Counting Missing Edges in a Network Object
network Network Objects
network.arrow Add Arrows or Segments to a Plot
network.density Compute the Density of a Network
network.dyadcount Return the Number of (Possibly Directed) Dyads in a
Network Object
network.edgecount Return the Number of Edges in a Network Object
network.edgelabel Plots a label corresponding to an edge in a network plot.
network.extraction Extraction and Replacement Operators for Network Objects
network.indicators Indicator Functions for Network Properties
network.initialize Initialize a Network Class Object
network.layout Vertex Layout Functions for plot.network
network.loop Add Loops to a Plot
network.operators Network Operators
network-package Classes for Relational Data
network.size Return the Size of a Network
network.vertex Add Vertices to a Plot
permute.vertexIDs Permute (Relabel) the Vertices Within a Network
plot.network.default Two-Dimensional Visualization for Network Objects
prod.network Combine Networks by Edge Value Multiplication
read.paj Read a Pajek Project or Network File and Convert to an R
'Network' Object
sum.network Combine Networks by Edge Value Addition
valid.eids Get the valid edge which are valid in a network
which.matrix.type Heuristic Determination of Matrix Types for Network
Storage
Carter T. Butts <buttsc@uci.edu>, with help from Mark S. Handcock <handcock@stat.ucla.edu>, David Hunter <dhunter@stat.psu.edu>, Martina Morris <morrism@u.washington.edu>, and Skye Bender-deMoll <skyebend@u.washington.edu>
Maintainer: Carter T. Butts <buttsc@uci.edu>