Pith. sign in

REVIEW 4 major objections 6 minor 38 references

Revealing Higher-Order Interactions in Complex Networks: A U.S. Diplomacy Case Study

T0 review · 4 major / 6 minor · reviewed 2026-08-04 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A random walk that remembers its last group edge predicts which embassy-to-embassy group contacts form next, beating pairwise-graph baselines on the CableGate corpus.

desk verdict Novel non-Markovian hyperwalk and new CableGate dataset, but the evaluation's data-leak ambiguity and test-set tuning need fixing before the claims hold. read the letter →

arxiv 2509.10333 v1 pith:PG2UWR2E submitted 2025-09-12 cs.SI

Arthur Rondeau , Didier Wernli , Roland Bouffanais This is my paper · ORCID
classification cs.SI MSC 05C6505C8191D30
keywords higher-ordernetworkshypergraphsedge-dependentvertexweightsnon-MarkovianrandomwalkshyperedgepredictiondiplomaticCableGategroupinteractions
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that diplomatic communication among U.S. embassies and consulates is genuinely a group-level phenomenon, and that modeling each cable as a hyperedge lets a random walker predict which new group interactions will occur. Each of the 181,000 processed cables becomes one hyperedge linking the sending and all receiving missions, with the sender weighted twice as heavily as each receiver within that cable. The authors add a non-Markovian random walk, Hyperwalk, whose next step depends on the size of the group edge just left, and compare it with a Markovian walk on the hypergraph and with a walk on the clique-projected pairwise graph. On the CableGate corpus and on Senate bill co-sponsorship data, Hyperwalk matches or outperforms both baselines, and its advantage grows with hyperedge size; a substantial part of the correctly predicted interactions were never seen in the training set. The upshot is a practical recipe for deciding when a higher-order network model is worth using rather than a pairwise projection.

What carries the argument

The central object is the EDVW (edge-dependent vertex weight) hypergraph, in which each cable is a hyperedge and the same embassy can have different weights in different cables (sender weight 2, receiver weight 1 in that cable). The mechanism that carries the argument is Hyperwalk, a non-Markovian random walk: at each step it selects a hyperedge, then a vertex inside it, and then restarts the walk with probability 1 - (|e|-2)/|e|, so larger group edges retain the walker longer and the next move depends on the size of the edge just visited. This size-dependent restart breaks time-reversibility, ruling out equivalence to a walk on a projected graph. Scores for comparing candidate hyperedges ar

What would settle it

Restrict the CableGate corpus to cables whose recipient lists are small and topic-specific (e.g., fewer than five missions or explicitly addressed to named desks) and recompute the hyperedge-prediction advantage; if the gap over the clique-graph baseline collapses, the higher-order signal came from broadcast recipient lists rather than from diplomatic structure. Alternatively, use cables from 2011-2012 as a held-out time period and check whether hyperedges predicted from earlier data actually occur.

Watch

Extended reading notes

Core claim

The paper's central claim is that a random walk on an edge-dependent-vertex-weight (EDVW) hypergraph, made non-Markovian by retaining information about the hyperedge just traversed, captures higher-order interaction structure that cannot be reproduced by any random walk on the projected pairwise graph. The authors verify that neither the Markovian nor the non-Markovian hypergraph walk satisfies detailed balance, so neither is time-reversible and neither can be reduced to a walk on an undirected projected graph. Across two self-supervised tasks—detecting fake hyperedges and guessing the missing nodes of held-out hyperedges—the non-Markovian Hyperwalk on the EDVW hypergraph matches or beats th

Load-bearing premise

Each cable is assumed to represent a genuine group interaction binding the sender to every listed receiver; if many recipient lists are administrative distribution lists rather than active multiway exchanges, the higher-order structure and the predicted 'new' interactions are artifacts of cable formatting.

Editorial extensions

