These functions create networks with particular structural properties.
They can create either one-mode or two-mode networks.
To create a one-mode network, pass the main argument n a single integer,
indicating the number of nodes in the network.
To create a two-mode network, pass n a vector of two integers,
where the first integer indicates the number of nodes in the first mode,
and the second integer indicates the number of nodes in the second mode.
As an alternative, an existing network can be provided to n
and the number of modes, nodes, and directedness will be inferred.
By default, all networks are created as undirected.
This can be overruled with the argument directed = TRUE.
This will return a directed network in which the arcs are
out-facing or equivalent.
This direction can be swapped using to_redirected().
In two-mode networks, the directed argument is ignored.
create_empty(n, directed = FALSE)create_filled(n, directed = FALSE)
create_ring(n, directed = FALSE, width = 1, ...)
create_star(n, directed = FALSE)
create_tree(n, directed = FALSE, width = 2)
create_lattice(n, directed = FALSE, width = 8)
create_components(n, directed = FALSE, membership = NULL)
create_core(n, directed = FALSE, membership = NULL)
By default a tbl_graph object is returned,
but this can be coerced into other types of objects
using as_edgelist(), as_matrix(),
as_tidygraph(), or as_network().
Given:
A single integer, e.g. n = 10,
a one-mode network will be created.
A vector of two integers, e.g. n = c(5,10),
a two-mode network will be created.
A manynet-compatible object, a network of the same dimensions will be created.
Logical whether the graph should be directed.
By default directed = FALSE.
If the opposite direction is desired,
use to_redirected() on the output of these functions.
Integer specifying the width of the ring, breadth of the branches, or maximum extent of the neighbourbood.
Additional arguments passed on to {igraph}.
A vector of partition membership as integers.
If left as NULL (the default), nodes in each mode will be
assigned to two, equally sized partitions.
create_empty(): Creates an empty graph of the given dimensions.
create_filled(): Creates a filled graph of the given dimensions,
with every possible tie realised.
create_ring(): Creates a ring or chord graph of the given dimensions
that loops around is of a certain width or thickness.
create_star(): Creates a graph of the given dimensions
that has a maximally central node.
create_tree(): Creates a graph of the given dimensions with
successive branches.
create_lattice(): Creates a lattice graph of the given dimensions with ties
to all neighbouring nodes.
create_components(): Creates a graph in which the nodes are clustered
into separate components.
create_core(): Creates a graph with a certain proportion of nodes
being core nodes, densely tied to each other and peripheral nodes,
and the rest peripheral, tied only to the core.
create_lattice() creates both two-dimensional grid and triangular
lattices with as even dimensions as possible.
When the width parameter is set to 4, nodes cannot have (in or out)
degrees larger than 4.
This creates regular square grid lattices where possible.
Such a network is bipartite, that is partitionable into two types that are
not adjacent to any of their own type.
If the number of nodes is a prime number, it will only return a chain
(a single dimensional lattice).
A width parameter of 8 creates a network where the maximum degree of any
nodes is 8.
This can create a triangular mesh lattice or a Queen's move lattice,
depending on the dimensions.
A width parameter of 12 creates a network where the maximum degree of
any nodes is 12.
Prime numbers of nodes will return a chain.
as
Other makes:
as(),
generate,
read
create_empty(10)
create_filled(10)
create_ring(8, width = 2)
create_star(12)
create_tree(c(7,8))
create_lattice(12, width = 4)
create_components(10, membership = c(1,1,1,2,2,2,3,3,3,3))
create_core(6)
Run the code above in your browser using DataLab