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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062 · cited 1×
“Centrality measures, initially conceptualized to quantify the social power of individuals within social networks [21,24,50,51,74], are an important network analysis tool.”
BackgroundModularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302 · cited 1×
“m walks on graphs and the graph Laplacian to develop a random walk on simplicial complexes that relates to the Hodge Laplacian. Furthermore, the connection of simplicial complexes to applied topology [21,35] has already led to success in analyzing biological data [23,55], structural and functional connectivity in the…”
BackgroundBarcodes: the persistent topology of data
Ghrist, R. (2007) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-07-01191-3 · Cited by 1,236 · cited 1×
“m walks on graphs and the graph Laplacian to develop a random walk on simplicial complexes that relates to the Hodge Laplacian. Furthermore, the connection of simplicial complexes to applied topology [21,35] has already led to success in analyzing biological data [23,55], structural and functional connectivity in the…”
BackgroundDynamics and Control of Diseases in Networks with Community Structure
Salathé, M., & Jones, J. H. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000736 · Cited by 586
Bianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539
Coverage in sensor networks via persistent homology
de Silva, V., & Ghrist, R. (2007) · Algebraic & Geometric Topology · doi:10.2140/agt.2007.7.339 · Cited by 422
Chan, J. M., Carlsson, G., & Rabadan, R. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1313480110 · Cited by 269
Cited by
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
The physics of higher-order interactions in complex systems
Battiston, F., Amico, E., Barrat, A., Bianconi, G., Ferraz de Arruda, G., Franceschiello, B., Iacopini, I., Kéfi, S., Latora, V., Moreno, Y., et al. (2021) · Nature Physics · doi:10.1038/s41567-021-01371-4 · Cited by 932
Dynamics on higher-order networks: a review
Majhi, S., Perc, M., & Ghosh, D. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0043 · Cited by 561
What are higher-order networks?
Bick, C., Gross, E., Harrington, H. A., & Schaub, M. T. (2023) · SIAM Review · doi:10.1137/21m1414024 · Cited by 420
Self-citationThe structure and dynamics of networks with higher order interactions
Boccaletti, S., De Lellis, P., del Genio, C. I., Alfaro-Bittner, K., Criado, R., Jalan, S., & Romance, M. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.04.002 · Cited by 364
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.