If this is right

  • For any domain with genuine multiway interactions—legislation co-sponsorship, organizational email, multilateral negotiation—hyperedge prediction can be run with the same pipeline, and the gap between Hyperwalk and pairwise baselines is a direct diagnostic of whether higher-order structure is present.
  • When the Hyperwalk advantage grows with hyperedge size, group-level processes (consensus-seeking, information sharing within a meeting) are the right lens; when it does not, a pairwise projection is sufficient, as the paper finds on the Email-Eu dataset.
  • The predicted novel diplomatic hyperedges provide a ranked, falsifiable list of candidate embassy-consulate relationships that could be checked against later cables or declassified documents.
  • Because the pipeline uses only metadata (sender, receivers, timestamp), it can be applied to other diplomatic or organizational communication corpora without content access.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural temporal test: split the cables by timestamp and ask whether hyperedges predicted from early years appear in later years. If yes, the model is discovering real relationship formation; if not, it may be capturing static co-addressing patterns.
  • The restart probability 1 - (|e|-2)/|e| is one specific size-dependent schedule; treating it as a tunable function and cross-validating per dataset could reveal whether the mechanism is genuinely the edge-size memory or merely added stochasticity.
  • If recipient lists in cables are partly broadcast or 'information copy' lists, filtering cables by some minimal reply/interaction signal (e.g., cables that later get referenced or amended) would sharpen the distinction between administrative distribution and true multiway engagement.
  • The dataset-dependence observed here suggests a practical rule of thumb: the hypergraph advantage is most credible where the size-gap grows, as in Senate-Bills and CableGate, and least credible where it shrinks, as in Email-Eu.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper proposes representing diplomatic communications and other group interactions as EDVW (edge-dependent vertex weight) hypergraphs and introduces a non-Markovian random walk ('Hyperwalk') on such hypergraphs. It evaluates this representation against pairwise clique-graph baselines on two self-supervised tasks: fake-hyperedge detection and hyperedge prediction. Experiments are reported on WikiLeaks CableGate cables, Senate co-sponsorship, and Email-Eu/Enron datasets. The central claim is that the EDVW hypergraph paired with the non-Markovian walk outperforms pairwise-graph walks, especially for larger hyperedges, and can infer previously unobserved diplomatic interactions.

Significance. If the empirical claims are correct, the paper would provide a practical demonstration of when hypergraph modeling is preferable to pairwise graphs and introduce a new random-walk dynamics for EDVW hypergraphs. The use of multiple datasets, multiple negative-sampling schemes, and a concrete case study (CableGate) makes the contribution potentially useful to the higher-order network community. However, the evaluation protocol has serious ambiguities and potential leaks that directly affect the headline results. The paper does not ship code or data, and the non-Markovian walk is not fully specified, so the empirical claims are currently not reproducible and the comparative advantage of Hyperwalk is not established.

major comments (4)
  1. [§2.3.2 (EDVW Hypergraph Non-Markovian Random Walk)] The transition rule is incompletely specified. After moving from v to w, the walker is told to 'Restart from step 1 with probability 1-(|e|-2)/|e|' but the complementary behavior is not defined. Without the complement, the process is not a well-defined stochastic process, and the subsequent Monte Carlo simulation lacks a precise transition kernel. This makes the 'hyperwalk' results irreproducible and the comparison in Figures 5–8 and Tables 4–7 unverifiable.
  2. [§2.5 vs. Algorithm 1] There is a direct inconsistency between the text and the algorithm precondition. Section 2.5 Step 3 states the similarity matrix S is computed 'on the remaining hypergraph defined by E_T', but Algorithm 1's precondition reads 'score list S_steps (built on E_T with E = E_T ∪ E_P, E_T ∩ E_P = ∅)'. If S_steps is built on E = E_T ∪ E_P, then each probe hyperedge is present in the transition probabilities used for prediction, turning the hyperedge-prediction task into a memorization test. The 'novel interaction' ratios in Figures 6 and 8 would then not demonstrate generalization. This ambiguity must be resolved, and if the leak occurs, all prediction results must be recomputed.
  3. [§2.4–2.5, Tables 4–7] The reported AUCs are 'mean ± std of the per-fold maxima'. Selecting the best K (or any other hyperparameter) separately on each fold's test set is a form of test-set overfitting and inflates performance. It is especially problematic for comparing methods with different numbers of tunable parameters, since Hyperwalk has additional parameters (N, restart probability). The paper does not describe the hyperparameter grid or the selection criterion. Performance should be reported at a fixed, pre-specified hyperparameter setting or using nested cross-validation.
  4. [§2.3.2 and Tables 4–6] The non-Markovian transition matrix is approximated by Monte Carlo with N = 10,000 paths, but no convergence checks or variance estimates are provided. Many reported AUC differences are small (e.g., Table 4: 0.8915±0.0172 vs. 0.8743±0.0120), and Monte Carlo noise could be of the same order as the effect sizes. The authors should provide convergence diagnostics, e.g., multiple seeds or error bars on the transition probabilities, to show that the reported advantages are not simulation artifacts.
