pith. sign in

arxiv: 2605.19835 · v1 · pith:2BOUK4K2new · submitted 2026-05-19 · 🧮 math.PR

Reemergence of the Epidemic Threshold in SIRS Infections on Connected Stars

Andreas G\"obel , Nicolas Klodt , Martin S. Krejca This is my paper

Pith reviewed 2026-05-20 02:06 UTC · model grok-4.3

classification 🧮 math.PR
keywords SIRS processepidemic thresholdstar graphscomplex networksinfection survival timehyperbolic random graphsepidemic models
0
0 comments X

The pith

A network of poly-logarithmically many connected polynomial-sized stars lets the SIRS process survive super-polynomially long.

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

The paper shows that the SIRS infection process, which includes a recovered immune state, has only polynomial survival time on an isolated star but achieves super-polynomial survival on a collection of poly-logarithmically many large stars linked together. This matters because prior results tied long-term SIRS epidemics to strong expansion in the host graph, while the related SIS process already persists on single stars; the new construction demonstrates that expansion is not required and that sparse star-like substructures suffice for endemic behavior. The authors further establish that such star networks arise in standard complex-network models and supply explicit epidemic thresholds for each, including a comparison on hyperbolic random graphs where the star-based threshold is sometimes more permissive than the expansion-based one.

Core claim

While the SIRS process does not survive super-polynomially long on a single star, it does so on a network of poly-logarithmic (in the total number of vertices) stars of polynomial size. This reemerges the epidemic threshold in SIRS infections on graphs containing these connected star substructures, which the paper shows appear in popular complex network models and yield concrete bounds on the infection rate needed for long-term persistence.

What carries the argument

A collection of poly-logarithmically many polynomial-sized stars connected so that infection can transfer between centers before immunity expires, serving as the minimal substructure that produces super-polynomial survival time.

If this is right

  • Such star substructures appear in standard complex-network models and directly supply bounds on the epidemic threshold for each model.
  • On hyperbolic random graphs the connected-stars threshold can be more permissive than the earlier expansion-based threshold, depending on the power-law exponent and the duration of immunity.
  • SIRS exhibits epidemic behavior on non-expander graphs whose only dense parts are these modest collections of linked stars.

Where Pith is reading between the lines

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

  • Many real networks whose connectivity is dominated by hubs may therefore sustain temporary-immunity infections longer than expander analyses predict.
  • Determining the exact minimal number and placement of edges among the stars that still trigger super-polynomial survival would tighten the result.
  • The same star-network mechanism may govern persistence thresholds in other compartmental models that feature a finite immune period.

Load-bearing premise

The host graph must contain a substructure of poly-logarithmically many polynomial-sized stars that are connected in a way permitting infection to move between them before recovered vertices lose immunity.

What would settle it

Simulate the continuous-time SIRS process on an isolated star of size n versus on log n stars of size n^c linked by a small number of edges, and check whether survival time stays polynomial or becomes super-polynomial above the stated infection-rate threshold.

read the original abstract

The SIRS process is a continuous-time process for how infections spread on a graph. In this model, each vertex is in one of the following three states: susceptible (to the infection; S), infected (I), or recovered (R) and thus immune to the infection. For each vertex, the transition among these states is exponentially distributed according to the parameters of the process. It was recently shown that recovered vertices effectively stop the infection on stars, that is, the expected survival time of SIRS processes on stars is bounded from above by a polynomial in the number of the vertices, independently of the infection rate of the process. The setting where the process has, so far, been shown to exhibit epidemic behavior, i.e., super-polynomial survival time when the infection rate is above some threshold value, requires the host graph to be an expander. This is in contrast to the shown behavior of the well-studied SIS process, a related model in which vertices never transition to R, and in which even sparsely connected graphs, in particular stars, exhibit epidemic behavior. In this work, we show that expansion of the host graph is not a necessary condition for the SIRS process to result in an epidemic. Our main technical contribution shows that, while the SIRS process does not survive super-polynomially long on a single star, it does so on a network of poly-logarithmic (in the total number of vertices) stars of polynomial size. In addition, we show that such substructures appear in popular complex network models, providing for each a bound on the epidemic threshold. In particular, on hyperbolic random graphs, we compare our threshold for connected stars with the previously known one based on expansion, finding that both of them can be more permissive depending on the graph's power-law exponent and the rate that determines how long immunity lasts.

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

