Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 224

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian

Open access
Schaub, Michael T., Benson, Austin R., Horn, Paul, Lippner, Gabor, Jadbabaie, Ali·2020·SIAM Review

Abstract

Using graphs to model pairwise relationships between entities is a ubiquitous framework for studying complex systems and data. Simplicial complexes extend this dyadic model of graphs to polyadic relationships and have emerged as a model for multinode relationships occurring in many complex systems. For instance, biological interactions occur between sets of molecules and communication systems include group messages that are not pairwise interactions. While Laplacian dynamics have been intensely studied for graphs, corresponding notions of Laplacian dynamics beyond the node-space have so far remained largely unexplored for simplicial complexes. In particular, diffusion processes such as random walks and their relationship to the graph Laplacian---which underpin many methods of network analysis, including centrality measures, community detection, and contagion models---lack a proper correspondence for general simplicial complexes. Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for the Hodge Laplacian---the generalization of the graph Laplacian for simplicial complexes---and relate this to a random walk on edges. Importantly, these random walks are intimately connected to the topology of the simplicial complex, just as random walks on graphs are related to the topology of the graph. This serves as a foundational step toward incorporating Laplacian-based analytics for higher-order interactions. We demonstrate how to use these dynamics for data analytics that extract information about the edge-space of a simplicial complex that complements and extends graph-based analysis. Specifically, we use our normalized Hodge Laplacian to derive spectral embeddings for examining trajectory data of ocean drifters near Madagascar and also develop a generalization of personalized PageRank for the edge-space of simplicial complexes to analyze a book copurchasing dataset.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/18m1201019

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 12 references

Cited by

See all 224

Metadata

Authors
Schaub, M. T., Benson, A. R., Horn, P., Lippner, G., & Jadbabaie, A.
Venue
SIAM Review
Published
2020-01
Volume
62
Issue
2
Pages
353-391
ISSN
  • 0036-1445 (ISSN-L)
  • 1095-7200
OpenAlex
W2883165869
Cited by
224
References
12
FWCI
12.39
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian. https://app.cochat.ai/papers/10.1137/18m1201019
The paper
Schaub, M. T., Benson, A. R., Horn, P., Lippner, G., & Jadbabaie, A. (2020). Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian. SIAM Review. https://doi.org/10.1137/18m1201019

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.