Package index • netrics

Marks Functions for identifying properties of nodes or ties, all returning logical scalars or vectors.
Nodal marks `node_is_*()` functions return a vector of logical values the length of the nodes in the network.
`node_is_core()`	Marks of nodes as core or periphery
`node_is_isolate()` `node_is_pendant()` `node_is_universal()`	Marks of nodes based on degree properties
`node_is_latent()` `node_is_infected()` `node_is_recovered()` `node_is_exposed()`	Marks of nodes based on diffusion properties
`node_is_independent()` `node_is_cutpoint()` `node_is_fold()` `node_is_mentor()` `node_is_neighbor()`	Marks of nodes based on structural properties
`node_is_random()` `node_is_max()` `node_is_min()` `node_is_mean()`	Marks of nodes based on measures
Tie marks `tie_is_*()` functions return a vector of logical values the length of the ties in the network.
`tie_is_multiple()` `tie_is_reciprocated()`	Marks of ties based on dyadic properties
`tie_is_random()` `tie_is_max()` `tie_is_min()`	Marks of ties based on measures
`tie_is_loop()` `tie_is_feedback()` `tie_is_bridge()` `tie_is_path()`	Marks of ties based on structural properties
`tie_is_triangular()` `tie_is_transitive()` `tie_is_triplet()` `tie_is_cyclical()` `tie_is_simmelian()` `tie_is_imbalanced()`	Marks of ties based on triangular properties
Measures Functions for measuring networks and returning a numeric vector or value. `net_` measures return one or, in some cases of two-mode measures, two values. All `node_` and `tie_` measures return a single vector, the length of the nodes or ties in the network, respectively.
Centrality
`node_by_betweenness()` `node_by_induced()` `node_by_flow()` `node_by_stress()`	Measures of node betweenness-like centrality
`node_by_closeness()` `node_by_harmonic()` `node_by_reach()` `node_by_decay()` `node_by_integration()` `node_by_radiality()` `node_by_information()` `node_by_eccentricity()` `node_by_distance()` `node_by_vitality()` `node_by_randomwalk()`	Measures of node closeness-like centrality
`node_by_degree()` `node_by_deg()` `node_by_outdegree()` `node_by_indegree()` `node_by_multidegree()` `node_by_leverage()`	Measures of node degree-like centrality
`node_by_eigenvector()` `node_by_power()` `node_by_alpha()` `node_by_pagerank()` `node_by_authority()` `node_by_hub()` `node_by_subgraph()` `node_by_posneg()`	Measures of node eigenvector-like centrality
`tie_by_betweenness()`	Measures of tie betweenness-like centrality
`tie_by_closeness()`	Measures of tie closeness-like centrality
`tie_by_degree()`	Measures of tie degree-like centrality
`tie_by_eigenvector()`	Measures of tie eigenvector-like centrality
`net_by_betweenness()` `mode_by_betweenness()`	Measures of network betweenness-like centralisation
`net_by_closeness()` `mode_by_closeness()` `net_by_reach()` `net_by_decay()` `net_by_integration()` `net_by_harmonic()`	Measures of network closeness-like centralisation
`net_by_degree()` `mode_by_degree()` `net_by_outdegree()` `net_by_indegree()` `mode_by_outdegree()` `mode_by_indegree()`	Measures of network degree-like centralisation
`net_by_eigenvector()` `mode_by_eigenvector()`	Measures of network eigenvector-like centralisation
Brokerage
`node_by_bridges()` `node_by_redundancy()` `node_by_effsize()` `node_by_efficiency()` `node_by_constraint()` `node_by_hierarchy()` `node_by_neighbours_degree()`	Measures of node brokerage
`tie_by_cohesion()`	Measures of tie brokerage
`node_by_brokering_activity()` `node_by_brokering_exclusivity()`	Measures of brokerage
Hierarchy
`net_by_connectedness()` `net_by_efficiency()` `net_by_upperbound()`	Measures of hierarchy
Cohesion
`net_by_diameter()` `net_by_length()`	Measures of network breadth
`net_by_density()` `net_by_compactness()` `net_by_components()` `net_by_independence()`	Measures of network cohesion
`net_by_reciprocity()` `net_by_transitivity()` `net_by_cyclicality()` `net_by_equivalency()` `net_by_congruency()`	Measures of network closure
`node_by_reciprocity()` `node_by_transitivity()` `node_by_equivalency()`	Measures of node closure
Topology
`net_by_richclub()` `net_by_smallworld()` `net_by_scalefree()` `net_by_bipartivity()` `net_by_balance()`	Measures of network topological features
`net_by_cohesion()` `net_by_adhesion()` `net_by_strength()` `net_by_toughness()`	Measures of network fragmentation
`node_by_kcoreness()` `node_by_core()`	Measures of node coreness
`net_by_core()` `net_by_factions()` `net_by_modularity()` `net_by_linkdensity()` `net_by_divergence()` `net_by_inconsistency()`	Measures of how well a structure fits a network
Heterogeneity
`net_by_heterophily()` `net_by_homophily()` `net_by_assortativity()` `net_by_spatial()`	Measures of network assortativity
`node_by_heterophily()` `node_by_homophily()`	Measures of node assortativity
`net_by_richness()` `net_by_diversity()`	Measures of network diversity
`node_by_richness()` `node_by_diversity()`	Measures of node diversity
Dynamics
`net_by_waves()`	Measures of network change
`net_by_infection_complete()` `net_by_infection_total()` `net_by_infection_peak()`	Measures of network infection
`net_by_transmissibility()` `net_by_recovery()` `net_by_reproduction()` `net_by_immunity()`	Measures of network diffusion
`node_by_adopt_time()` `node_by_adopt_threshold()` `node_by_adopt_recovery()` `node_by_adopt_exposure()`	Measures of nodes in a diffusion
Memberships Functions for identifying nodes’ community, cluster, or class membership, recognisable by the `_in_` in the function name. They return a character vector the length of the nodes in the network.
Communities
`node_in_community()`	Memberships in communities
`node_in_betweenness()` `node_in_greedy()` `node_in_eigen()` `node_in_walktrap()`	Memberships in communities that form a hierarchy
`tie_in_community()`	Memberships of ties in link communities
`node_in_optimal()` `node_in_spinglass()` `node_in_louvain()` `node_in_leiden()`	Memberships in communities that optimise a quality function
`node_in_partition()` `node_in_faction()`	Memberships in communities that fill a set number of groups
`node_in_infomap()` `node_in_fluid()` `node_in_labels()`	Memberships in communities that follow a spreading process
Other memberships
`node_in_brokering()`	Memberships in brokerage positions
`node_in_roulette()`	Memberships in maximally diverse cliques
`node_in_component()`	Memberships in components
`node_in_core()`	Memberships in core-periphery categories
`node_in_adopter()`	Memberships in a diffusion process
`node_in_equivalence()` `node_in_structural()` `node_in_regular()` `node_in_motif()` `node_in_automorphic()` `node_in_block()`	Memberships in equivalent classes
Motifs Functions for tabulating the subgraphs that nodes or networks participate in, recognisable by the `_x_` in the function name. They return a matrix or table, with the motif or other property as columns. Nodes are cross-referenced against categories and never against nodes; node-by-node results come from manynet’s `to_*()` functions.
`net_x_brokerage()`	Motifs of network brokerage
`node_x_brokerage()`	Motifs of node brokerage
`node_x_clique()` `node_x_percolation()`	Motifs of clique participation
`node_x_ties()` `node_x_alters()` `node_x_similarity()`	Motifs of ego-network composition
`node_x_exposure()`	Motifs of node exposure
`net_x_hazard()`	Motifs of network hazard
`net_x_hierarchy()`	Motifs of network hierarchy
`net_x_homophily()`	Motifs of network homophily
`net_x_dyad()` `net_x_triad()` `net_x_tetrad()`	Motifs of network cohesion
`node_x_dyad()` `node_x_triad()` `node_x_tetrad()`	Motifs of node cohesion
`node_x_tie()` `node_x_path()`	Motifs of node pathing
`net_x_change()` `net_x_stability()` `net_x_correlation()`	Motifs of network change
Methods Methods used in other functions but documented here:
`cluster_hierarchical()` `cluster_cosine()` `cluster_concor()`	Methods for equivalence clustering
`coreness_correlation()` `coreness_rich()` `coreness_transition()` `coreness_hub()`	Methods for calculating coreness
`k_strict()` `k_elbow()` `k_silhouette()` `k_gap()`	Methods for selecting clusters
`regularity_rolesim()` `regularity_rege()`	Methods for calculating regularity
`search_iterated()` `search_tabu()`	Methods for searching for the membership that minimises a cost
`split_bins()` `split_quantiles()` `split_kmeans()`	Methods for splitting a continuous score into ordered groups

Reference

Marks

Nodal marks

Tie marks

Measures

Centrality

Brokerage

Hierarchy

Cohesion

Topology

Heterogeneity

Dynamics

Memberships

Communities

Other memberships

Motifs

Methods