Pith. sign in

REVIEW 1 cited by

Diffusion backbone of temporal higher-order networks

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 2412.12856 v1 pith:K63TWHZ4 submitted 2024-12-17 physics.soc-ph cs.SI

classification physics.soc-phcs.SI
keywords diffusionhyperlinkbackbonehigher-orderhyperlinksnetworksprocesstemporal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Temporal higher-order networks, where each hyperlink involving a group of nodes are activated or deactivated over time, are recently used to represent complex systems such as social contacts, interactions or collaborations that occur at specific times. Such networks are substrates for social contagion processes like the diffusion of information and opinions. In this work, we consider eight temporal higher-order networks derived from human face-to-face interactions in various contexts and the Susceptible-Infected threshold process on each of these networks: whenever a hyperlink is active and the number of infected nodes in the hyperlink exceeds a threshold $\Theta$, each susceptible node in the hyperlink is infected independently with probability $\beta$. The objective is to understand (1) the contribution of each hyperlink to the diffusion process, namely, the average number of nodes that are infected directly via the activation of the hyperlink when the diffusion starts from an arbitrary seed node, and (2) hyperlinks with what network properties tend to contribute more. We first propose to construct the diffusion backbone. The backbone is a weighted higher-order network, where the weight of each hyperlink denotes the contribution of the hyperlink to a given diffusion process. Secondly, we find that the backbone, or the contribution of hyperlinks, is dependent on the parameters $\beta$ and $\Theta$ of the diffusion process, which is also supported by our theoretical analysis of the backbone when $\beta\rightarrow 0$. Thirdly, we systematically design centrality metrics for hyperlinks in a temporal higher-order network, and each centrality metric is used to estimate the ranking of hyperlinks by the weight in the backbone. Finally, we find and explain why different centrality metrics can better estimate the contributions of hyperlinks for different parameters of the diffusion process.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Hypergraph backboning

    cs.SI 2026-05 unverdicted novelty 7.0 of 10

    Presents a non-parametric information-theoretic backboning method for hypergraphs that removes nested/redundant structures to yield a minimal representation of higher-order interactions, with extension to weighted cases.

Pith tools