minor comments (6)
  1. [§2.3.1] Typo: 'δ(e)=∑_{v∈e} ω_e(v)' should read 'δ(e)=∑_{v∈e} γ_e(v)'.
  2. [§2.2, Table 2] The text says w(e) 'reflects the importance of a communication (here based on the number of entities involved)', but Table 2 defines w(e) as the number of distinct cities. Clarify whether w(e) is distinct nodes or multiset size; the notation is inconsistent.
  3. [Algorithm 1 and Figure 2] Figure 2's caption says 'In the step 2 of sampling fake hyperedges' for the hyperedge prediction task, but the task is to generate incomplete hyperedges, not fake ones. The caption should be corrected.
  4. [§2.5 Step 4] The sentence 'Ensure Algorithm 1 is defined.' is not a proper instruction; it should be removed or replaced with a reference to Algorithm 1.
  5. [References [1]–[3]] References [1]–[3] are listed with 'Author(s) not specified' and incomplete bibliographic information. These need full author names and details.
  6. [Throughout] Several language issues, e.g., 'In the other hand', 'threefolds', 'in addition of', should be corrected in a careful edit. Also 'the remaining hypergraph defined by E_T' is used without formally defining the induced hypergraph; define this operation.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the derivation is self-contained, with evaluation-protocol caveats that are not circular reductions.

full rationale

The central empirical claim—that an EDVW hypergraph paired with the non-Markovian Hyperwalk outperforms pairwise clique-graph walks on hyperedge prediction—does not reduce to its inputs by construction. The pipeline computes the similarity matrix on the training hyperedges E_T only (Section 2.5, Step 3: 'On the remaining hypergraph defined by E_T, compute the similarity matrix S with the different transition matrix of random walks'), so probe hyperedges are not used to construct the predictor. The Hyperwalk's restart probability is an explicit modeling choice (Section 2.3.2), not derived from the target labels. The GJS scoring method is taken from external prior work (Xu et al., [22]) and is not fitted to the test set. There are no load-bearing self-citations: the cited EDVW framework [12], non-linear consensus [13], and community-detection walk [21] are all external, and the paper does not invoke any self-authored uniqueness theorem. The 'per-fold maxima' reporting is a transparency caveat about hyperparameter selection on the test set, and Algorithm 1's Require line ('score list S_steps (built on E_T with E = E_T ∪ E_P, E_T ∩ E_P = ∅)') is ambiguous in isolation; however, the main-text Step 3 is unambiguous that S is built on E_T only, so there is no demonstrated reduction of the prediction to the target. These are correctness/evaluation-protocol concerns, not circular derivation steps.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

No new physical or conceptual entity is postulated. The new element is the hyperwalk algorithm, which is accounted for as a designed procedure with hand-set weights and restart probabilities rather than as an invented entity.

free parameters (4)
  • Edge-dependent vertex weights gamma_e(v) = 2 for sender, 1 for receiver
    Set by hand in Section 2.2.1; enters every transition probability, but is not derived from data or theory.
  • Hyperedge weights omega(e) = |e| (number of distinct missions)
    Chosen weight function in Section 2.2.1; equivalent to a size weighting with no stated justification.
  • Hyperwalk restart probability = 1 - (|e|-2)/|e|
    Introduced ad hoc in Section 2.3.2 to encode the larger-group-persists intuition; no derivation or calibration.
  • Random-walk length K and Monte Carlo path count N = N=10,000; K_max=50 to 500 depending on dataset
    Reported in Appendix 5.6; reported 'best' results appear to select K per fold, making it a tuned hyperparameter.
assumptions (4)
  • domain assumption Each cable is a multiway interaction among sender and all receivers
    Section 2.2.1 and Table 1 define each cable as one hyperedge; this is the load-bearing modeling premise.
  • standard math Reversibility of a Markov chain is necessary and sufficient for reducibility to an undirected graph walk
    Invoked via Lovasz in Section 2.3.4 to justify the non-equivalence checks.
  • domain assumption Monte Carlo estimates approximate the true non-Markovian transition probabilities closely enough for detailed-balance and AUC conclusions
    Section 2.3.2 uses N=10,000 paths; no convergence diagnostics are reported.
  • standard math Generalized Jensen-Shannon divergence with uniform weights is a valid higher-order similarity score
    Appendix 5.4 invokes the boundedness and permutation invariance of GJS; the score is then used for both detection and prediction.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Revealing Higher-Order Interactions in Complex Networks: A U.S. Diplomacy Case Study." pith.science (2026). https://pith.science/paper/PG2UWR2E

