Janosch Ruff
YOU?
Author Swipe
View article: On Distributed Colouring of Hyperbolic Random Graphs
On Distributed Colouring of Hyperbolic Random Graphs Open
We analyse the performance of simple distributed colouring algorithms under the assumption that the input graph is a hyperbolic random graph (HRG), a generative model capturing key properties of real-world networks such as power-law degree…
View article: Strategic Network Creation for Enabling Greedy Routing
Strategic Network Creation for Enabling Greedy Routing Open
Today we rely on networks that are created and maintained by smart devices. For such networks, there is no governing central authority but instead the network structure is shaped by the decisions of selfish intelligent agents. A key proper…
View article: Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring Open
Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient. Other properties like a giant component, the small world p…
View article: Strategic Network Creation for Enabling Greedy Routing
Strategic Network Creation for Enabling Greedy Routing Open
Today we rely on networks that are created and maintained by smart devices. For such networks, there is no governing central authority but instead the network structure is shaped by the decisions of selfish intelligent agents. A key proper…
View article: On the Giant Component of Geometric Inhomogeneous Random Graphs
On the Giant Component of Geometric Inhomogeneous Random Graphs Open
In this paper we study the threshold model of \emph{geometric inhomogeneous random graphs} (GIRGs); a generative random graph model that is closely related to \emph{hyperbolic random graphs} (HRGs). These models have been observed to captu…