pith. sign in

arxiv: 1907.03993 · v1 · pith:ELKFIURGnew · submitted 2019-07-09 · 💻 cs.SI · physics.soc-ph

Community Detection on Networks with Ricci Flow

Chien-Chun Ni , Yu-Yao Lin , Feng Luo , Jie Gao This is my paper

Pith reviewed 2026-05-25 00:06 UTC · model grok-4.3

classification 💻 cs.SI physics.soc-ph
keywords community detectionRicci flownetwork geometrycurvaturegraph decompositioncomplex networksgeometric methods
0
0 comments X

The pith

Discrete Ricci flow decomposes networks into communities by evolving edge curvatures.

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

The paper establishes that networks can be treated as geometric objects whose communities correspond to a geometric decomposition. It applies discrete Ricci flow, a process that evolves the graph metric according to curvature, to separate densely connected groups. This draws on the success of Ricci flow in decomposing smooth manifolds and tests the resulting partitions against networks with known community structures. A sympathetic reader would care because it supplies a deterministic geometric procedure for community detection instead of relying only on statistical or combinatorial rules.

Core claim

By viewing networks as geometric objects and communities as geometric decompositions, discrete Ricci flow applied to the graph produces components that correspond to the functional communities, as confirmed experimentally on networks with ground-truth structures.

What carries the argument

Discrete Ricci flow on graphs, which adjusts edge lengths according to their curvature to drive the network toward a decomposition.

If this is right

  • The same flow process can be run on any network once edge weights or distances are defined, yielding a community partition without additional statistical modeling.
  • Curvature evolution isolates groups whose internal connectivity is stronger than their external links, mirroring manifold decomposition.
  • The method inherits stability properties from the continuous Ricci flow when the graph discretization is sufficiently fine.
  • It supplies a deterministic stopping criterion based on curvature thresholds rather than modularity optimization.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The geometric framing could extend to time-varying networks by allowing the flow to run continuously as edges appear or disappear.
  • Curvature-based decompositions might reveal hierarchical community structure if the flow is stopped at multiple intermediate times.
  • The approach may connect to other curvature notions on graphs, such as Forman curvature, for comparative community detection.

Load-bearing premise

The components isolated by the discrete Ricci flow on the graph match the functionally meaningful communities rather than other geometric features of the embedding or weighting.

What would settle it

Running the flow on a network whose ground-truth communities are known and obtaining partitions that systematically fail to recover those communities would disprove the claim.

Figures

Figures reproduced from arXiv: 1907.03993 by Chien-Chun Ni, Feng Luo, Jie Gao, Yu-Yao Lin.

