A Bound for the Diameter of Random Hyperbolic Graphs

@inproceedings{Kiwi2015ABF,
  title={A Bound for the Diameter of Random Hyperbolic Graphs},
  author={Marcos A. Kiwi and Dieter Mitsche},
  booktitle={ANALCO},
  year={2015}
}
Random hyperbolic graphs were recently introduced by Krioukov et. al. [KPK10] as a model for large networks. Gugelmann, Panagiotou, and Peter [GPP12] then initiated the rigorous study of random hyperbolic graphs using the following model: for α > 1 2 , C ∈ R, n ∈ N, set R = 2 lnn + C and build the graph G = (V,E) with |V | = n as follows: For each v ∈ V , generate i.i.d. polar coordinates (rv, θv) using the joint density function f(r, θ), with θv chosen uniformly from [0, 2π) and rv with… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
13 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Clustering in random geometric graphs on the hyperbolic plane

  • E. Candellero, N. Fountoulakis
  • ArXiv e-prints,
  • 2013

On the giant component of random hyperbolic graphs

  • M. Bode, N. Fountoulakis, T. Müller
  • In Proceedings of the 7th European Conference on…
  • 2013

Random Geometric Graphs

  • M. Penrose
  • Oxford Studies in Probability, Oxford U. P.,
  • 2003

Similar Papers

Loading similar papers…