Pith. sign in

REVIEW 2 major objections 4 minor 159 references

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey

T0 review · 2 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read A survey of core finding in higher graphs argues that a core is a minimalist representation preserving geometric or topological information, and that discrete curvature, effective resistance, and persistent homology are complementary…

desk verdict A transparent and useful survey of core-finding methods for higher graphs; the taxonomy is broad and sometimes fuzzy, but it earns a careful referee. read the letter →

arxiv 2506.19857 v1 pith:EOMG2WEV submitted 2025-06-09 math.HO cs.CGcs.DMmath.CO

Inés García-Redondo , Claudia Landi , Sarah Percival , Anda Skeja , Bei Wang , Ling Zhou This is my paper
classification math.HOcs.CGcs.DMmath.CO MSC 05C8255N31
keywords corefindinghighergraphsdiscretecurvatureeffectiveresistancepersistenthomologyhypergraphssimplicialcomplexesgraphsparsification
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 survey organizes recent work on a shared problem: finding the core of a higher graph, meaning a graph, hypergraph, or simplicial complex. Its thesis is that a core is a minimalist representation that retains the object's geometric or topological information, and that three families of tools—discrete curvatures, effective resistance, and persistent homology—offer different and complementary ways to build such cores. The paper's contribution is a classification: for each type of higher graph, it records which methods preserve which structures, such as backbones, communities, spectral properties, or persistent homology. A sympathetic reader comes away with a map of where the methods are mature, where they are missing, and where theoretical guarantees are still absent.

What carries the argument

The organizing object is the core itself, defined as a minimalist representation of a higher graph that retains its geometric or topological information; the paper treats this definition as broader than the classical $k$-core and as covering backbones, sparse filtrations, and spectral sparsifiers alike. The survey's machinery is a cross-classification by higher-graph type and by tool family, with summary tables stating, for each method, the criterion it uses and the property it preserves. Load-bearing identities include the Forman-Ricci edge formula $F(e)=4-\deg(u)-\deg(v)$; the Ollivier-Ricci curvature $\kappa(x,y)=1-W_1(m_x,m_y)/d(x,y)$, where $W_1$ is the Wasserstein distance; the effective resistance of an edge $r_e=(BL^+B^\top)_{ee}$ through the graph Laplacian pseudoinverse; and the multiplicative interleaving bound that lets a linear-size sparse Vietoris–Rips filtration approximate the full persistence diagram.

What would settle it

If one could exhibit a single higher graph for which two of the surveyed methods select provably disjoint cores—for example, a graph whose curvature-based backbone and effective-resistance spectral sparsifier share no edges—then the survey's unifying frame would be only a classification, not a theory of cores.

Watch

Extended reading notes

Core claim

The paper's central claim is that core finding is a unified problem across graphs, hypergraphs, and simplicial complexes, and that geometric and topological tools provide complementary criteria for solving it. For graphs, the surveyed methods are curvature-based thresholding to preserve backbones and communities, effective-resistance sampling to preserve Laplacian spectra, and Ricci-flow-type clustering; for hypergraphs, they are percolation processes such as the $(k,q)$-core, spectral sparsification of hypergraph Laplacians, and a small set of curvature- or resistance-based methods; for simplicial complexes, they are sparse filtrations that approximate persistent homology, effective-resistance subsampling that preserves up-Laplacians, and harmonic clustering. The survey also identifies imbalances: curvature-based cores for hypergraphs and simplicial complexes are underdeveloped, percolation on simplicial complexes does not yet yield well-defined cores, and no method yet preserves homological and spectral properties simultaneously.

Load-bearing premise

The survey's map of the literature rests on an informal boundary around what counts as core finding, since spectral graph clustering, network percolation, and graph condensation are excluded by preference and history rather than by a formal criterion.

Editorial extensions

If this is right

  • In graphs, curvature-based thresholding is a practical way to preserve backbone and community structure, and augmented or lower-curvature variants address the biases of the plain Forman-Ricci curvature.
  • Effective-resistance sampling gives spectral guarantees for graph cores, and the same sampling logic extends to hypergraph Laplacians and to the $p$-skeleton up-Laplacians of simplicial complexes.
  • Sparse filtrations based on relaxed distances, batch collapses, or well-separated simplicial decompositions approximate persistent homology with proven interleaving bounds, so homology cores can be computed at near-linear size.
  • Hypergraph percolation and the $(k,q)$-core provide phase-transition descriptions of when cores form and disintegrate, with hybrid transitions for $k\geq 3$ or $q\geq 3$.
  • The survey's tables expose concrete gaps: curvature-based hypergraph cores with guarantees, percolation-based simplicial cores, and sparsifications preserving both homology and spectra all remain open.

Reading between the lines

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

  • Because the paper's own definition of a core is informal, its exclusion of spectral graph clustering, network percolation, and graph condensation is a historical boundary rather than a logical one; a reader could legitimately extend the map to those areas.
  • Resistance curvature sits at the intersection of two tool families: it is a curvature defined through effective resistance, so sampling by resistance curvature may yield cores that preserve spectral and community properties at once, a possibility the paper leaves implicit.
  • A natural testable extension is to treat the dynamic Ollivier-Ricci curvature's gap structure as a scale parameter for core selection, analogous to the filtration parameter in persistent homology.
  • For hypergraphs, the absence of a canonical Laplacian means the notion of a spectral core depends on the chosen Laplacian; comparing cores across Laplacian choices would be a concrete research program.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 4 minor

Summary. The paper surveys methods for extracting "cores" of graphs, hypergraphs, and simplicial complexes using discrete curvatures (Forman–Ricci, Ollivier–Ricci, resistance), effective resistance, and persistent homology. It defines a core informally as a minimalist representation retaining geometric or topological information, provides background definitions in Sections 2, 4.1, and 5.1–5.2, and classifies recent work in three tables (Tables 1–3). The survey's central claim is that these geometric and topological tools give complementary simplification methods across higher graphs, and that there are identifiable research gaps such as the lack of theoretical guarantees for curvature-based graph sampling and the absence of a canonical hypergraph effective resistance. The paper is explicitly a survey and proves no new theorems.

Significance. If read as a descriptive map of a dispersed literature, the survey is genuinely useful. It collects recent work in one place, reproduces key definitions (Forman–Ricci curvature, Ollivier–Ricci curvature, effective resistance, sparse filtrations) in a mostly faithful manner, and the three summary tables give a quick orientation to the field. The authors are also commendably transparent about missing theory: Section 6 repeatedly flags the scarcity of guarantees for curvature-based sampling, and Section 5.6 explicitly states that the harmonic clustering algorithm has no theoretical guarantees. The main strengths are breadth, clear organization, and honest caveats. The main weakness is that the survey's classification boundary is informal, so the claimed map of core-finding methods is not yet fully operational.

