Analysis

Paths

temporal_s_dag(h, s[, start_from, stop_at, ...])	Build a time-respecting DAG over [start, end] for either hyperedges (edge=True) or nodes (edge=False).
time_respecting_s_walks(h, s, start_from[, ...])	Enumerate all time-respecting s-walks between a given source and optionally a target hyperedge.
all_time_respecting_s_walks(h, s[, start, ...])	Compute time-respecting s-walks originating from every hyperedge in the graph.
annotate_walks(paths)	Annotate a list of s-walks with standard path metrics.
walk_length(path)	Compute the number of edges in a temporal walk.
walk_duration(path)	Compute the duration of a temporal walk.
walk_weight(path)	Compute the total weight of a temporal walk.
all_simple_paths(h, s[, hyperedge_a, ...])	Generate all simple, s-overlap-valid paths in a hypergraph's line graph.
shortest_s_path(h, s, hyperedge_a[, ...])	Return all shortest simple, s-overlap-valid paths between two hyperedges.
shortest_s_walk(h, s[, fr, to, start, end, ...])	Compute shortest s-walk(s) considering weight or dual hypergraph.
closed_s_walk(h, s, hyperedge_a[, start, end])	Find all simple cycles (basis) in the s-line-graph containing a given node.
s_distance(h, s[, fr, to, start, end, ...])	Compute shortest-path distances in s-line-graph or dual hypergraph.
average_s_distance(h, s[, start, end, ...])	Compute the average shortest-path length in the s-line-graph.
has_s_walk(h, s[, fr, to, start, end, edge])	Determine if an s-overlap walk exists between two hyperedges.
s_diameter(h, s[, start, end, weight, edge])	Compute the diameter (longest shortest-path) of the s-line-graph.
s_components(h, s[, start, end, edge])	Yield connected components of the s-line-graph or its dual.
is_s_path(h, walk)	Validate that a hyperedge sequence is a simple s-path.

Attribute Analysis

hyperedge_most_frequent_node_attribute_value(h, ...)	Returns the most frequent value of a node attribute in a hyperedge.
hyperedge_aggregate_node_profile(h, ...[, ...])	Returns an aggregated profile of the nodes in a hyperedge.
hyperedge_profile_purity(h, hyperedge_id, tid)	Computes the purity of the hyperedge profile, i.e., the relative frequency of the most common attribute value for each attribute in the hyperedge nodes' profiles.
hyperedge_profile_entropy(h, hyperedge_id, tid)	Computes the entropy of the hyperedge profile, i.e., the entropy of the attribute values for each attribute in the hyperedge nodes' profiles.
star_profile_entropy(h, node_id, tid[, method])	Returns the entropy of the star profile of a node, i.e., the entropy of the attribute values for each attribute in the profiles of the nodes in the star of the given node.
star_profile_homogeneity(h, node_id, tid[, ...])	Returns the homogeneity of the star profile of a node, i.e., the relative frequency of the node's attribute value for each attribute in the profiles of the nodes in the star of the given node.
average_group_degree(h, tid[, hyperedge_size])	Computes the average degree of each group (nodes having the same label in the attribute)

Clustering

s_local_clustering_coefficient(h, s, ...[, ...])	Compute the local clustering coefficient of a hyperedge within the s-overlap line graph of a hypergraph.
average_s_local_clustering_coefficient(h, s)	Compute the average local clustering coefficient across all hyperedges in the s-overlap line graph.
s_intersections(h, s[, start, end])	Count the number of s-overlap intersections (edges) in the hypergraph's s-overlap line graph.
inclusiveness(h[, start, end])	Computes the inclusiveness of the hypergraph over [start, end], defined as:

S-Centrality

s_betweenness_centrality(h, s[, start, end, ...])	Returns the betweenness centrality of the nodes in the line graph of the hypergraph.
s_closeness_centrality(h, s[, start, end, edges])	Returns the closeness centrality of the nodes in the line graph of the hypergraph.
s_eccentricity(h, s[, start, end, edges])	Returns the eccentricity of the nodes in the line graph of the hypergraph.
s_harmonic_centrality(h, s[, start, end, edges])	Returns the harmonic centrality of the nodes in the line graph of the hypergraph.
s_katz(h, s[, start, end, edges, alpha, ...])	Returns the Katz centrality of the nodes in the line graph of the hypergraph.
s_load_centrality(h, s[, start, end, edges, ...])	Returns the load centrality of the nodes in the line graph of the hypergraph.
s_eigenvector_centrality(h, s[, start, end, ...])	Returns the eigenvector centrality of the nodes in the line graph of the hypergraph.
s_information_centrality(h, s[, start, end, ...])	Returns the information centrality of the nodes in the line graph of the hypergraph.
s_second_order_centrality(h, s[, start, ...])	Returns the second-order centrality of the nodes in the line graph of the hypergraph.

Hyper-Conformity

hyper_conformity(h, alphas, labels[, s, ...])

Compute the Attribute-Profile Conformity for the considered graph