2 major / 2 minor

Summary. The paper studies the continuous-time SIRS epidemic process on graphs. It recalls that the expected survival time on a single star is at most polynomial in the number of vertices, independent of the infection rate. The central technical claim is that the process exhibits super-polynomial survival time on a host graph consisting of polylogarithmically many (in total vertices n) polynomial-sized stars that are suitably connected. The manuscript further shows that such substructures appear in standard complex-network models and derives explicit epidemic-threshold bounds for each, including a comparison on hyperbolic random graphs between the connected-stars threshold and the previously known expansion-based threshold.

Significance. If the central claims hold, the work shows that global expansion is not required for super-polynomial persistence of SIRS, in contrast to prior results. The identification of a weaker, local structural condition (connected stars) that suffices for epidemic behavior supplies a mechanism that is plausibly present in many real-world networks. The explicit threshold comparisons on hyperbolic random graphs, parameterized by the power-law exponent and the immunity duration, give concrete, falsifiable predictions that distinguish regimes in which the new threshold is more permissive than the expander threshold.

major comments (2)
  1. [§4] §4 (Construction and survival proof): the transmission step between stars requires that an active star infects a second star before its own local extinction (which occurs in polynomial time). The manuscript defines the required inter-star links only as 'suitably connected' without stating the minimal deterministic or probabilistic condition (e.g., existence of a matching on centers with positive probability bounded away from zero, or an expander on the centers). This interface is load-bearing for the super-polynomial survival claim.
  2. [§5.3] §5.3 (Hyperbolic random graphs): the existence of the required star substructure is established, yet the probability that the inter-star edges satisfy the connectivity condition used in the survival proof is not shown to be 1-o(1) uniformly over the parameter range where the threshold comparison is claimed. If this probability tends to zero for some exponents, the embedding argument does not deliver the stated epidemic threshold.
minor comments (2)
  1. [Abstract] Abstract, line 12: the statement that survival on a single star is 'bounded from above by a polynomial ... independently of the infection rate' should specify the precise range of recovery and immunity rates for which the polynomial bound holds.
  2. [§2] Notation: the symbols used for the infection, recovery, and immunity rates are introduced without a consolidated table; a short parameter table in §2 would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. The observations on the need for an explicit connectivity condition in the star construction and the probabilistic verification for hyperbolic random graphs are helpful. We address each point below and will revise the manuscript accordingly to strengthen the presentation and proofs.

read point-by-point responses

  1. Referee: [§4] §4 (Construction and survival proof): the transmission step between stars requires that an active star infects a second star before its own local extinction (which occurs in polynomial time). The manuscript defines the required inter-star links only as 'suitably connected' without stating the minimal deterministic or probabilistic condition (e.g., existence of a matching on centers with positive probability bounded away from zero, or an expander on the centers). This interface is load-bearing for the super-polynomial survival claim.

    Authors: We agree that the connectivity condition must be stated explicitly, as it is essential for the transmission argument. In the revised version we will replace the informal phrase 'suitably connected' with a precise definition: the centers of the stars induce a graph that contains a matching of size at least a positive constant fraction of the number of stars, or equivalently satisfies a uniform expansion property with expansion factor bounded away from zero independently of n. Under this condition the probability that an active star transmits the infection to at least one other star before local extinction is bounded below by a positive constant. We will insert the formal definition at the beginning of Section 4 and add a short lemma that converts this constant-probability transmission into the claimed super-polynomial survival time. This change directly addresses the load-bearing interface without altering the overall argument. revision: yes

  2. Referee: [§5.3] §5.3 (Hyperbolic random graphs): the existence of the required star substructure is established, yet the probability that the inter-star edges satisfy the connectivity condition used in the survival proof is not shown to be 1-o(1) uniformly over the parameter range where the threshold comparison is claimed. If this probability tends to zero for some exponents, the embedding argument does not deliver the stated epidemic threshold.

    Authors: The referee correctly identifies a missing step. While the manuscript shows that the star substructures themselves appear with high probability, it does not yet verify that the induced center graph satisfies the expander/matching condition with probability 1-o(1) uniformly in the claimed parameter regime. In the revision we will add a dedicated lemma that uses the explicit edge-probability formulas for hyperbolic random graphs to prove that, for all power-law exponents and immunity durations in the range where the connected-stars threshold is asserted to be more permissive than the expansion threshold, the required connectivity holds with probability 1-o(1). If the analysis reveals that the statement fails on a measure-zero set of boundary parameters, we will restrict the comparison statement accordingly. This addition will make the embedding argument complete. revision: partial