major comments (2)
  1. [§1, §3.1.3, §4.4, §5.6] The paper's organizing definition of a core as "a minimalist representation" (Section 1) is not consistently aligned with the methods included in the survey. Community detection (§3.1.3, refs. [76,51,141,107]), normalized-cut spectral clustering of hypergraphs (§4.4, refs. [156,150]), harmonic clustering of simplicial complexes (§5.6, ref. [43]), and the hypergraph percolation rows in Table 2 (refs. [136,86,17]) do not output a reduced graph, hypergraph, or complex; they output partitions, cluster assignments, or threshold/phase-transition information. Conversely, graph condensation and network percolation are excluded from Section 1 largely by preference and history. This makes the claimed classification not fully operational. I recommend that the authors either broaden the formal definition of core to specify admissible output types, or explicitly mark in Tables 1–3 which rows are core-finding in the output-reduction sense and which are neighboring clustering/percolation methods. The acknowledgment of bias in Section 1 is helpful, but it does not by itself make the classification criterion precise.
  2. [Tables 1–3] The "Property Preserved" column conflates three very different kinds of claims: rigorous guarantees (e.g., Table 1, ref. [130], "spectral"; Table 2, refs. [129,73,85,68], "spectral"; Table 3, refs. [125,39,75], "PD"), experimentally observed behavior (e.g., Table 1, ref. [60], "multiscale clusters"; Table 3, ref. [43], "homology generators (experimentally)"), and structural outputs that are not preservation claims at all (e.g., Table 2, refs. [136,86,17], "robustness" for percolation). Because the tables are the survey's main classification device, this conflation makes it hard for the reader to see which methods have provable guarantees. I suggest adding a legend or a separate column distinguishing "proven", "empirical", and "output type (reduction/partition/threshold)", and adjusting the text to state explicitly that the tables encode the authors' reading of each cited paper's claims rather than a uniform standard of preservation.
minor comments (4)
  1. [§5.3] In the description of the SimBa method, the set distance is written as d(A,B)=min_{a∈B,b∈B} d(a,b); the first minimum should be over a∈A.
  2. [§2.2, Proposition 1] The bound |κ(e)−κ(e′)|≤min{3,3(l/n,l′/m)} is not well-formed: the second argument of min is a pair, not a number. Please replace 3(l/n,l′/m) with an explicit expression such as 3 max(l/n,l′/m), or quote the intended formula from [47].
  3. [§5.3, Dey et al.] The statement that the sparsified filtration is "a (3 log(1+ε)/2)-approximation" is too terse: for 0<ε≤1 this factor can be less than 1, and it is unclear whether the approximation is multiplicative in the interleaving distance or in the persistence-diagram factor defined in §5.2. Please state the precise theorem with its parameter range.
  4. [§2.3, Eqs. (21)–(22)] The two displayed formulas for k_up differ by a normalization, but the text says only that they are "equal up to a factor of ⟨1,Ω^{-1}1⟩". Please state explicitly which definition is used in the subsequent comparison κ(e)≥k_down(e)≥F(e)/ω_e.

Circularity Check

0 steps flagged · score 1.0 of 10

No load-bearing circularity: the survey makes no predictions, fits no parameters, and its self-citations are incidental pointers rather than premises.

full rationale

This is a survey, not a derivation. It fits no parameters, generates no predictions, and proves no new theorems; its organizing notion of a 'core' is explicitly informal and stipulative ('Informally, the core of a higher graph is a minimalist representation that retains its geometric or topological information'), so classifying methods as core-finding is a literature-taxonomy judgment rather than a mathematical consequence forced by the definition. The only self-citations are [57] and [105] (Osting, Palande, and Wang); both appear as surveyed results or future-work pointers, and no conclusion of this paper depends on those results being true in a way that loops back into the survey's claims. The survey explicitly flags its own boundary as 'admittedly, partially reflect our own biases in constructing this survey' (Section 1) and repeatedly notes missing support, e.g. 'An aspect common to many methods using discrete curvatures to find graph cores through sampling is the lack of theoretical guarantees' (Section 6.1) and 'there are no theoretical guarantees for the above algorithm' (Section 5.6). These admitted limitations undercut rather than create circularity: they show that the claims are contingent reports about the literature, not conclusions forced by hidden assumptions. No equation in the paper reduces to an input by construction, and no fitted parameter is relabeled as a prediction.

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

The survey introduces no new free parameters or entities. Its content is a synthesis of standard mathematics and domain-specific modeling assumptions from the cited literature.

assumptions (5)
  • standard math Persistence modules over R are interval-decomposable (Structure Theorem).
    Section 5.2 relies on this to define persistence diagrams and barcodes.
  • standard math Effective resistance defined via the Moore-Penrose pseudoinverse of a graph Laplacian yields spectral sparsification guarantees.
    Sections 3.3 and 5.5 use the Spielman-Srivastava and Osting et al. theorems.
  • standard math Ollivier-Ricci curvature lower bounds control the Laplacian spectrum via the Bauer-Jost-Liu inequality.
    Equation (15) in Section 2.2 is invoked to motivate community detection.
  • domain assumption The (k,q)-core percolation analysis assumes locally tree-like random hypergraphs.
    Section 4.2, following Lee et al., relies on a tree-like assumption, and the survey explicitly notes this as a limitation.
  • domain assumption Hypergraph Laplacians need not be unique; the survey accepts each cited paper's Laplacian as given.
    Sections 4.1, 4.3, and 6.2 discuss multiple Laplacian notions without adjudicating a canonical one.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey." pith.science (2026). https://pith.science/paper/EOMG2WEV

@misc{pith2026250619857,
  author       = {Pith},
  title        = {Pith review of: Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EOMG2WEV}},
  note         = {Machine review of arXiv:2506.19857}
}
read the original abstract

In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion of a core, which is a minimalist representation of a higher graph that retains its geometric or topological information. We focus on geometric and topological methods based on discrete curvatures, effective resistance, and persistent homology. We aim to connect tools from graph theory, discrete geometry, and computational topology to inspire new research on the simplification of higher graphs.

Figures

Figures reproduced from arXiv: 2506.19857 by the authors.