Figure 1
Figure 1. Figure 1: An illustration of Ricci flow on a manifold and a network. Ricci flow captures the large positive curvature regions in the manifold as well as communities in the network. The formation of singularities in the Ricci flow is illustrated by (b, c). The analog in (b’, c’) in the discrete Ricci flow decomposes the network into communities [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Ricci flow for community detection on the Karate club graph generated by Gephi’s ForceAtlas2 layout[31]. (a): The Karate club graph with edge weight 1 on all edges. Different colors of vertices represent different communities. The colors of edges represent the Ricci curvature on the edges. Notice that most edges between communities are negatively curved. (b): The same graph after 100 Ricci flow iterations.… view at source ↗
Figure 3
Figure 3. Figure 3: (a) A Facebook ego network of one user with 792 friends and 14025 edges generated by Gephi’s Fruchterman Reingold layout[31]. The colors represent 24 different friend circles (communities) hand labeled by the user. (b) By the Ricci flow process of 20 iterations, the weights of inter-community edges are increased (thick edges in the figure) while the weights of intra-community edges gradually shrink to 0 (t… view at source ↗
Figure 4
Figure 4. Figure 4: Examples of Ricci curvature on manifolds and graphs. In (a)-(c), manifolds with negative, zero, and positive curvatures are shown. In (d)-(f), all edges have weight of 1. (d) A tree graph with negative curvature everywhere, except the edges of the leaf nodes. (e) A (infinitely sized) grid graph with all edges of zero curvature. The cost of moving mx = {x, x1, x2, x3, x4} to my = {y, y1, y2, y3, y4} is equa… view at source ↗
Figure 5
Figure 5. Figure 5: In Figure 5(a) and Figure 5(b), the parameters [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 5
Figure 5. Figure 5: The accuracy of the Ricci flow method for community detection on model networks. The accuracy is measured by the adjust Rand index (ARI) and each data point is the average of 10 model graphs. In (a), we tested on the stochastic block model (SBM) with 500 nodes and two communities of the same size. A graph with low pinter/pintra ratio has more distinctive communities. Our method is shown to have perfect acc… view at source ↗
Figure 6
Figure 6. Figure 6: A comparison of clustering accuracy on an LFR graph after 50 iterations and GNet after 20 iterations of the Ricci flow with different final edge weight cutoff thresholds. In (a), with cutoff threshold set between 1 and 0.47 as the range highlighted in blue, we detected all communities correctly. In (b), we chose the cutoff threshold to be the turning point of modularity at w = 3.2 as the middle vertical li… view at source ↗
Figure 7
Figure 7. Figure 7: Illustrations of communities detected by discrete Ricci flow with three different cutoff weights of a GNet planar model with 1000 nodes, m = 2, and p = 0.9. With different cutoff thresholds (labeled as vertical lines in [PITH_FULL_IMAGE:figures/full_fig_p011_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Ricci flow and spinglass algorithms on LFR graphs with different average node degrees. With a higher average degree which implies higher edge density within communities, both algorithms provide better clustering results. 5 Conclusion In this paper, we have introduced geometric tools to investigate the community structures on complex networks. The basic idea is to consider networks as geometric objects and … view at source ↗
Figure 16
Figure 16. Figure 16: E Proof of Theorem 4.1 We remark that we are not able to prove the similar result for other Ollivier-Ricci curvatures when p > 0 though numerical results indicate it should be true. We start by computing the Wasserstein distance of a metric on G(a,b). In each community Ci there is a specific node ui which connects to other communities. We call this node the gateway node and the rest of the nodes in Ci the… view at source ↗
read the original abstract

Many complex networks in the real world have community structures -- groups of well-connected nodes with important functional roles. It has been well recognized that the identification of communities bears numerous practical applications. While existing approaches mainly apply statistical or graph theoretical/combinatorial methods for community detection, in this paper, we present a novel geometric approach which enables us to borrow powerful classical geometric methods and properties. By considering networks as geometric objects and communities in a network as a geometric decomposition, we apply curvature and discrete Ricci flow, which have been used to decompose smooth manifolds with astonishing successes in mathematics, to break down communities in networks. We tested our method on networks with ground-truth community structures, and experimentally confirmed the effectiveness of this geometric approach.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript proposes a geometric method for community detection on networks by treating them as geometric objects and applying discrete Ricci curvature and Ricci flow (imported from smooth manifold theory) to obtain a decomposition into communities. It reports experimental validation on networks possessing ground-truth community labels, asserting competitive effectiveness relative to existing approaches.

Significance. If the empirical link between the evolved metric and ground-truth communities holds under broader testing, the work supplies a novel geometric heuristic that could import tools and invariants from differential geometry into network science; the absence of free parameters in the core flow and the direct use of an external geometric process are strengths that distinguish it from purely statistical or combinatorial baselines.

minor comments (3)
  1. The abstract and introduction would benefit from a concise statement of the precise discrete curvature (Ollivier or Forman) and the exact flow equation employed, including how edge weights are updated and how the final partition is extracted from the evolved metric.
  2. Figure captions and experimental tables should explicitly list the benchmark networks, the ground-truth community counts, and the quantitative metrics (e.g., NMI, ARI) together with the competing methods used for comparison.
  3. Notation for the discrete Ricci curvature and the flow step should be introduced once in a dedicated preliminary section and used consistently thereafter to avoid ambiguity between continuous and discrete versions.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our work and the recommendation of minor revision. The referee's summary accurately captures the core contribution of applying discrete Ricci curvature and flow to networks for community detection.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper imports discrete Ricci flow (an established geometric process from differential geometry) as an external analogy for decomposing networks into communities, then validates the resulting partitions directly against ground-truth labels on benchmark graphs. No load-bearing step in the described derivation chain reduces by construction to a fitted parameter, self-referential definition, or self-citation chain; the geometric mapping is presented as a heuristic whose effectiveness is measured empirically rather than asserted tautologically.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Based solely on the abstract, the central claim rests on the domain assumption that networks admit a meaningful discrete curvature whose Ricci flow yields community structure. No free parameters or invented entities are mentioned.

axioms (1)
  • domain assumption Networks can be equipped with a discrete curvature such that Ricci flow decomposes them into communities.
    This premise is invoked when the paper equates geometric decomposition with community detection.

pith-pipeline@v0.9.0 · 5646 in / 1200 out tokens · 23593 ms · 2026-05-25T00:06:36.990555+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

69 extracted references · 69 canonical work pages · 1 internal anchor

  1. [1]

    Bhowmick, S. S. & Seah, B. S. Clustering and summarizing protein-protein interaction networks: A survey. IEEE Trans. Knowl. Data Eng. 28, 638–658 (2015)

    work page 2015

  2. [2]

    & Tessone, C

    Yang, Z., Algesheimer, R. & Tessone, C. J. A comparative analysis of community detection algorithms on artificial networks. Sci. Rep. 6, 30750 (2016)

    work page 2016

  3. [3]

    Community detection in graphs

    Fortunato, S. Community detection in graphs. Phys. Rep. 486, 75–174 (2010). 26/29

    work page 2010

  4. [4]

    Newman, M. E. J. Modularity and community structure in networks. Proc. Natl. Acad. Sci. U. S. A. 103, 8577–8582 (2006)

    work page 2006

  5. [5]

    Sinha, A., Gleich, D. F. & Ramani, K. Gauss’s law for networks directly reveals community boundaries. Sci. Rep. 8, 11909 (2018)

    work page 2018

  6. [6]

    Leskovec, J., Lang, K. J. & Mahoney, M. Empirical comparison of algorithms for network community detection. In Proc. 19th Int. Conf. World Wide Web, 631–640 (ACM, 2010)

    work page 2010

  7. [7]

    Clauset, A., Newman, M. E. J. & Moore, C. Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004)

    work page 2004

  8. [8]

    & Moore, C

    Zhang, P. & Moore, C. Scalable detection of statistically significant communities and hierarchies, using message passing for modularity. Proc. Natl. Acad. Sci. 111, 18144–18149 (2014)

    work page 2014

  9. [9]

    Peel, L., Larremore, D. B. & Clauset, A. The ground truth about metadata and community detection in networks. Sci. Adv. 3, e1602548 (2017)

    work page 2017

  10. [10]

    Allen, B. et al. Evolutionary dynamics on any population structure. Nature 544, 227–230 (2017)

    work page 2017

  11. [11]

    Community detection and stochastic block models: Recent developments

    Abbe, E. Community detection and stochastic block models: Recent developments. J. Mach. Learn. Res. 18, 1–86 (2018)

    work page 2018

  12. [12]

    N., Albert, R

    Raghavan, U. N., Albert, R. & Kumara, S. Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E Stat. Nonlin. Soft Matter Phys. 76, 036106 (2007)

    work page 2007

  13. [13]

    & Bergstrom, C

    Rosvall, M. & Bergstrom, C. T. Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. U. S. A. 105, 1118–1123 (2008)

    work page 2008

  14. [14]

    & Newman, M

    Girvan, M. & Newman, M. E. J. Community structure in social and biological networks. Proc. Natl. Acad. Sci. U. S. A. 99, 7821–7826 (2002)

    work page 2002

  15. [15]

    Newman, M. E. & Girvan, M. Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)

    work page 2004

  16. [16]

    Hamilton, R. S. Three-manifolds with positive ricci curvature. J. Differ. Geom. 17, 255–306 (1982)

    work page 1982

  17. [17]

    The entropy formula for the Ricci flow and its geometric applications

    Perelman, G. The entropy formula for the ricci flow and its geometric applications. (2002). https://arxiv.org/abs/ math/0211159

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  18. [18]

    Riemannian geometry and geometric analysis (Springer Science & Business Media, 2011)

    Jost, J. Riemannian geometry and geometric analysis (Springer Science & Business Media, 2011)

    work page 2011

  19. [19]

    Ricci curvature of markov chains on metric spaces.J

    Ollivier, Y . Ricci curvature of markov chains on metric spaces.J. Funct. Anal. 256, 810–864 (2009)

    work page 2009

  20. [20]

    A survey of ricci curvature for metric spaces and markov chains

    Ollivier, Y . A survey of ricci curvature for metric spaces and markov chains. InProbabilistic Approach to Geometry, 343–381 (Math. Soc. of Japan, Tokyo, Japan, 2010). https://doi.org/10.2969/aspm/05710343

    work page doi:10.2969/aspm/05710343 2010

  21. [21]

    & Villani, C

    Lott, J. & Villani, C. Ricci curvature for metric-measure spaces via optimal transport. Annals Math. Second. Ser. 169, 903–991 (2009)

    work page 2009

  22. [22]

    Ni, C.-C., Lin, Y .-Y ., Gao, J., Gu, X. D. & Saucan, E. Ricci curvature of the internet topology. InIEEE. Ic. Comp. Com. Net. (INFOCOM), vol. 26, 2758–2766 (IEEE, 2015). https://doi.org/10.1109/INFOCOM.2015.7218668

    work page doi:10.1109/infocom.2015.7218668 2015

  23. [23]

    Samal, A. et al. Comparative analysis of two discretizations of Ricci curvature for complex networks. Sci. Rep. 8, 8650 (2018)

    work page 2018

  24. [24]

    P., Mohanraj, K., Jost, J., Saucan, E

    Sreejith, R. P., Mohanraj, K., Jost, J., Saucan, E. & Samal, A. Forman curvature for complex networks. J. Stat. Mech: Theory Exp. 2016, 063206 (2016)

    work page 2016

  25. [25]

    & Banirazi, R

    Wang, C., Jonckheere, E. & Banirazi, R. Wireless network capacity versus Ollivier-Ricci curvature under Heat- Diffusion (HD) protocol. In 2014 American Control Conference, 3536–3541 (IEEE, 2014). 27/29

    work page 2014

  26. [26]

    & Matsen, F

    Whidden, C. & Matsen, F. A. Ricci–Ollivier curvature of the rooted phylogenetic subtree–prune–regraft graph. Theor . Comput. Sci.699, 1–20 (2017)

    work page 2017

  27. [27]

    & Liu, S

    Jost, J. & Liu, S. Ollivier’s Ricci curvature, local clustering and Curvature-Dimension inequalities on graphs. Discret. Comput. Geom. 51, 300–322 (2014)

    work page 2014

  28. [28]

    Sandhu, R. et al. Graph curvature for differentiating cancer networks. Sci. Rep. 5, 12323 (2015)

    work page 2015

  29. [29]

    S., Georgiou, T

    Sandhu, R. S., Georgiou, T. T. & Tannenbaum, A. R. Ricci curvature: An economic indicator for market fragility and systemic risk. Sci Adv 2, e1501495 (2016)

    work page 2016

  30. [30]

    Ni, C.-C., Lin, Y .-Y ., Gao, J. & Gu, X. Network alignment by discrete Ollivier-Ricci flow. InGraph Drawing and Network Visualization, 447–462 (Springer International Publishing, 2018)

    work page 2018

  31. [31]

    & Jacomy, M

    Bastian, M., Heymann, S. & Jacomy, M. Gephi: An open source software for exploring and manipulating networks. Int. AAAI Conf. on Weblogs Soc. Media (2009)

    work page 2009

  32. [32]

    & Radicchi, F

    Lancichinetti, A., Fortunato, S. & Radicchi, F. Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78, 046110 (2008)

    work page 2008

  33. [33]

    K., Iacovacci, J

    Bianconi, G., Darst, R. K., Iacovacci, J. & Fortunato, S. Triadic closure as a basic generating mechanism of communities in complex networks. Phys. Rev. E Stat. Nonlin. Soft Matter Phys. 90, 042806 (2014)

    work page 2014

  34. [34]

    & Bianconi, G

    Wu, Z., Menichetti, G., Rahmede, C. & Bianconi, G. Emergent complex network geometry. Sci. reports 5, 10073 (2015)

    work page 2015

  35. [35]

    & Arabie, P

    Hubert, L. & Arabie, P. Comparing partitions. J. Classif. 2, 193–218 (1985)

    work page 1985

  36. [36]

    & Jost, J

    Saucan, E., Samal, A., Weber, M. & Jost, J. Discrete curvatures and network analysis. MATCH Commun. Math. Comput. Chem. 80, 605–622 (2018)

    work page 2018

  37. [37]

    P., Jost, J., Saucan, E

    Sreejith, R. P., Jost, J., Saucan, E. & Samal, A. Systematic evaluation of a new combinatorial curvature for complex networks. Chaos Solitons Fractals 101, 50–67 (2017)

    work page 2017

  38. [38]

    & Émery, M

    Bakry, D. & Émery, M. Diffusions hypercontractives. In Azéma, J. & Yor, M. (eds.) Séminaire de Probabilités XIX 1983/84, vol. 1123 of Lecture Notes in Mathematics, 177–206 (Springer Berlin Heidelberg, Berlin, Heidelberg, 1985)

    work page 1983

  39. [39]

    Bonciocat, A. I. & Sturm, K. T. Mass transportation and rough curvature bounds for discrete spaces. J. Funct. Anal. (2009)

    work page 2009

  40. [40]

    A rough curvature-dimension condition for metric measure spaces

    Bonciocat, A.-I. A rough curvature-dimension condition for metric measure spaces. Cent. Eur . J. Math. 12, 362–380 (2014)

    work page 2014

  41. [41]

    & Banirazi, R

    Wang, C., Jonckheere, E. & Banirazi, R. Interference constrained network control based on curvature. In Proc. American Control Conference, vol. 2016-July, 6036–6041 (IEEE, 2016)

    work page 2016

  42. [42]

    Pal, S. et al. Jaccard curvature—an efficient proxy for Ollivier-Ricci curvature in graphs. In Complex Networks IX, 51–63 (Springer International Publishing, 2018)

    work page 2018

  43. [43]

    Bochner’s method for cell complexes and combinatorial ricci curvature

    Forman, R. Bochner’s method for cell complexes and combinatorial ricci curvature. Discret. Comput. Geom. 29, 323–374 (2003)

    work page 2003

  44. [44]

    & Jost, J

    Weber, M., Saucan, E. & Jost, J. Characterizing complex networks with Forman-Ricci curvature and associated geometric flows. J Complex Netw 5, 527–550 (2017)

    work page 2017

  45. [45]

    & Saucan, E

    Weber, M., Jost, J. & Saucan, E. Detecting the coarse geometry of networks. In NeurIPS 2018 Workshop (2018). https://www.mis.mpg.de/preprints/2018/preprint2018_97.pdf

    work page 2018

  46. [46]

    & Zeevi, Y

    Saucan, E., Wolansky, G., Appleboim, E. & Zeevi, Y . Y . Combinatorial ricci curvature and laplacians for image processing. In 2nd Int. Cong. on Image and Signal Processing , 1–6 (2009). https://doi.org/10.1109/CISP.2009. 5304710. 28/29

    work page doi:10.1109/cisp.2009 2009

  47. [47]

    Combinatorial Ricci flows on surfaces

    Chow, B., Luo, F.et al. Combinatorial Ricci flows on surfaces. J. Differ. Geom. 63, 97–129 (2003)

    work page 2003

  48. [48]

    & Crampes, M

    Plantié, M. & Crampes, M. Survey on social community detection. In Social Media Retrieval , Computer Communications and Networks, 65–85 (Springer, London, 2013)

    work page 2013

  49. [49]

    Parés, F. et al. Fluid communities: A competitive, scalable and diverse community detection algorithm. In Complex Networks & Their Applications VI , 229–240 (Springer International Publishing, 2018)

    work page 2018

  50. [50]

    R., Leskovec, J

    Yin, H., Benson, A. R., Leskovec, J. & Gleich, D. F. Local higher-order graph clustering. ACM Trans. on Knowl. Discov. from Data (TKDD) 2017, 555–564 (2017)

    work page 2017

  51. [51]

    Newman, M. E. J. Equivalence between modularity optimization and maximum likelihood methods for community detection. Phys. Rev. E 94, 052315 (2016)

    work page 2016

  52. [52]

    & Zdeborová, L

    Decelle, A., Krzakala, F., Moore, C. & Zdeborová, L. Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Phys. Rev. E 84, 066106 (2011)

    work page 2011

  53. [53]

    & Liu, Z

    Ji, J., Zhang, A., Liu, C., Quan, X. & Liu, Z. Survey: Functional module detection from protein-protein interaction networks. IEEE Trans. Knowl. Data Eng. 26, 261–277 (2014)

    work page 2014

  54. [54]

    & Bornholdt, S

    Reichardt, J. & Bornholdt, S. Statistical mechanics of community detection. Phys. Rev. E 74, 016110 (2006)

    work page 2006

  55. [55]

    & Radicchi, F

    Faqeeh, A., Osat, S. & Radicchi, F. Characterizing the analogy between hyperbolic embedding and community structure of complex networks. Phys. Rev. Lett. 121, 098301 (2018)

    work page 2018

  56. [56]

    & Lambiotte, R

    Salnikov, V ., Cassese, D. & Lambiotte, R. Simplicial complexes and complex systems.Eur . J. Phys.40, 014001 (2018)

    work page 2018

  57. [57]

    & Yau, S.-T

    Lin, Y ., Lu, L. & Yau, S.-T. Ricci curvature of graphs.Tohoku Math. J. 63, 605–627 (2011)

    work page 2011

  58. [58]

    KONECT: The koblenz network collection

    Kunegis, J. KONECT: The koblenz network collection. In Proceedings of the 22Nd International Conference on World Wide Web, WWW ’13 Companion, 1343–1350 (ACM, New York, NY , USA, 2013)

    work page 2013

  59. [59]

    & Krevl, A

    Leskovec, J. & Krevl, A. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data (2014)

    work page 2014

  60. [60]

    Kantorovich, L. V . On the translocation of masses. InDokl. Akad. Nauk. USSR (NS) , vol. 37, 199–201 (1942)

    work page 1942

  61. [61]

    A unique decomposition theorem for 3-manifolds

    Milnor, J. A unique decomposition theorem for 3-manifolds. Amer . J. Math.84, 1–7 (1962)

    work page 1962

  62. [62]

    & Shalen, P

    Jaco, W. & Shalen, P. B. SEIFERT FIBERED SPACES IN 3-MANIFOLDS. In Cantrell, J. C. (ed.) Geometric Topology, 91–99 (Academic Press, 1979)

    work page 1979

  63. [63]

    Homotopy Equivalences of 3-Manifolds with Boundaries (Springer, 2006)

    Johannson, K. Homotopy Equivalences of 3-Manifolds with Boundaries (Springer, 2006)

    work page 2006

  64. [64]

    Thurston, W. P. Three dimensional manifolds, kleinian groups and hyperbolic geometry. Bull. Am. Math. Soc. 6, 357–382 (1982)

    work page 1982

  65. [65]

    Ricci flow and the poincaré conjecture

    Morgan, G., John; Tian. Ricci flow and the poincaré conjecture. Clay Math. Monogr. 3, 521 (2007)

    work page 2007

  66. [66]

    Spanier, E. H. Algebraic topology. (1966)

    work page 1966

  67. [67]

    Sinkhorn distances: Lightspeed computation of optimal transport

    Cuturi, M. Sinkhorn distances: Lightspeed computation of optimal transport. In Burges, C. J. C., Bottou, L., Welling, M., Ghahramani, Z. & Weinberger, K. Q. (eds.)Advances in Neural Information Processing Systems 26 , 2292–2300 (Curran Associates, Inc., 2013)

    work page 2013

  68. [68]

    Rand, W. M. Objective criteria for the evaluation of clustering methods. J. Am. Stat. association 66, 846–850 (1971)

    work page 1971

  69. [69]

    & Barthélemy, M

    Fortunato, S. & Barthélemy, M. Resolution limit in community detection. Proc. Natl. Acad. Sci. U. S. A. 104, 36–41 (2007). 29/29

    work page 2007