Circularity Check

0 steps flagged

No significant circularity; central claims rest on direct Markov analysis of constructed star networks.

full rationale

The paper derives super-polynomial survival of the SIRS process by explicit analysis of the continuous-time Markov chain on a host graph consisting of polylogarithmically many polynomial-sized stars with specified inter-star connections. The main technical result bounds the extinction time from below on this deterministic construction, and the embedding into complex-network models (hyperbolic random graphs, etc.) is shown by separate probabilistic arguments that do not rely on fitting parameters to the target survival time or on self-citations whose validity is presupposed by the present work. No equation or theorem reduces the claimed epidemic threshold to a quantity defined in terms of itself or to a fitted input renamed as a prediction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on the standard continuous-time Markov chain definition of SIRS with exponential waiting times and on the existence of specific star substructures in the host graph.

axioms (1)
  • domain assumption Infection, recovery, and loss-of-immunity transitions occur at exponential rates.
    Standard modeling assumption for continuous-time epidemic processes on graphs.

pith-pipeline@v0.9.0 · 5877 in / 1207 out tokens · 34029 ms · 2026-05-20T02:06:19.672467+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]

    2005 , journal =

    On the spread of viruses on the internet , author =. 2005 , journal =

    work page 2005

  2. [2]

    Random Structures & Algorithms , volume =

    How to distribute antidote to control epidemics , author =. Random Structures & Algorithms , volume =. 2010 , publisher =

    work page 2010

  3. [3]

    ACM Transactions on Information and System Security (TISSEC) , volume =

    Epidemic thresholds in real networks , author =. ACM Transactions on Information and System Security (TISSEC) , volume =. 2008 , publisher =

    work page 2008

  4. [4]

    Journal of Nonlinear Systems and Applications , volume =

    VIRUSLIKE DYNAMICS ON STARLIKE GRAPHS , author =. Journal of Nonlinear Systems and Applications , volume =

    work page

  5. [5]

    IEEE/ACM Transactions On Networking , volume =

    Virus spread in networks , author =. IEEE/ACM Transactions On Networking , volume =. 2008 , publisher =

    work page 2008

  6. [6]

    Proceedings of IEEE Infocom '05 , volume =

    The effect of network topology on the spread of epidemics , author =. Proceedings of IEEE Infocom '05 , volume =

    work page

  7. [7]

    EPL (Europhysics Letters) , volume =

    Discrete-time Markov chain approach to contact-based disease spreading in complex networks , author =. EPL (Europhysics Letters) , volume =. 2010 , publisher =

    work page 2010

  8. [8]

    IEEE Control Systems Magazine , volume =

    Analysis and control of epidemics: A survey of spreading processes on complex networks , author =. IEEE Control Systems Magazine , volume =. 2016 , publisher =

    work page 2016

  9. [9]

    Reviews of modern physics , volume =

    Epidemic processes in complex networks , author =. Reviews of modern physics , volume =. 2015 , publisher =

    work page 2015

  10. [10]

    Physical review E , volume =

    Spread of epidemic disease on networks , author =. Physical review E , volume =. 2002 , publisher =

    work page 2002

  11. [11]

    52nd IEEE conference on decision and control , pages =

    Optimal vaccine allocation to control epidemic outbreaks in arbitrary networks , author =. 52nd IEEE conference on decision and control , pages =. 2013 , organization =

    work page 2013

  12. [12]

    IEEE Transactions on Control of Network Systems , volume =

    Optimal resource allocation for network protection against spreading processes , author =. IEEE Transactions on Control of Network Systems , volume =. 2014 , publisher =

    work page 2014

  13. [13]

    IEEE Transactions on Network Science and Engineering , volume =

    An efficient curing policy for epidemics on graphs , author =. IEEE Transactions on Network Science and Engineering , volume =. 2014 , publisher =

    work page 2014

  14. [14]

    Journal of the ACM (JACM) , volume =

    Amplifiers for the Moran process , author =. Journal of the ACM (JACM) , volume =. 2017 , publisher =

    work page 2017

  15. [15]

    ACM SIGMETRICS Performance Evaluation Review , volume =

    The behavior of epidemics under bounded susceptibility , author =. ACM SIGMETRICS Performance Evaluation Review , volume =. 2014 , publisher =

    work page 2014

  16. [16]

    IEEE INFOCOM 2014-IEEE Conference on Computer Communications , pages =

    Epidemic thresholds with external agents , author =. IEEE INFOCOM 2014-IEEE Conference on Computer Communications , pages =. 2014 , organization =

    work page 2014

  17. [17]

    preprint , year =

    Analyzing Two Competing Epidemic Processes-The Power of Influential Nodes , author =. preprint , year =

    work page

  18. [18]

    Fixed speed competition on the configuration model with infinite variance degrees: equal speeds

    Fixed speed competition on the configuration model with infinite variance degrees: equal speeds , author =. arXiv preprint arXiv:1503.09046 , year =

    work page internal anchor Pith review Pith/arXiv arXiv

  19. [19]

    SIAM Journal on Applied Mathematics , volume =

    Global stability of virus spreading in complex heterogeneous networks , author =. SIAM Journal on Applied Mathematics , volume =. 2008 , publisher =

    work page 2008

  20. [20]

    Journal of mathematical biology , volume =

    Vaccination based control of infections in SIRS models with reinfection: special reference to pertussis , author =. Journal of mathematical biology , volume =. 2013 , publisher =

    work page 2013

  21. [21]

    arXiv preprint arXiv:2007.08047 , year =

    Heterogeneity Learning for SIRS model: an Application to the COVID-19 , author =. arXiv preprint arXiv:2007.08047 , year =

    work page arXiv 2007

  22. [22]

    Physica A: Statistical Mechanics and its Applications , volume =

    Epidemic threshold for the SIRS model on the networks , author =. Physica A: Statistical Mechanics and its Applications , volume =. 2019 , publisher =

    work page 2019

  23. [23]

    Communications in Nonlinear Science and Numerical Simulation , volume =

    Analysis of epidemic spreading of an SIRS model in complex heterogeneous networks , author =. Communications in Nonlinear Science and Numerical Simulation , volume =. 2014 , publisher =

    work page 2014

  24. [24]

    Global dynamics of an SIRS model with demographics and transfer from infectious to susceptible on heterogeneous networks , author =. Math. Biosci. Eng , volume =

    work page

  25. [25]

    Physica A: Statistical Mechanics and its Applications , volume =

    The optimal dynamic immunization under a controlled heterogeneous node-based SIRS model , author =. Physica A: Statistical Mechanics and its Applications , volume =. 2016 , publisher =

    work page 2016

  26. [26]

    Applied Mathematics-A Journal of Chinese Universities , volume =

    An SIRS epidemic model , author =. Applied Mathematics-A Journal of Chinese Universities , volume =. 2004 , publisher =

    work page 2004

  27. [27]

    Chaos, Solitons & Fractals , volume =

    Stability of a delayed SIRS epidemic model with a nonlinear incidence rate , author =. Chaos, Solitons & Fractals , volume =. 2009 , publisher =

    work page 2009

  28. [28]

    2009 International Conference on Computational Intelligence and Software Engineering , pages =

    An improved SIRS epidemic model on complex network , author =. 2009 International Conference on Computational Intelligence and Software Engineering , pages =. 2009 , organization =

    work page 2009

  29. [29]

    Soft Computing , volume =

    Epidemic spreading on a complex network with partial immunization , author =. Soft Computing , volume =. 2018 , publisher =

    work page 2018

  30. [30]

    Applied Mathematics Letters , volume =

    Lyapunov functions and global stability for SIR, SIRS, and SIS epidemiological models , author =. Applied Mathematics Letters , volume =. 2002 , publisher =

    work page 2002

  31. [31]

    The Annals of Probability , volume =

    Contact processes on random graphs with power law degree distributions have critical value 0 , author =. The Annals of Probability , volume =. 2009 , publisher =

    work page 2009

  32. [32]

    arXiv preprint arXiv:2004.01149 , year =

    Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs , author =. arXiv preprint arXiv:2004.01149 , year =

    work page arXiv 2004

  33. [33]

    Journal of Computer and System Sciences , volume =

    Temporal cliques admit sparse spanners , author =. Journal of Computer and System Sciences , volume =. 2021 , publisher =

    work page 2021

  34. [34]

    Physical Review E , volume =

    Epidemic thresholds of the susceptible-infected-susceptible model on networks: A comparison of numerical and theoretical results , author =. Physical Review E , volume =. 2012 , publisher =

    work page 2012

  35. [35]

    The Annals of Probability , volume =

    Survival and extinction of epidemics on random graphs with general degree , author =. The Annals of Probability , volume =. 2021 , publisher =

    work page 2021

  36. [36]

    2009 , publisher =

    Computational complexity: a modern approach , author =. 2009 , publisher =

    work page 2009

  37. [37]

    SIAM Journal on Discrete Mathematics , author =

    Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs , doi =. SIAM Journal on Discrete Mathematics , author =

    work page

  38. [38]

    2019 , issn =

    Geometric inhomogeneous random graphs , journal =. 2019 , issn =. doi:https://doi.org/10.1016/j.tcs.2018.08.014 , author =

    work page doi:10.1016/j.tcs.2018.08.014 2019

  39. [39]

    Random Structures & Algorithms , author =

    Cover and hitting times of hyperbolic random graphs , doi =. Random Structures & Algorithms , author =

    work page

  40. [40]

    2020 , issn =

    Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs , journal =. 2020 , issn =. doi:https://doi.org/10.1016/j.spa.2019.04.014 , author =

    work page doi:10.1016/j.spa.2019.04.014 2020

  41. [41]

    arXiv preprint arXiv:2501.12170 , year =

    Gradually declining immunity retains the exponential duration of immunity-free diffusion , author =. arXiv preprint arXiv:2501.12170 , year =

    work page arXiv

  42. [42]

    Krejca and Marcus Pappik , booktitle =

    Andreas Göbel and Nicolas Klodt and Martin S. Krejca and Marcus Pappik , booktitle =. Resistance is futile: Gradually declining immunity retains the exponential duration of immunity-free diffusion , pages =. 2025 , optdoi =

    work page 2025

  43. [43]

    Krejca and Marcus Pappik , title =

    Tobias Friedrich and Andreas G\"obel and Nicolas Klodt and Martin S. Krejca and Marcus Pappik , title =. Electronic Journal of Probability , year =

    work page

  44. [44]

    Proceedings of ICWSM '23 , pages =

    Social influence-maximizing group recommendation , author =. Proceedings of ICWSM '23 , pages =

    work page

  45. [45]

    Proceedings of ICWSM '23 , year =

    Retweet-BERT: Political leaning detection using language features and information diffusion on social networks , author =. Proceedings of ICWSM '23 , year =

    work page

  46. [46]

    Proceedings of AAAI '23 , year =

    Human mobility modeling during the COVID-19 pandemic via Deep Graph Diffusion Infomax , author =. Proceedings of AAAI '23 , year =

    work page

  47. [47]

    Proceedings of AAAI '22 , year =

    MS-HGAT: Memory-enhanced sequential hypergraph attention network for information diffusion prediction , author =. Proceedings of AAAI '22 , year =

    work page

  48. [48]

    Journal of King Saud University -- Computer and Information Sciences , volume =

    State-of-art review of information diffusion models and their impact on social network vulnerabilities , author =. Journal of King Saud University -- Computer and Information Sciences , volume =

    work page

  49. [49]

    Proceedings of ICWSM '21 , year =

    Network inference from a mixture of diffusion models for fake news mitigation , author =. Proceedings of ICWSM '21 , year =

    work page

  50. [50]

    Proceedings KDD '03 , pages =

    Maximizing the spread of influence through a social network , author =. Proceedings KDD '03 , pages =

    work page

  51. [51]

    Reviews of Modern Physics , volume =

    Epidemic processes in complex networks , author =. Reviews of Modern Physics , volume =. 2015 , optdoi =

    work page 2015

  52. [52]

    Proceedings of KDD '07 , pages =

    Cost-effective outbreak detection in networks , author =. Proceedings of KDD '07 , pages =

    work page

  53. [53]

    Random Structures & Algorithms , volume =

    Christian Borgs and Jennifer Chayes and Ayalvadi Ganesh and Amin Saberi , title =. Random Structures & Algorithms , volume =. 2010 , optdoi =

    work page 2010

  54. [54]

    An Introduction to Probability Theory and its Applications , edition =

    Feller, William , year =. An Introduction to Probability Theory and its Applications , edition =

    work page

  55. [55]

    Physical Review E , volume =

    Collective versus hub activation of epidemic phases on networks , author =. Physical Review E , volume =. 2016 , optdoi =

    work page 2016

  56. [56]

    Transactions of the American Mathematical Society , volume =

    Critical value asymptotics for the contact process on random graphs , author =. Transactions of the American Mathematical Society , volume =. 2022 , optdoi =

    work page 2022

  57. [57]

    2017 , publisher =

    Yi Wang and Jinde Cao and Ahmed Alsaedi and Tasawar Hayat , title =. 2017 , publisher =

    work page 2017

  58. [58]

    Physical Review Letters , volume =

    Small world effect in an epidemiological model , author =. Physical Review Letters , volume =. 2001 , optdoi =

    work page 2001

  59. [59]

    Knowledge and Information Systems , volume =

    Threshold conditions for arbitrary cascade models on arbitrary networks , author =. Knowledge and Information Systems , volume =. 2012 , publisher =

    work page 2012

  60. [60]

    The European Physical Journal B (EPJB) , year =

    Bancal, Jean-Daniel and Pastor-Satorras, Romualdo , title =. The European Physical Journal B (EPJB) , year =

    work page

  61. [61]

    38th Annual AAAI Conference on Artificial Intelligence , pages =

    The Irrelevance of Influencers: Information Diffusion with Re-Activation and Immunity Lasts Exponentially Long on Social Network Models , author =. 38th Annual AAAI Conference on Artificial Intelligence , pages =

    work page

  62. [62]

    Physical Review E—Statistical, Nonlinear, and Soft Matter Physics , volume =

    Hyperbolic geometry of complex networks , author =. Physical Review E—Statistical, Nonlinear, and Soft Matter Physics , volume =. 2010 , publisher =

    work page 2010

  63. [63]

    Theoretical Computer Science , volume =

    Geometric inhomogeneous random graphs , author =. Theoretical Computer Science , volume =. 2019 , publisher =

    work page 2019

  64. [64]

    Random Structures & Algorithms , volume =

    The phase transition in inhomogeneous random graphs , author =. Random Structures & Algorithms , volume =. 2007 , publisher =

    work page 2007

  65. [65]

    Science , volume =

    Emergence of scaling in random networks , author =. Science , volume =. 1999 , publisher =

    work page 1999

  66. [66]

    Proceedings of ICALP '12 , pages =

    Random hyperbolic graphs: degree sequence and clustering , author =. Proceedings of ICALP '12 , pages =. 2012 , organization =

    work page 2012

  67. [67]

    Algorithmica , volume =

    Cliques in hyperbolic random graphs , author =. Algorithmica , volume =. 2018 , publisher =

    work page 2018

  68. [68]

    Proceedings of the National Academy of Sciences , volume =

    The average distances in random graphs with given expected degrees , author =. Proceedings of the National Academy of Sciences , volume =. 2002 , publisher =

    work page 2002

  69. [69]

    arXiv preprint arXiv:2412.21138 , year =

    Optimal bound for survival time of the SIRS process on star graphs , author =. arXiv preprint arXiv:2412.21138 , year =

    work page arXiv