Figure 1
Figure 1. An illustration of Ricci curvatures for surfaces (top) and Ollivier-Ricci curva [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗
Figure 2
Figure 2. Forman-Ricci curvature vs. augmented Forman-Ricci curvature. Left: Forman [PITH_FULL_IMAGE:figures/full_fig_p021_2.png] view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

159 extracted references · 74 canonical work pages

  1. [43]

    A notion of harmonic clustering in simplicial complexes

    Stefania Ebli and Gard Spreemann. A notion of harmonic clustering in simplicial complexes. In2019 18th IEEE International Conference On Machine Learning And Applications, pages 1083–1090, December 2019

    2019

  2. [130]

    Spielman and Nikhil Srivastava

    Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by effective resistances.SIAM Journal on Computing, 40(6):1913–1926, 2011

    work page 1913

  3. [60]

    Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature.Nature Communications, 12(1):4561, 2021

    Adam Gosztolai and Alexis Arnaudon. Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature.Nature Communications, 12(1):4561, 2021

    2021

  4. [1]

    Higher order learning with graphs

    Sameer Agarwal, Kristin Branson, and Serge Belongie. Higher order learning with graphs. In Proceedings of the 23rd International Conference on Machine Learning, pages 17–24. ACM Press, 2006

    2006

  5. [2]

    HyperEF: Spectral hypergraph coarsening by effective-resistance clustering

    Ali Aghdaei and Zhuo Feng. HyperEF: Spectral hypergraph coarsening by effective-resistance clustering. InProceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, pages 1–9, San Diego California, October 2022. ACM

    2022

  6. [3]

    Visualisation and analysis of the Internet Movie Database

    Adel Ahmed, Vladimir Batagelj, Xiaoyan Fu, Seok-Hee Hong, Damian Merrick, and Andrej Mrvar. Visualisation and analysis of the Internet Movie Database. In2007 6th International Asia-Pacific Symposium on Visualization, pages 17–24. IEEE, 2007

    2007

  7. [4]

    Hypergraph Laplacians in diffusion framework

    Mehmet Emin Aktas and Esra Akbas. Hypergraph Laplacians in diffusion framework. In Rosa Maria Benito, Chantal Cherifi, Hocine Cherifi, Esteban Moro, Luis M. Rocha, and Marta Sales-Pardo, editors,Complex Networks & Their Applications X, pages 277–288, Cham, 2022. Springer International Publishing

    2022

  8. [5]

    Alsing, Jonathan R

    Paul M. Alsing, Jonathan R. McDonald, and Warner A. Miller. The simplicial Ricci tensor. Classical and Quantum Gravity, 28(15):155007, 2011

    2011

Show all 159 references
  1. [6]

    Curvature of hypergraphs via multi-marginal optimal transport

    Shahab Asoodeh, Tingran Gao, and James Evans. Curvature of hypergraphs via multi-marginal optimal transport. In2018 IEEE Conference on Decision and Control, pages 1180–1185. IEEE, 2018

    2018

  2. [7]

    On the sum of Ricci-curvatures for weighted graphs.Pure and Applied Mathematics Quarterly, 2020

    Shuliang Bai, An Huang, Linyuan Lu, and Shing-Tung Yau. On the sum of Ricci-curvatures for weighted graphs.Pure and Applied Mathematics Quarterly, 2020

    2020

  3. [8]

    On the spectrum of hypergraphs.Linear Algebra and its Applications, 614:82–110, April 2021

    Anirban Banerjee. On the spectrum of hypergraphs.Linear Algebra and its Applications, 614:82–110, April 2021

    2021

  4. [9]

    New notions and constructions of sparsifica- tion for graphs and hypergraphs

    Nikhil Bansal, Ola Svensson, and Luca Trevisan. New notions and constructions of sparsifica- tion for graphs and hypergraphs. In2019 IEEE 60th Annual Symposium on Foundations of Computer Science, pages 910–928. IEEE, 2019

    2019

  5. [10]

    Geometric sampling of networks.Journal of Complex Networks, 10(4):cnac014, August 2022

    Vladislav Barkanass, J¨ urgen Jost, and Emil Saucan. Geometric sampling of networks.Journal of Complex Networks, 10(4):cnac014, August 2022

    2022

  6. [11]

    Spielman, and Nikhil Srivastava

    Joshua Batson, Daniel A. Spielman, and Nikhil Srivastava. Twice-Ramanujan sparsifiers. SIAM Journal on Computing, 41(6):1704–1721, 2012

    2012

  7. [12]

    Ollivier–Ricci curvature and the spectrum of the normalized graph Laplace operator.Mathematical Research Letters, 19(6):1185–1205, 2012

    Frank Bauer, J¨ urgen Jost, and Shiping Liu. Ollivier–Ricci curvature and the spectrum of the normalized graph Laplace operator.Mathematical Research Letters, 19(6):1185–1205, 2012

    2012

  8. [13]

    The Morse theory of ˇCech and Delaunay complexes

    Ulrich Bauer and Herbert Edelsbrunner. The Morse theory of ˇCech and Delaunay complexes. Transactions of the American Mathematical Society, 369(5):3741–3762, 2017

    2017

  9. [14]

    Bencz´ ur and David R

    Andr´as A. Bencz´ ur and David R. Karger. Approximatings−t minimum cuts in ˜O(n2) time. InProceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 47–55, 1996

    1996

  10. [15]

    Benson, David F

    Austin R. Benson, David F. Gleich, and Jure Leskovec. Higher-order organization of complex networks.Science, 353(6295):163–166, 2016. 48 Garc ´ıa-Redondo et al

    2016

  11. [16]

    Nature of hypergraph k-core percolation problems.Physical Review E, 109(1):014307, 2024

    Ginestra Bianconi and Sergey N Dorogovtsev. Nature of hypergraph k-core percolation problems.Physical Review E, 109(1):014307, 2024

    2024

  12. [17]

    Theory of percolation on hypergraphs.Physical Review E, 109(1):014306, 2024

    Ginestra Bianconi and Sergey N Dorogovtsev. Theory of percolation on hypergraphs.Physical Review E, 109(1):014306, 2024

    2024

  13. [18]

    On the stability of interval decomposable persistence modules

    H˚avard Bakke Bjerkevik. On the stability of interval decomposable persistence modules. Discrete & Computational Geometry, 66(1):92–121, 2021

    2021

  14. [19]

    Fast unfolding of communities in large networks.Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, oct 2008

    Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. Fast unfolding of communities in large networks.Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, oct 2008

    2008

  15. [20]

    Homological percolation and the Euler characteristic

    Omer Bobrowski and Primoz Skraba. Homological percolation and the Euler characteristic. Physical Review E, 101(3), 2020

    2020

  16. [21]

    Mass transportation and rough curvature bounds for discrete spaces.Journal of Functional Analysis, 256(9):2944–2966, 2009

    Anca-Iuliana Bonciocat and Karl-Theodor Sturm. Mass transportation and rough curvature bounds for discrete spaces.Journal of Functional Analysis, 256(9):2944–2966, 2009

    2009

  17. [22]

    Decomposition of persistence modules

    Magnus Botnan and William Crawley-Boevey. Decomposition of persistence modules. Proceedings of the American Mathematical Society, 148(11):4581–4596, August 2020

    2020

  18. [23]

    Dey, and Yusu Wang

    Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, and Yusu Wang. Annotating simplices with a homology basis and its applications. In Fedor V. Fomin and Petteri Kaski, editors,Algorithm Theory – SWAT 2012, pages 189–200, Berlin, Heidelberg, 2012. Springer

    2012

  19. [24]

    Approximating persistent homology for large datasets

    Yueqi Cao and Anthea Monod. Approximating persistent homology for large datasets. arXiv preprint arXiv:2204.09155, May 2022

    2022

  20. [25]

    Cavanna, Mahmoodreza Jahanseir, and Donald R

    Nicholas J. Cavanna, Mahmoodreza Jahanseir, and Donald R. Sheehy. A geometric perspective on sparse filtrations.Proceedings of the Canadian Conference on Computational Geometry, 2015

    2015

  21. [26]

    Spectral properties of hypergraph Laplacian and approximation algorithms.Journal of the ACM, 65(3):1–48, 2018

    T-H Hubert Chan, Anand Louis, Zhihao Gavin Tang, and Chenzi Zhang. Spectral properties of hypergraph Laplacian and approximation algorithms.Journal of the ACM, 65(3):1–48, 2018

    2018

  22. [27]

    Minimum cuts and sparsification in hypergraphs.SIAM Journal on Computing, 47(6):2118–2156, 2018

    Chandra Chekuri and Chao Xu. Minimum cuts and sparsification in hypergraphs.SIAM Journal on Computing, 47(6):2118–2156, 2018

    2018

  23. [28]

    FastGCN: Fast learning with graph convolutional networks via importance sampling

    Jie Chen, Tengfei Ma, and Cao Xiao. FastGCN: Fast learning with graph convolutional networks via importance sampling. InInternational Conference on Learning Representations, 2018

    2018

  24. [29]

    Graph coarsening: from scientific computing to machine learning.SeMA Journal

    Jie Chen, Yousef Saad, and Zechen Zhang. Graph coarsening: from scientific computing to machine learning.SeMA Journal. Boletin de la Sociedad Espa ˜nola de Matem´atica Aplicada, 79(1):187–223, 2022

    2022

  25. [30]

    Near-linear size hypergraph cut sparsifiers

    Yu Chen, Sanjeev Khanna, and Ansh Nagda. Near-linear size hypergraph cut sparsifiers. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, pages 61–72, 2020

    2020

  26. [31]

    Demystifying graph sparsification algorithms in graph properties preservation

    Yuhan Chen, Haojie Ye, Sanketh Vedula, Alex Bronstein, Ronald Dreslinski, Trevor Mudge, and Nishil Talati. Demystifying graph sparsification algorithms in graph properties preservation. Proceedings of the VLDB Endowment, 17(3):427–440, 2023

    2023

  27. [32]

    Community detection in hypergraphs: Optimal statistical limit and efficient algorithms

    I (Eli) Chien, Chung-Yi Lin, and I-Hsiang Wang. Community detection in hypergraphs: Optimal statistical limit and efficient algorithms. In Amos Storkey and Fernando Perez-Cruz, editors,Proceedings of the 21st International Conference on Artificial Intelligence and Statistics, ...

    2018

  28. [33]

    Combinatorial Ricci flows on surfaces.Journal of Differential Geometry, 63(1):97–129, 2003

    Bennett Chow and Feng Luo. Combinatorial Ricci flows on surfaces.Journal of Differential Geometry, 63(1):97–129, 2003

    2003

  29. [34]

    Ollivier-Ricci curvature for hypergraphs: A unified framework

    Corinna Coupette, Sebastian Dalleiger, and Bastian Rieck. Ollivier-Ricci curvature for hypergraphs: A unified framework. InThe 11th International Conference on Learning Representations, 2023

    2023

  30. [35]

    Decomposition of pointwise finite-dimensional persistence modules

    William Crawley-Boevey. Decomposition of pointwise finite-dimensional persistence modules. Journal of Algebra and Its Applications, 14(05):1550066, June 2015. Publisher: World Scientific Publishing Co

    2015

  31. [36]

    Coverage in sensor networks via persistent homology

    Vin de Silva and Robert Ghrist. Coverage in sensor networks via persistent homology. Algebraic & Geometric Topology, 7(1):339–358, April 2007

    2007

  32. [37]

    Discrete curvature on graphs from the effective resistance.Journal of Physics: Complexity, 3(2), 2022

    Karel Devriendt and Renaud Lambiotte. Discrete curvature on graphs from the effective resistance.Journal of Physics: Complexity, 3(2), 2022. Finding the Cores of Higher Graphs 49

    2022

  33. [38]

    Graph curvature via resistance distance.Discrete Applied Mathematics, 348:68–78, 2024

    Karel Devriendt, Andrea Ottolini, and Stefan Steinerberger. Graph curvature via resistance distance.Discrete Applied Mathematics, 348:68–78, 2024

    2024

  34. [39]

    Dey, Fengtao Fan, and Yusu Wang

    Tamal K. Dey, Fengtao Fan, and Yusu Wang. Computing topological persistence for simplicial maps. InProceedings of the 30th Annual Symposium on Computational Geometry, pages 345–354. ACM, 2014

    2014

  35. [40]

    Dey, Dayu Shi, and Yusu Wang

    Tamal K. Dey, Dayu Shi, and Yusu Wang. SimBa: An efficient tool for approximating Rips-filtration persistence via Simplicial Batch Collapse.ACM Journal of Experimental Algorithmics, 24:1–16, 2019

    2019

  36. [41]

    The density of expected persistence diagrams and its kernel based estimation.Journal of Computational Geometry, 10(2):127–153, 2019

    Vincent Divol and Fr´ed´eric Chazal. The density of expected persistence diagrams and its kernel based estimation.Journal of Computational Geometry, 10(2):127–153, 2019

    2019

  37. [42]

    Estimation and quantization of expected persistence diagrams

    Vincent Divol and Th ´eo Lacombe. Estimation and quantization of expected persistence diagrams. InInternational Conference on Machine Learning, pages 2760–2770. PMLR, 2021

    2021

  38. [44]

    Persistent homology-a survey.Contemporary Mathe- matics, 453:257–282, 2008

    Herbert Edelsbrunner and John Harer. Persistent homology-a survey.Contemporary Mathe- matics, 453:257–282, 2008

    2008

  39. [45]

    American Mathematical Society, 2022

    Herbert Edelsbrunner and John L Harer.Computational topology: an introduction. American Mathematical Society, 2022

    2022

  40. [46]

    Edge- based analysis of networks: curvatures of graphs and hypergraphs.Theory in Biosciences, 139(4):337–348, December 2020

    Marzieh Eidi, Amirhossein Farzam, Wilmer Leal, Areejit Samal, and J¨ urgen Jost. Edge- based analysis of networks: curvatures of graphs and hypergraphs.Theory in Biosciences, 139(4):337–348, December 2020

    2020

  41. [47]

    Ollivier Ricci curvature of directed hypergraphs.Scientific Reports, 10(1):12466, 2020

    Marzieh Eidi and J¨ urgen Jost. Ollivier Ricci curvature of directed hypergraphs.Scientific Reports, 10(1):12466, 2020

    2020

  42. [48]

    Irreducibility of Markov chains on simplicial complexes, the spectrum of the discrete Hodge Laplacian and homology

    Marzieh Eidi and Sayan Mukherjee. Irreducibility of Markov chains on simplicial complexes, the spectrum of the discrete Hodge Laplacian and homology. arXiv preprint arXiv:2310.07912, 2023

    2023 arXiv

  43. [49]

    Multiscale topology of chromatin folding

    Kevin Emmett, Benjamin Schweinhart, and Raul Rabadan. Multiscale topology of chromatin folding. InProceedings of the 9th EAI International Conference on Bio-inspired Informa- tion and Communications Technologies (Formerly BIONETICS), BICT’15, pages 177–180, Brussels, BEL, May ...

    2016

  44. [50]

    Mitchell, Brenda Praggastis, Amie J

    Song Feng, Emily Heath, Brett Jefferson, Cliff Joslyn, Henry Kvinge, Hugh D. Mitchell, Brenda Praggastis, Amie J. Eisfeld, Amy C. Sims, Larissa B. Thackray, Shufang Fan, Kevin B. Walters, Peter J. Halfmann, Danielle Westhoff-Smith, Qing Tan, Vineet D. Menachery, Timothy P. She...

    2021

  45. [51]

    Augmentations of Forman’s Ricci curvature and their applications in community detection.Journal of Physics: Complexity, 5(3):035010, 2024

    Lukas Fesser, Sergio Serrano de Haro Iv´a˜nez, Karel Devriendt, Melanie Weber, and Renaud Lambiotte. Augmentations of Forman’s Ricci curvature and their applications in community detection.Journal of Physics: Complexity, 5(3):035010, 2024

    2024

  46. [52]

    Bochner’s method for cell complexes and combinatorial Ricci curvature

    Robin Forman. Bochner’s method for cell complexes and combinatorial Ricci curvature. Discrete & Computational Geometry, 29:323–374, 2003

    2003

  47. [53]

    Learning discrete structures for graph neural networks

    Luca Franceschi, Matthias Niepert, Massimiliano Pontil, and Xiao He. Learning discrete structures for graph neural networks. InProceedings of the 36th International Conference on Machine Learning, pages 1972–1982, 2019

    1972

  48. [54]

    Directed hypergraphs and applications.Discrete Applied Mathematics, 42(2-3):177–201, 1993

    Giorgio Gallo, Giustino Longo, Stefano Pallottino, and Sang Nguyen. Directed hypergraphs and applications.Discrete Applied Mathematics, 42(2-3):177–201, 1993

    1993

  49. [55]

    A topological measurement of protein compressibility.Japan Journal of Industrial and Applied Mathematics, 32:1–17, March 2014

    Marcio Gameiro, Yasuaki Hiraoka, Shunsuke Izumi, Miroslav Kram´ar, Konstantin Mischaikow, and Vidit Nanda. A topological measurement of protein compressibility.Japan Journal of Industrial and Applied Mathematics, 32:1–17, March 2014

    2014

  50. [56]

    Graph condensation: A survey.IEEE Transactions on Knowledge and Data Engineering, 37(4):1819– 1837, 2025

    Xinyi Gao, Junliang Yu, Tong Chen, Guanhua Ye, Wentao Zhang, and Hongzhi Yin. Graph condensation: A survey.IEEE Transactions on Knowledge and Data Engineering, 37(4):1819– 1837, 2025. 50 Garc ´ıa-Redondo et al

    2025

  51. [57]

    A survey of simplicial, relative, and chain complex homology theories for hypergraphs

    Ellen Gasparovic, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, and Lori Ziegelmeier. A survey of simplicial, relative, and chain complex homology theories for hypergraphs. arXiv preprint arXiv:2409.18310, 2024

    2024

  52. [58]

    Polyadic opinion formation: The adaptive voter model on a hypergraph.Annalen der Physik, 2024

    Anastasia Golovin, Jan M¨olter, and Christian Kuehn. Polyadic opinion formation: The adaptive voter model on a hypergraph.Annalen der Physik, 2024

    2024

  53. [59]

    Curvature sets over persistence diagrams.Discrete & Computational Geometry, 72:91–180, 2024

    Mario G´omez and Facundo M´emoli. Curvature sets over persistence diagrams.Discrete & Computational Geometry, 72:91–180, 2024

    2024

  54. [61]

    Modern Birkh¨auser Classics

    Misha Gromov.Metric structures for Riemannian and non–Riemannian spaces. Modern Birkh¨auser Classics. Birkh¨auser Boston, Inc., Boston, MA, english edition, 2007. Based on the 1981 French original, With appendices by M. Katz, P. Pansu and S. Semmes, Translated from the French ...

    2007

  55. [62]

    Metric Ricci curvature for manifolds.Geometry, 2013, 2013

    David Xianfeng Gu and Emil Saucan. Metric Ricci curvature for manifolds.Geometry, 2013, 2013

    2013

  56. [63]

    Aditya Prakash, and Wei Jin

    Mohammad Hashemi, Shengbo Gong, Juntong Ni, Wenqi Fan, B. Aditya Prakash, and Wei Jin. A comprehensive survey on graph reduction: sparsification, coarsening, and condensation. InProceedings of the 33rd International Joint Conference on Artificial Intelligence, 2024

    2024

  57. [64]

    The total variation on hypergraphs - learning on hypergraphs revisited

    Matthias Hein, Simon Setzer, Leonardo Jost, and Syama Sundar Rangapuram. The total variation on hypergraphs - learning on hypergraphs revisited. InProceedings of the 26th International Conference on Neural Information Processing Systems - Volume 2, pages 2427–2435, Red Hook, N...

    2013

  58. [65]

    Independent component analysis: Algorithms and applications

    Aapo Hyv¨arinen and Erkki Oja. Independent component analysis: Algorithms and applications. Neural Networks, 13(4):411–430, June 2000

    2000

  59. [66]

    Multilayer network simplification: Approaches, models and methods.Computer Science Review, 36:100246, 2020

    Roberto Interdonato, Matteo Magnani, Diego Perna, Andrea Tagarelli, and Davide Vega. Multilayer network simplification: Approaches, models and methods.Computer Science Review, 36:100246, 2020

    2020

  60. [67]

    Comparative analysis of Forman-Ricci curvature versions applied to the persistent homology of networks.arXiv preprint arXiv:2212.01357, 2022

    Sergio Serrano de Haro Iv´a˜nez. Comparative analysis of Forman-Ricci curvature versions applied to the persistent homology of networks.arXiv preprint arXiv:2212.01357, 2022

    2022 arXiv

  61. [68]

    Liu, and Aaron Sidford

    Arun Jambulapati, Yang P. Liu, and Aaron Sidford. Chaining, group leverage score overesti- mates, and fast spectral hypergraph sparsification. InProceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 196–206, New York, NY, USA, 2023. Association for Computi...

    2023

  62. [69]

    Discrete surface Ricci flow: Theory and applications

    Miao Jin, Junho Kim, and Xianfeng David Gu. Discrete surface Ricci flow: Theory and applications. InMathematics of Surfaces XII: 12th IMA International Conference, Sheffield, UK, September 4-6, 2007. Proceedings 12, pages 209–232. Springer, 2007

    2007

  63. [70]

    Graph structure learning for robust graph neural networks.Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 66–74, 2020

    Wei Jin, Yao Ma, Xiaorui Liu, Xianfeng Tang, Suhang Wang, and Jiliang Tang. Graph structure learning for robust graph neural networks.Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 66–74, 2020

    2020

  64. [71]

    Graph con- densation for graph neural networks

    Wei Jin, Lingxiao Zhao, Shichang Zhang, Yozen Liu, Jiliang Tang, and Neil Shah. Graph con- densation for graph neural networks. InInternational Conference on Learning Representations, 2022

    2022

  65. [72]

    Characterizations of Forman curvature.arXiv preprint arXiv:2110.04554, 2021

    J¨ urgen Jost and Florentin M¨ unch. Characterizations of Forman curvature.arXiv preprint arXiv:2110.04554, 2021

    2021 arXiv

  66. [73]

    Towards tight bounds for spectral sparsification of hypergraphs

    Michael Kapralov, Robert Krauthgamer, Jakab Tardos, and Yuichi Yoshida. Towards tight bounds for spectral sparsification of hypergraphs. InProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 598–611, 2021

    2021

  67. [74]

    A hypergraph partitioning package.Army HPC Research Center, Department of Computer Science & Engineering, University of Minnesota, 2:1–20, 1998

    George Karypis and Vipin Kumar. A hypergraph partitioning package.Army HPC Research Center, Department of Computer Science & Engineering, University of Minnesota, 2:1–20, 1998

    1998

  68. [75]

    Sharathkumar

    Michael Kerber and R. Sharathkumar. Approximate ˇCech complex in low and high dimensions. In Leizhen Cai, Siu-Wing Cheng, and Tak-Wah Lam, editors,Algorithms and Computation, volume 8283, pages 666–676. Springer Berlin Heidelberg, 2013

    2013

  69. [76]

    Link pruning for community detection in social networks.Applied Sciences, 12(13):6811, 2022

    Jeongseon Kim, Soohwan Jeong, and Sungsu Lim. Link pruning for community detection in social networks.Applied Sciences, 12(13):6811, 2022. Finding the Cores of Higher Graphs 51

    2022

  70. [77]

    Klein and Milan Randic

    Douglas J. Klein and Milan Randic. Resistance distance.Journal of Mathematical Chemistry, 12:81–95, 1993

    1993

  71. [78]

    A simple hypergraph min cut algorithm.Freie Universit¨at Berlin, Fachbereich Mathematik und Informatik; Serie B, Informatik, 1996

    Regina Klimmek and Frank Wagner. A simple hypergraph min cut algorithm.Freie Universit¨at Berlin, Fachbereich Mathematik und Informatik; Serie B, Informatik, 1996

    1996

  72. [79]

    Sketching cuts in graphs and hypergraphs

    Dmitry Kogan and Robert Krauthgamer. Sketching cuts in graphs and hypergraphs. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pages 367–376, 2015

    2015

  73. [80]

    k-core: Theories and applications.Physics Reports, 832:1–32, 2019

    Yi-Xiu Kong, Gui-Yuan Shi, Rui-Jie Wu, and Yi-Cheng Zhang. k-core: Theories and applications.Physics Reports, 832:1–32, 2019. k-core: Theories and Applications

    2019

  74. [81]

    Using persistent homology and dynamical distances to analyze protein binding.Statistical Applications in Genetics and Molecular Biology, 15(1), January 2016

    Violeta Kovacev-Nikolic, Peter Bubenik, Dragan Nikoli´c, and Giseon Heo. Using persistent homology and dynamical distances to analyze protein binding.Statistical Applications in Genetics and Molecular Biology, 15(1), January 2016

    2016

  75. [82]

    Ricci curvature of random and empirical directed hypernetworks.Applied network science, 5:1–14, 2020

    Wilmer Leal, Marzieh Eidi, and J¨ urgen Jost. Ricci curvature of random and empirical directed hypernetworks.Applied network science, 5:1–14, 2020

    2020

  76. [83]

    Stadler, and J¨ urgen Jost

    Wilmer Leal, Guillermo Restrepo, Peter F. Stadler, and J¨ urgen Jost. Forman–Ricci curvature for hypergraphs.Advances in Complex Systems, 24(01):2150003, February 2021. Publisher: World Scientific Publishing Co

    2021

  77. [84]

    Kahng, Y

    Deokjae Lee, B. Kahng, Y. S. Cho, K.-I. Goh, and D.-S. Lee. Recent advances of percolation theory in complex networks.Journal of the Korean Physical Society, 73:152–164, 2018

    2018

  78. [85]

    James R. Lee. Spectral hypergraph sparsification via chaining. InProceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 207–218, New York, NY, USA,

  79. [86]

    Jongshin Lee, Kwang-Il Goh, Deok-Sun Lee, and B. Kahng. (k, q)-core decomposition of hypergraphs.Chaos, Solitons & Fractals, 173:113645, 2023

    2023

  80. [87]

    Percolation on complex networks: Theory and application.Physics Reports, 907:1–68, 2021

    Ming Li, Run-Ran Liu, Linyuan L¨ u, Mao-Bin Hu, Shuqi Xu, and Yi-Cheng Zhang. Percolation on complex networks: Theory and application.Physics Reports, 907:1–68, 2021

    2021

  81. [88]

    Submodular hypergraphs: p-Laplacians, Cheeger inequalities and spectral clustering

    Pan Li and Olgica Milenkovic. Submodular hypergraphs: p-Laplacians, Cheeger inequalities and spectral clustering. InProceedings of the 35th International Conference on Machine Learning, volume 80, pages 3014–3023, 2018

    2018

  82. [89]

    Ricci curvature of graphs.Tohoku Mathematical Journal, 63(4):605 – 627, 2011

    Yong Lin, Linyuan Lu, and Shing-Tung Yau. Ricci curvature of graphs.Tohoku Mathematical Journal, 63(4):605 – 627, 2011

    2011

  83. [90]

    Graph summarization methods and applications: A survey.ACM Computing Surveys, 51(3):1–34, 2018

    Yike Liu, Tara Safavi, Abhilash Dighe, and Danai Koutra. Graph summarization methods and applications: A survey.ACM Computing Surveys, 51(3):1–34, 2018

    2018

  84. [91]

    Ricci curvature for metric-measure spaces via optimal transport

    John Lott and C´edric Villani. Ricci curvature for metric-measure spaces via optimal transport. Annals of Mathematics, pages 903–991, 2009

    2009

  85. [92]

    Hypergraph Markov operators, eigenvalues and approximation algorithms

    Anand Louis. Hypergraph Markov operators, eigenvalues and approximation algorithms. InProceedings of the forty-seventh annual ACM symposium on theory of computing, pages 713–722, 2015

    2015

  86. [93]

    A fast hypergraph min-cut algorithm for circuit partitioning

    Wai-Kei Mak and DF Wong. A fast hypergraph min-cut algorithm for circuit partitioning. Integration, 30(1):1–11, 2000

    2000

  87. [94]

    A random walks view of spectral segmentation

    Marina Meil˘a and Jianbo Shi. A random walks view of spectral segmentation. InInternational Workshop on Artificial Intelligence and Statistics, pages 203–208. PMLR, January 2001

    2001

  88. [95]

    Quantitative simplification of filtered simplicial complexes.Discrete & Computational Geometry, 65(2):554–583, 2021

    Facundo M´emoli and Osman Berat Okutan. Quantitative simplification of filtered simplicial complexes.Discrete & Computational Geometry, 65(2):554–583, 2021

    2021

  89. [96]

    Laplacian matrices of graphs: A survey.Linear Algebra and its Applications, 197–198:143–176, 1994

    Russell Merris. Laplacian matrices of graphs: A survey.Linear Algebra and its Applications, 197–198:143–176, 1994

    1994

  90. [97]

    Manifolds with density.Notices of the AMS, 52(8):853–858, 2005

    Frank Morgan. Manifolds with density.Notices of the AMS, 52(8):853–858, 2005

    2005

  91. [98]

    Wojciechowski

    Florentin M¨ unch and Rados law K. Wojciechowski. Ollivier Ricci curvature for general graph Laplacians: Heat equation, Laplacian comparison, non-explosion and diameter bounds. Advances in Mathematics, 356:106759, November 2019

    2019

  92. [99]

    A linear-time algorithm for finding a sparse k-connected spanning subgraph ofak-connected graph.Algorithmica, 7(1):583–596, 1992

    Hiroshi Nagamochi and Toshihide Ibaraki. A linear-time algorithm for finding a sparse k-connected spanning subgraph ofak-connected graph.Algorithmica, 7(1):583–596, 1992

    1992

  93. [100]

    Oxford University Press, 2018

    Mark Newman.Networks. Oxford University Press, 2018

    2018

  94. [101]

    On spectral clustering: Analysis and an algorithm.Advances in Neural Information Processing Systems, 14, 2001

    Andrew Y Ng, Michael I Jordan, and Yair Weiss. On spectral clustering: Analysis and an algorithm.Advances in Neural Information Processing Systems, 14, 2001. 52 Garc ´ıa-Redondo et al

    2001

  95. [102]

    Community detection on networks with Ricci flow.Scientific Reports, 9(1):9984, July 2019

    Chien-Chun Ni, Yu-Yao Lin, Feng Luo, and Jie Gao. Community detection on networks with Ricci flow.Scientific Reports, 9(1):9984, July 2019

    2019

  96. [103]

    Ricci curvature of metric spaces.Comptes Rendus Math ´ematique

    Yann Ollivier. Ricci curvature of metric spaces.Comptes Rendus Math ´ematique. Acad´emie des Sciences. Paris, 345(11):643–646, 2007

    2007

  97. [104]

    Ricci curvature of Markov chains on metric spaces.Journal of Functional Analysis, 256(3):810–864, 2009

    Yann Ollivier. Ricci curvature of Markov chains on metric spaces.Journal of Functional Analysis, 256(3):810–864, 2009

    2009

  98. [105]

    Spectral sparsification of simplicial complexes for clustering and label propagation.Journal of Computational Geometry, 11(1):176–211, 2020

    Braxton Osting, Sourabh Palande, and Bei Wang. Spectral sparsification of simplicial complexes for clustering and label propagation.Journal of Computational Geometry, 11(1):176–211, 2020

    2020

  99. [106]

    A roadmap for the computation of persistent homology.EPJ Data Science, 6:1–38, 2017

    Nina Otter, Mason A Porter, Ulrike Tillmann, Peter Grindrod, and Heather A Harrington. A roadmap for the computation of persistent homology.EPJ Data Science, 6:1–38, 2017

    2017

  100. [107]

    Lower Ricci curvature for efficient community detection

    Yun Jin Park and Didong Li. Lower Ricci curvature for efficient community detection. arXiv preprint arXiv:2401.10124, 2024

    2024 arXiv

  101. [108]

    Towards sparsification of graph neural networks

    Hongwu Peng, Deniz Gurevin, Shaoyi Huang, Tong Geng, Weiwen Jiang, Orner Khan, and Caiwen Ding. Towards sparsification of graph neural networks. InIEEE 40th International Conference on Computer Design (ICCD), pages 272–279, 2022

    2022

  102. [109]

    Springer International Publishing, Cham, 2016

    Peter Petersen.Riemannian Geometry, volume 171 ofGraduate Texts in Mathematics. Springer International Publishing, Cham, 2016

    2016

  103. [110]

    Pokorny, Majd Hawasly, and Subramanian Ramamoorthy

    Florian T. Pokorny, Majd Hawasly, and Subramanian Ramamoorthy. Topological trajec- tory classification with filtrations of simplicial complexes and persistent homology.The International Journal of Robotics Research, 35(1-3):204–223, January 2016

    2016

  104. [111]

    Global graph curvature

    Liudmila Prokhorenkova, Egor Samosvat, and Pim van der Hoorn. Global graph curvature. In Bogumil Kami´nski, Pawel Pralat, and Przemyslaw Szufel, editors,Algorithms and Models for the Web Graph, pages 16–35, Cham, 2020. Springer International Publishing

    2020

  105. [112]

    Minimizing symmetric submodular functions.Mathematical program- ming, 82:3–12, 1998

    Maurice Queyranne. Minimizing symmetric submodular functions.Mathematical program- ming, 82:3–12, 1998

    1998

  106. [113]

    Rodr´ıguez

    J.A. Rodr´ıguez. On the Laplacian eigenvalues and metric parameters of hypergraphs.Linear and Multilinear Algebra, 50(1):1–14, 2002

    2002

  107. [114]

    Rodr´ıguez

    J.A. Rodr´ıguez. On the Laplacian spectrum and walk-regular hypergraphs.Linear and Multilinear Algebra, 51(3):285–297, 2003

    2003

  108. [115]

    Rodr´ıguez

    J.A. Rodr´ıguez. Laplacian eigenvalues and partition problems in hypergraphs.Applied Mathematics Letters, 22(6):916–921, 2009

    2009

  109. [116]

    Community detection in large hypergraphs.Science Advances, 9(28):eadg9159, 2023

    Nicol`o Ruggeri, Martina Contisciani, Federico Battiston, and Caterina De Bacco. Community detection in large hypergraphs.Science Advances, 9(28):eadg9159, 2023

    2023

  110. [117]

    Recent advances in percolation theory and its applications.Physics Reports, 578:1–32, 2015

    Abbas Ali Saberi. Recent advances in percolation theory and its applications.Physics Reports, 578:1–32, 2015. Recent advances in percolation theory and its applications

    2015

  111. [118]

    Springer Cham, 2023

    Muhammad Sahimi.Applications of Percolation Theory. Springer Cham, 2023

    2023

  112. [119]

    Generalizing p-Laplacian: Spectral hypergraph theory and a partitioning algorithm.Machine Learning, 112(1):241–280, 2023

    Shota Saito and Mark Herbster. Generalizing p-Laplacian: Spectral hypergraph theory and a partitioning algorithm.Machine Learning, 112(1):241–280, 2023

    2023

  113. [120]

    Hypergraph p-Laplacian: A differential geometry view.Proceedings of the AAAI Conference on Artificial Intelligence, 32(1), 2018

    Shota Saito, Danilo Mandic, and Hideyuki Suzuki. Hypergraph p-Laplacian: A differential geometry view.Proceedings of the AAAI Conference on Artificial Intelligence, 32(1), 2018

    2018

  114. [121]

    Loqman Salamatian, Scott Anderson, Joshua Matthews, Paul Barford, Walter Willinger, and Mark Crovella. Curvature-based analysis of network connectivity in private backbone infrastructures.Proceedings of the ACM on Measurement and Analysis of Computing Systems, 6(1):5:1–5:32, F...

    2022

  115. [122]

    Comparative analysis of two discretizations of Ricci curvature for complex networks.Scientific Reports, 8(1):8650, 2018

    Areejit Samal, RP Sreejith, Jiao Gu, Shiping Liu, Emil Saucan, and J¨ urgen Jost. Comparative analysis of two discretizations of Ricci curvature for complex networks.Scientific Reports, 8(1):8650, 2018

    2018

  116. [123]

    Emil Saucan, R. P. Sreejith, R. P. Vivek-Ananth, J¨ urgen Jost, and Areejit Samal. Discrete Ricci curvatures for directed networks.Chaos, Solitons & Fractals, 118:347–360, January 2019

    2019

  117. [124]

    Stephen B. Seidman. Network structure and minimum degree.Social Networks, 5(3):269–287, 1983

    1983

  118. [125]

    Donald R. Sheehy. Linear-size approximations to the Vietoris–Rips filtration. InProceedings of the 28th Annual Symposium on Computational Geometry, pages 239–248. ACM, 2012. Finding the Cores of Higher Graphs 53

    2012

  119. [126]

    Normalized cuts and image segmentation.IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 2000

    Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation.IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 2000

    2000

  120. [127]

    Ollivier-Ricci curvature-based method to community detection in complex networks.Scientific Reports, 9(1):9800, July 2019

    Jayson Sia, Edmond Jonckheere, and Paul Bogdan. Ollivier-Ricci curvature-based method to community detection in complex networks.Scientific Reports, 9(1):9800, July 2019

    2019

  121. [128]

    From geometry to topology: Inverse theorems for distributed persistence

    Elchanan Solomon, Alexander Wagner, and Paul Bendich. From geometry to topology: Inverse theorems for distributed persistence. In Xavier Goaoc and Michael Kerber, editors,38th International Symposium on Computational Geometry, volume 224 ofLeibniz International Proceedings in ...

    2022

  122. [129]

    Spectral sparsification of hypergraphs

    Tasuku Soma and Yuichi Yoshida. Spectral sparsification of hypergraphs. InProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2570–2581, 2019

    2019

  123. [131]

    Spielman and Shang-Hua Teng

    Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. InProceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 81–90, 2004

    2004

  124. [132]

    David I. Spivak. Higher-dimensional models of networks. arXiv preprint arXiv:0909.4314, 2009

    2009 arXiv

  125. [133]

    R. P. Sreejith, J¨ urgen Jost, Emil Saucan, and Areejit Samal. Forman curvature for directed networks. arXiv preprint arXiv:1605.04662, February 2017

    2017 arXiv

  126. [134]

    Forman curvature for complex networks.Journal of Statistical Mechanics: Theory and Experiment, 2016(6):063206, 2016

    RP Sreejith, Karthikeyan Mohanraj, J¨ urgen Jost, Emil Saucan, and Areejit Samal. Forman curvature for complex networks.Journal of Statistical Mechanics: Theory and Experiment, 2016(6):063206, 2016

    2016

  127. [135]

    A combinatorial analogue of a theorem of Myers.Illinois Journal of Mathematics, 20(1):12–21, 1976

    David A Stone. A combinatorial analogue of a theorem of Myers.Illinois Journal of Mathematics, 20(1):12–21, 1976

    1976

  128. [136]

    Higher-order percolation processes on multiplex hyper- graphs.Physical Review E, 104(3):034306, 2021

    Hanlin Sun and Ginestra Bianconi. Higher-order percolation processes on multiplex hyper- graphs.Physical Review E, 104(3):034306, 2021

    2021

  129. [137]

    Springer Berlin, Heidelberg, 2014

    Michel Talagrand.Upper and lower bounds for stochastic processes, volume 60. Springer Berlin, Heidelberg, 2014

    2014

  130. [138]

    Enhanced Forman curvature and its relation to Ollivier curvature.Europhysics Letters, 133(6):60006, 2021

    Philip Tee and Carlo A Trugenberger. Enhanced Forman curvature and its relation to Ollivier curvature.Europhysics Letters, 133(6):60006, 2021

    2021

  131. [139]

    Mixed-membership community detection via line graph curvature

    Yu Tian, Zachary Lubberts, and Melanie Weber. Mixed-membership community detection via line graph curvature. InProceedings of the 1st NeurIPS Workshop on Symmetry and Geometry in Neural Representations, pages 219–233. PMLR, February 2023

    2023

  132. [140]

    Mixed-membership community detection via line graph curvature

    Yu Tian, Zachary Lubberts, and Melanie Weber. Mixed-membership community detection via line graph curvature. InNeurIPS Workshop on Symmetry and Geometry in Neural Representations, pages 219–233. PMLR, 2023

    2023

  133. [141]

    Curvature-based clustering on graphs

    Yu Tian, Zachary Lubberts, and Melanie Weber. Curvature-based clustering on graphs. Journal of Machine Learning Research, 26(52):1–67, 2025

    2025

  134. [142]

    Understanding over-squashing and bottlenecks on graphs via curvature

    Jake Topping, Francesco Di Giovanni, Benjamin Paul Chamberlain, Xiaowen Dong, and Michael M Bronstein. Understanding over-squashing and bottlenecks on graphs via curvature. InInternational Conference on Learning Representations, 2022

    2022

  135. [143]

    Persistent homology for automatic determination of human-data based cost of bipedal walking.Nonlinear Analysis: Hybrid Systems, 7(1):101–115, February 2013

    Ramanarayan Vasudevan, Aaron Ames, and Ruzena Bajcsy. Persistent homology for automatic determination of human-data based cost of bipedal walking.Nonlinear Analysis: Hybrid Systems, 7(1):101–115, February 2013

    2013

  136. [144]

    A tutorial on spectral clustering.Statistics and Computing, 17(4):395–416, December 2007

    Ulrike Von Luxburg. A tutorial on spectral clustering.Statistics and Computing, 17(4):395–416, December 2007

    2007

  137. [145]

    Detecting the coarse geometry of networks

    Melanie Weber, Jurgen Jost, and Emil Saucan. Detecting the coarse geometry of networks. In32nd Conference on Neural Information Processing Systems Workshop on Relational Representation Learning, 2018

    2018

  138. [146]

    Persistent topological laplacians—a survey.Mathematics, 13(2), 2025

    Xiaoqi Wei and Guo-Wei Wei. Persistent topological laplacians—a survey.Mathematics, 13(2), 2025

    2025

  139. [147]

    Subsampling in large graphs using Ricci curvature

    Shushan Wu, Huimin Cheng, Jiazhang Cai, Ping Ma, and Wenxuan Zhong. Subsampling in large graphs using Ricci curvature. InThe 11th International Conference on Learning Representations, 2023. 54 Garc ´ıa-Redondo et al

    2023

  140. [148]

    Multiscale persistent functions for biomolecular structure characterization.Bulletin of Mathematical Biology, 80(1):1–31, January 2018

    Kelin Xia, Zhiming Li, and Lin Mu. Multiscale persistent functions for biomolecular structure characterization.Bulletin of Mathematical Biology, 80(1):1–31, January 2018

    2018

  141. [149]

    The Ricci curvature on simplicial complexes.Theory and Applications of Graphs, 10(2):1–18, 2023

    Taiki Yamada. The Ricci curvature on simplicial complexes.Theory and Applications of Graphs, 10(2):1–18, 2023

    2023

  142. [150]

    GraphLSHC: Towards large scale spectral hypergraph clustering.Information Sciences, 544:117–134, January 2021

    Yiyang Yang, Sucheng Deng, Juan Lu, Yuhong Li, Zhiguo Gong, Leong Hou U, and Zhifeng Hao. GraphLSHC: Towards large scale spectral hypergraph clustering.Information Sciences, 544:117–134, January 2021

    2021

  143. [151]

    Cheeger inequalities for submodular transformations

    Yuichi Yoshida. Cheeger inequalities for submodular transformations. InProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2582–2601. SIAM, 2019

    2019

  144. [152]

    Ricci curvature-based graph sparsification for continual graph representation learning.IEEE Transactions on Neural Networks and Learning Systems, pages 1–13, 2024

    Xikun Zhang, Dongjin Song, and Dacheng Tao. Ricci curvature-based graph sparsification for continual graph representation learning.IEEE Transactions on Neural Networks and Learning Systems, pages 1–13, 2024

    2024

  145. [153]

    Higher-order percolation in simplicial complexes.Chaos, Solitons & Fractals, 155:111701, 2022

    Dandan Zhao, Runchao Li, Hao Peng, Ming Zhong, and Wei Wang. Higher-order percolation in simplicial complexes.Chaos, Solitons & Fractals, 155:111701, 2022

    2022

  146. [154]

    Percolation on simplicial complexes.Applied Mathematics and Computation, 431:127330, 2022

    Dandan Zhao, Runchao Li, Hao Peng, Ming Zhong, and Wei Wang. Percolation on simplicial complexes.Applied Mathematics and Computation, 431:127330, 2022

    2022

  147. [155]

    Community detection in general hypergraph via graph embedding.Journal of the American Statistical Association, 118(543):1620–1629, 2023

    Yaoming Zhen and Junhui Wang. Community detection in general hypergraph via graph embedding.Journal of the American Statistical Association, 118(543):1620–1629, 2023

    2023

  148. [156]

    Learning with hypergraphs: Clustering, classification, and embedding

    Dengyong Zhou, Jiayuan Huang, and Bernhard Sch ¨olkopf. Learning with hypergraphs: Clustering, classification, and embedding. InAdvances in Neural Information Processing Systems, volume 19. MIT Press, 2006

    2006

  149. [157]

    A survey on graph structure learning: Progress and opportunities

    Yanqiao Zhu, Weizhi Xu, Jinghao Zhang, Yuanqi Du, Jieyu Zhang, Qiang Liu, Carl Yang, and Shu Wu. A survey on graph structure learning: Progress and opportunities. arXiv preprint arXiv:2103.03036, 2022

    2022 arXiv

  150. [158]

    Computing persistent homology.Discrete & Computational Geometry, 33(2):249–274, 2005

    Afra Zomorodian and Gunnar Carlsson. Computing persistent homology.Discrete & Computational Geometry, 33(2):249–274, 2005

    2005

  151. [2023]

    Association for Computing Machinery

Pith tools

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