node_census: Censuses of nodes' motifs
In migraph: Multimodal Network Analysis and More

node_census

R Documentation

Censuses of nodes' motifs

Description

These functions include ways to take a census of the positions of nodes in a network. These include a triad census based on the triad profile of nodes, but also a tie census based on the particular tie partners of nodes. Included also are group census functions for summarising the profiles of clusters of nodes in a network.

Usage

node_tie_census(.data)

node_triad_census(.data)

node_quad_census(.data)

node_path_census(.data)

Arguments

.data

An object of a {manynet}-consistent class:

matrix (adjacency or incidence) from {base} R
edgelist, a data frame from {base} R or tibble from {tibble}
igraph, from the {igraph} package
network, from the {network} package
tbl_graph, from the {tidygraph} package

Details

The quad census uses the {oaqc} package to do the heavy lifting of counting the number of each orbits. See vignette('oaqc'). However, our function relabels some of the motifs to avoid conflicts and improve some consistency with other census-labelling practices. The letter-number pairing of these labels indicate the number and configuration of ties. For now, we offer a rough translation:

migraph	Ortmann and Brandes
E4	co-K4
I40, I41	co-diamond
H4	co-C4
L42, L41, L40	co-paw
D42, D40	co-claw
U42, U41	P4
Y43, Y41	claw
P43, P42, P41	paw
04	C4
Z42, Z43	diamond
X4	K4

Functions

node_tie_census(): Returns a census of the ties in a network. For directed networks, out-ties and in-ties are bound together.
node_triad_census(): Returns a census of the triad configurations nodes are embedded in.
node_quad_census(): Returns a census of nodes' positions in motifs of four nodes.
node_path_census(): Returns the shortest path lengths of each node to every other node in the network.

References

Davis, James A., and Samuel Leinhardt. 1967. “The Structure of Positive Interpersonal Relations in Small Groups.” 55.

Ortmann, Mark, and Ulrik Brandes. 2017. “Efficient Orbit-Aware Triad and Quad Census in Directed and Undirected Graphs.” Applied Network Science 2(1):13. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1007/s41109-017-0027-2")}.

Dijkstra, Edsger W. 1959. "A note on two problems in connexion with graphs". Numerische Mathematik 1, 269-71. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1007/BF01386390")}.

Opsahl, Tore, Filip Agneessens, and John Skvoretz. 2010. "Node centrality in weighted networks: Generalizing degree and shortest paths". Social Networks 32(3): 245-51. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/j.socnet.2010.03.006")}.

Examples

task_eg <- manynet::to_named(manynet::to_uniplex(manynet::ison_algebra, "task_tie"))
(tie_cen <- node_tie_census(task_eg))
(triad_cen <- node_triad_census(task_eg))
node_quad_census(manynet::ison_southern_women)
node_path_census(manynet::ison_adolescents)
node_path_census(manynet::ison_southern_women)

migraph documentation built on Nov. 2, 2023, 5:47 p.m.