Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 44 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 208 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

On the evolution of random graphs on spaces of negative curvature (1205.2923v1)

Published 14 May 2012 in math.CO, cs.DM, and math.PR

Abstract: In this work, we study a family of random geometric graphs on hyperbolic spaces. In this setting, N points are chosen randomly on a hyperbolic space and any two of them are joined by an edge with probability that depends on their hyperbolic distance, independently of every other pair. In particular, when the positions of the points have been fixed, the distribution over the set of graphs on these points is the Boltzmann distribution, where the Hamiltonian is given by the sum of weighted indicator functions for each pair of points, with the weight being proportional to a real parameter \beta>0 (interpreted as the inverse temperature) as well as to the hyperbolic distance between the corresponding points. This class of random graphs was introduced by Krioukov et al. We provide a rigorous analysis of aspects of this model and its dependence on the parameter \beta, verifying some of their observations. We show that a phase transition occurs around \beta =1. More specifically, we show that when \beta > 1 the degree of a typical vertex is bounded in probability (in fact it follows a distribution which for large values exhibits a power-law tail whose exponent depends only on the curvature of the space), whereas for \beta <1 the degree is a random variable whose expected value grows polynomially in N. When \beta = 1, we establish logarithmic growth. For the case \beta > 1, we establish a connection with a class of inhomogeneous random graphs known as the Chung-Lu model. Assume that we use the Poincar\'e disc representation of a hyperbolic space. If we condition on the distance of each one of the points from the origin, then the probability that two given points are adjacent is expressed through the kernel of this inhomogeneous random graph.

Citations (16)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube