Breadcrumb

Random hyperbolic graphs: degree distribution and clustering

Thu 24 January 2013, 16:30

Nikolaos Fountoulakis
Birmingham

Combinatorics

Organisers: Tom McCourt, Tony Nixon, Karen Gunderson

ABSTRACT
Random geometric graphs have been studied over the last 50 years in great detail. These are graphs that are formed between points randomly allocated on a Euclidean space and any two of them are joined if they are close enough. However, all this theory has been developed when the underlying space is equipped with the Euclidean metric. But, what if the underlying space is curved? Our focus will be on the case where the underlying space is a hyperbolic space. We will discuss the typical degree distribution of these random graphs as well as issues related to clustering and triangle counts.

This is joint work with E. Candellero