90 citations · 144 across the 12 of their papers we have counts for
4 papers · 1 filter
Euclidean Matchings in Ultra-Dense Networks
Alexander P. Kartun-Giles, Suhanya Jayaprakasam, Sunwoo Kim
In order to study the fundamental limits of network densification, we look at the spatial spectral efficiency gain achieved when densely deployed communication devices embedded in…
Meta Distribution of SIR in the Internet of Things Modelled as a Euclidean Matching
Alexander P. Kartun-Giles, Konstantinos Koufos, Sunwoo Kim
The Poisson bipolar model considers user-base station pairs distributed at random on a flat domain, similar to matchsticks scattered onto a table. Though this is a simple and tract…
The shape of shortest paths in random spatial networks
Alexander P. Kartun-Giles, Marc Barthelemy, Carl P. Dettmann
In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance , geodesics exhibit deviations from their mean length that are of…
Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks
Alexander P. Kartun-Giles, Ginestra Bianconi
In Network Science node neighbourhoods, also called ego-centered networks have attracted large attention. In particular the clustering coefficient has been extensively used to meas…