Pith. sign in

REVIEW

A hyper-distance-based method for hypernetwork comparison

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.04659 v1 pith:2PWXV44B submitted 2023-08-09 physics.soc-ph cs.SI

classification physics.soc-phcs.SI
keywords hypernetworksmethodbeencomparisonhigh-orderhyper-distance-basedhypernetworknodes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Hypernetwork is a useful way to depict multiple connections between nodes, making it an ideal tool for representing complex relationships in network science. In recent years, there has been a marked increase in studies on hypernetworks, however, the comparison of the difference between two hypernetworks has been given less attention. This paper proposes a hyper-distance-based method (HD) for comparing hypernetworks. This method takes into account high-order information, such as the high-order distance between nodes. The experiments carried out on synthetic hypernetworks have shown that HD is capable of distinguishing between hypernetworks generated with different parameters, and it is successful in the classification of hypernetworks. Furthermore, HD outperforms current state-of-the-art baselines to distinguish empirical hypernetworks when hyperedges are disrupted.

Discussion (0). Continue with ORCID to comment.

Pith tools