Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the largest component of subcritical random hyperbolic graphs

Published 4 Mar 2020 in math.PR | (2003.02156v1)

Abstract: We consider the random hyperbolic graph model introduced by [KPK + 10] and then formalized by [GPP12]. We show that, in the subcritical case $\alpha$ > 1, the size of the largest component is n{1/(2$\alpha$)+o(1)} , thus strengthening a result of [BFM15] which gave only an upper bound of n{1/$\alpha$+o(1)}.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Dieter Mitsche 
  2. Roland Diel 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up