@misc{pith2026250910333,
  author       = {Pith},
  title        = {Pith review of: Revealing Higher-Order Interactions in Complex Networks: A U.S. Diplomacy Case Study},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PG2UWR2E}},
  note         = {Machine review of arXiv:2509.10333}
}
read the original abstract

Although diplomatic communication has long been examined in the social sciences, its network structure remains underexplored. Using the U.S. diplomatic cables released by WikiLeaks in 2010 as a case study, we adopt a network-science perspective. We represent diplomatic interactions as a hypergraph and develop a general, random-walk-based pipeline to evaluate this representation against traditional pairwise graphs. We further evaluate the pipeline on legislative co-sponsorship and organizational email data, finding improvements and empirical evidence that clarifies when hypergraph modeling is preferable to pairwise graphs. Overall, hypergraphs paired with appropriately specified random-walk dynamics more faithfully capture higher-order, group-based interactions, yielding a richer structural account of diplomacy and superior performance on interaction-prediction tasks that enables inferring new diplomatic relationships from existing patterns.

Figures

Figures reproduced from arXiv: 2509.10333 by the authors.

Figure 1
Figure 1. Overview of the fake hyperedge detection procedure. [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Overview of the hyperedge prediction procedure. [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Gap score (mean over folds) across steps for EDVW [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (13 more)
Figure 5
Figure 5. Figure 5: US Cables City dataset performances by size bin [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 4
Figure 4. Figure 4: Linear regression coefficients (𝑎) vs. number of intruders (𝑘) across hyperedges sizes and models on US Cables City dataset. and consulates level (city level) and for the senate-bills dataset. In figure 5 the overhaul ratio of corrects guessed nodes over the theoretica…
Figure 7
Figure 7. Figure 7: US Cables City dataset performances by size bin [PITH_FULL_IMAGE:figures/full_fig_p007_7.png]
Figure 8
Figure 8. Figure 8: Senate-Bills dataset performances by size bin for [PITH_FULL_IMAGE:figures/full_fig_p008_8.png]
Figure 10
Figure 10. Figure 10: US Cables Country dataset performances by size [PITH_FULL_IMAGE:figures/full_fig_p016_10.png]
Figure 11
Figure 11. Figure 11: US Cables Country dataset performances by size [PITH_FULL_IMAGE:figures/full_fig_p016_11.png]
Figure 9
Figure 9. Figure 9: US Cables Country dataset performances by size [PITH_FULL_IMAGE:figures/full_fig_p016_9.png]
Figure 12
Figure 12. Figure 12: Email-Enron dataset performances by size bin for [PITH_FULL_IMAGE:figures/full_fig_p016_12.png]
Figure 13
Figure 13. Figure 13: Email-Enron dataset performances by size bin for [PITH_FULL_IMAGE:figures/full_fig_p017_13.png]
Figure 14
Figure 14. Figure 14: Email-Enron dataset performances by size bin for [PITH_FULL_IMAGE:figures/full_fig_p017_14.png]
Figure 17
Figure 17. Figure 17: Email-EU dataset performances by size bin for [PITH_FULL_IMAGE:figures/full_fig_p017_17.png]
Figure 18
Figure 18. Figure 18: Senate-Bills dataset performances by size bin for [PITH_FULL_IMAGE:figures/full_fig_p018_18.png]
Figure 19
Figure 19. Figure 19: Senate-Bills dataset performances by size bin for [PITH_FULL_IMAGE:figures/full_fig_p018_19.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

38 extracted references · 10 canonical work pages

  1. [1]

    The idea of terror: Institu- tional reproduction in government responses to po- litical violence.International Studies Quarterly, 64 (3):499–509, 2020

    Author(s) not specified. The idea of terror: Institu- tional reproduction in government responses to po- litical violence.International Studies Quarterly, 64 (3):499–509, 2020. doi: 10.1093/isq/sqaa034. URL https://doi.org/10.1093/isq/sqaa034

    work page doi:10.1093/isq/sqaa034 2020

  2. [2]

    The struggle for minds and influence: The chinese communist party’s global out- reach.International Studies Quarterly, 64(3):723– 733, 2020

    Author(s) not specified. The struggle for minds and influence: The chinese communist party’s global out- reach.International Studies Quarterly, 64(3):723– 733, 2020. doi: 10.1093/isq/sqaa028. URL https: //doi.org/10.1093/isq/sqaa028

    work page doi:10.1093/isq/sqaa028 2020

  3. [3]

    Human rights versus national interests: Shiftinguspublicattitudesontheinternational criminal court.International Studies Quarterly, 63 (4):1065–1078, 2019

    Author(s) not specified. Human rights versus national interests: Shiftinguspublicattitudesontheinternational criminal court.International Studies Quarterly, 63 (4):1065–1078, 2019. doi: 10.1093/isq/sqz056. URL https://doi.org/10.1093/isq/sqz056

    work page doi:10.1093/isq/sqz056 2019

  4. [4]

    The Leak Heard Round the World? Ca- blegate in the Evolving Global Mediascape | Springer- Link, 2013

    Lisa Lynch. The Leak Heard Round the World? Ca- blegate in the Evolving Global Mediascape | Springer- Link, 2013. URL https://link.springer.com/ chapter/10.1057/9781137275745_4

    work page doi:10.1057/9781137275745_4 2013

  5. [5]

    Gabriel J. Michael. Who’s Afraid of WikiLeaks? Missed Opportunities in Political Science Re- search.Review of Policy Research, 32(2):175–199,

  6. [6]

    Networks be- yond pairwise interactions: Structure and dynam- ics.Physics Reports, 874:1–92, August 2020

    Federico Battiston, Giulia Cencetti, Iacopo Iacopini, Vito Latora, Maxime Lucas, Alice Patania, Jean- Gabriel Young, and Giovanni Petri. Networks be- yond pairwise interactions: Structure and dynam- ics.Physics Reports, 874:1–92, August 2020. ISSN 0370-1573. doi: 10.1016/j.physrep.2020.05.004. URL https://www.sciencedirect.com/science/ article/pii/S037015...

    doi:10.1016/j.physrep.2020.05.004 2020

  7. [7]

    Murray, Tiago P

    Federico Battiston, Enrico Amico, Alain Barrat, Gines- tra Bianconi, Guilherme Ferraz de Arruda, Benedetta Franceschiello, Iacopo Iacopini, Sonia Kéfi, Vito La- tora, Yamir Moreno, Micah M. Murray, Tiago P. Peixoto, Francesco Vaccarino, and Giovanni Petri. The physics of higher-order interactions in com- plex systems.Nature Physics, 17(10):1093–1098, Octo...

    2021

  8. [8]

    A hypergraph model for representing scientific output.Scientometrics, 117(3):1361–1379, December 2018

    Rodica Ioana Lung, Noémi Gaskó, and Mihai Alexan- dru Suciu. A hypergraph model for representing scientific output.Scientometrics, 117(3):1361–1379, December 2018. ISSN 1588-2861. doi: 10.1007/ s11192-018-2908-2. URL https://doi.org/10. 1007/s11192-018-2908-2

    2018

Show all 38 references
  1. [9]

    The shape of collaborations.EPJ Data Science, 6(1):1–16, December 2017

    Alice Patania, Giovanni Petri, and Francesco Vac- carino. The shape of collaborations.EPJ Data Science, 6(1):1–16, December 2017. ISSN 2193-

    2017

  2. [10]

    Golubski, Erik E

    Antonio J. Golubski, Erik E. Westlund, John Vander- meer, and Mercedes Pascual. Ecological Networks 8 over the Edge: Hypergraph Trait-Mediated Indirect Interaction (TMII) Structure.Trends in Ecology & Evolution, 31(5):344–354, May 2016. ISSN 0169-

    2016

  3. [11]

    Courtney and Ginestra Bianconi

    Owen T. Courtney and Ginestra Bianconi. Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes.Physical Review E, 93(6):062311, June 2016. doi: 10.1103/ PhysRevE.93.062311. URLhttps://link.aps.org/ doi/10.1103/PhysRevE.93.062...

    2016 doi

  4. [12]

    Random Walks on Hypergraphs with Edge-Dependent Vertex Weights

    Uthsav Chitra and Benjamin Raphael. Random Walks on Hypergraphs with Edge-Dependent Vertex Weights. InProceedings of the 36th International Conference on Machine Learning, pages 1172–1181. PMLR, May

  5. [13]

    Multi-body Interactions and Non-Linear Con- sensus Dynamics on Networked Systems, October

    Leonie Neuhäuser, Andrew Mellor, and Renaud Lam- biotte. Multi-body Interactions and Non-Linear Con- sensus Dynamics on Networked Systems, October

  6. [14]

    Weiqi Chu and Mason A. Porter. A Density Description of a Bounded-Confidence Model of Opinion Dynamics on Hypergraphs.SIAM Journal on Applied Mathemat- ics, 83(6):2310–2328, December 2023. ISSN 0036-

    2023

  7. [15]

    A bounded- confidence model of opinion dynamics on hypergraphs

    Abigail Hickok, Yacoub Kureh, Heather Z Brooks, Michelle Feng, and Mason A Porter. A bounded- confidence model of opinion dynamics on hypergraphs. SIAM Journal on Applied Dynamical Systems, 21(1): 1–32, 2022

    2022

  8. [16]

    Dynamics of the threshold model on hypergraphs.Chaos: An Interdisciplinary Journal of Nonlinear Science, 32(2): 023125, February 2022

    Xin-Jian Xu, Shuang He, and Li-Jie Zhang. Dynamics of the threshold model on hypergraphs.Chaos: An Interdisciplinary Journal of Nonlinear Science, 32(2): 023125, February 2022. ISSN 1054-1500, 1089-7682. doi: 10.1063/5.0075667. URL http://arxiv.org/ abs/2202.13029. arXiv:2202....

    2022 arXiv

  9. [17]

    Social contagion models on hyper- graphs, September 2019

    Guilherme Ferraz de Arruda, Giovanni Petri, and Yamir Moreno. Social contagion models on hyper- graphs, September 2019. URLhttp://arxiv.org/ abs/1909.11154. arXiv:1909.11154

    2019 arXiv

  10. [18]

    arXiv:1910.09226

    URL http://arxiv.org/abs/1910.09226. arXiv:1910.09226

    1910 arXiv

  11. [19]

    Multiorder Laplacian for synchronization in higher-order networks.Physical Review Research, 2(3):033410, September 2020

    Maxime Lucas, Giulia Cencetti, and Federico Bat- tiston. Multiorder Laplacian for synchronization in higher-order networks.Physical Review Research, 2(3):033410, September 2020. ISSN 2643-1564. doi: 10.1103/PhysRevResearch.2.033410. URLhttp: //arxiv.org/abs/2003.09734. arXiv:2...

    2020 arXiv

  12. [20]

    Randomwalksonhypergraphs.Physical Review E, 101(2):022308, February 2020

    TimoteoCarletti,FedericoBattiston,GiuliaCencetti,and DuccioFanelli. Randomwalksonhypergraphs.Physical Review E, 101(2):022308, February 2020. doi: 10.1103/ PhysRevE.101.022308. URL https://link.aps. org/doi/10.1103/PhysRevE.101.022308. Pub- lisher: American Physical Society

    2020 doi

  13. [21]

    Random walks and community detection in hypergraphs.Journal of Physics: Complexity, 2 (1):015011, April 2021

    Timoteo Carletti, Duccio Fanelli, and Renaud Lam- biotte. Random walks and community detection in hypergraphs.Journal of Physics: Complexity, 2 (1):015011, April 2021. ISSN 2632-072X. doi: 10.1088/2632-072X/abe27e. URL https://dx.doi. org/10.1088/2632-072X/abe27e. Publisher: I...

    2021 doi

  14. [22]

    Hyperlink prediction via local random walks and Jensen–Shannon divergence.Journal of Statistical Mechanics: The- ory and Experiment, 2023(3):033402, March 2023

    Xin-Jian Xu, Chong Deng, and Li-Jie Zhang. Hyperlink prediction via local random walks and Jensen–Shannon divergence.Journal of Statistical Mechanics: The- ory and Experiment, 2023(3):033402, March 2023. ISSN 1742-5468. doi: 10.1088/1742-5468/acc31e. URL https://dx.doi.org/10....

    2023 doi

  15. [23]

    How choos- ing random-walk model and network representa- tion matters for flow-based community detection in hypergraphs.Communications Physics, 4(1):1– 12, June 2021

    Anton Eriksson, Daniel Edler, Alexis Rojas, Man- lio de Domenico, and Martin Rosvall. How choos- ing random-walk model and network representa- tion matters for flow-based community detection in hypergraphs.Communications Physics, 4(1):1– 12, June 2021. ISSN 2399-3650. doi: 10....

    2021

  16. [24]

    Contagion dynamics on higher-order networks, February 2024

    Guilherme Ferraz de Arruda, Alberto Aleta, and Yamir Moreno. Contagion dynamics on higher-order networks, February 2024. URLhttp://arxiv.org/abs/2402. 14938. arXiv:2402.14938

    2024 arXiv

  17. [25]

    Localhigher-ordergraphclustering

    Hao Yin, Austin R Benson, Jure Leskovec, and David F Gleich. Localhigher-ordergraphclustering. InProceed- ingsofthe23rdACMSIGKDDInternationalConference on Knowledge Discovery and Data Mining. ACM, 2017

    2017

  18. [26]

    Benson, Rediet Abebe, Michael T

    Austin R. Benson, Rediet Abebe, Michael T. Schaub, Ali Jadbabaie, and Jon Kleinberg. Simplicial closure and higher-order link prediction.Proceedings of the National Academy of Sciences, 2018. ISSN 0027-8424. doi: 10.1073/pnas.1800683115

    2018 doi

  19. [27]

    James H. Fowler. Connecting the congress: A study of cosponsorship networks.Political Analysis, 14(04): 456–487,2006. doi: 10.1093/pan/mpl002. URLhttps: //doi.org/10.1093/pan/mpl002

    2006 doi

  20. [28]

    James H. Fowler. Legislative cosponsorship networks in the US house and senate.Social Networks, 28(4): 454–465, oct 2006. doi: 10.1016/j.socnet.2005.11.003. 9 URL https://doi.org/10.1016/j.socnet.2005. 11.003

    2006 doi

  21. [29]

    LászlóLovász.Randomwalksongraphs.Combinatorics, Paul erdos is eighty, 2(1-46):4, 1993

    1993

  22. [30]

    Executive Office of the President

    U.S. Executive Office of the President. Exec- utive order 13526: Classified national secu- rity information. https://obamawhitehouse. archives.gov/the-press-office/ executive-order-classified-national-security-information ,

  23. [37]

    WeipingLiuandLinyuanLü.Linkpredictionbasedonlo- cal random walk.Europhysics Letters, 89:58007, March

  24. [1127]

    URL https://epjdatascience.springeropen.com/ articles/10.1140/epjds/s13688-017-0114-8

    doi: 10.1140/epjds/s13688-017-0114-8. URL https://epjdatascience.springeropen.com/ articles/10.1140/epjds/s13688-017-0114-8. Number: 1 Publisher: SpringerOpen

    doi

  25. [1399]

    URL https:// epubs.siam.org/doi/10.1137/22M148608X

    doi: 10.1137/22M148608X. URL https:// epubs.siam.org/doi/10.1137/22M148608X. Pub- lisher: Society for Industrial and Applied Mathematics

    doi

  26. [2009]

    Issued December 29, 2009

    2009

  27. [2010]

    URLhttps: //folia.unifr.ch/global/documents/301689

    doi: 10.1209/0295-5075/89/58007. URLhttps: //folia.unifr.ch/global/documents/301689. 10 5 Materials & Methods Appendix 5.1 Cleaning and Validating the CableGate Dataset The objective here is to clean and validate the CableGate dataset, ensuring that it is ready for analysis. T...

    doi

  28. [2015]

    doi: 10.1111/ropr.12120

    ISSN 1541-1338. doi: 10.1111/ropr.12120. URL https://onlinelibrary.wiley.com/ doi/abs/10.1111/ropr.12120. _eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1111/ropr.12120

    doi

  29. [2019]

    ISSN: 2640-3498

    URL https://proceedings.mlr.press/ v97/chitra19a.html. ISSN: 2640-3498

  30. [5347]

    URL https: //www.cell.com/trends/ecology-evolution/ abstract/S0169-5347(16)00051-3

    doi: 10.1016/j.tree.2016.02.006. URL https: //www.cell.com/trends/ecology-evolution/ abstract/S0169-5347(16)00051-3. Publisher: Elsevier

    2016 doi

Pith tools

Reviewed August 4, 2026 · model on record in the stance chip above.