90 citations · 144 across the 12 of their papers we have counts for
12 papers
Uncovering the network geometry of green bonds
Xinyue Zhang, Alexander P. Kartun-Giles
With the rapid growth of the green bond market amid increasing emphasis on sustainable development, understanding its structural properties and potential systemic risks has become…
An Introduction to Complex Networks in Climate Finance
Alexander P. Kartun-Giles, Nadia Ameli
In this perspective, we introduce recent research into the structure and function of complex investor networks supporting sustainability efforts. Using the case of solar, wind and…
Connectivity of 1d random geometric graphs
Alexander P. Kartun-Giles, Kostas Koufos, Nicolas Privault
A 1d random geometric graph (1d RGG) is built by joining a random sample of points from an interval of the real line with probability . We count the number of -hop paths…
Two-Hop Connectivity to the Roadside in a VANET Under the Random Connection Model
Alexander P. Kartun-Giles, Konstantinos Koufos, Xiao Lu +1
In this paper, we compute the expected number of vehicles with at least one two-hop path to a fixed roadside unit (RSU) in a multi-hop, one-dimensional vehicular ad hoc network (VA…
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…
Sparse power-law network model for reliable statistical predictions based on sampled data
A. P. Kartun-Giles, D. Krioukov, J. P. Gleeson +2
A projective network model is a model that enables predictions to be made based on a subsample of the network data, with the predictions remaining unchanged if a larger sample is t…
Counting k-Hop Paths in the Random Connection Model
Alexander P. Kartun-Giles, Sunwoo Kim
We study, via combinatorial enumeration, the probability of k-hop connection between two nodes in a wireless multi-hop network. This addresses the difficulty of providing an exact…
Counting Geodesic Paths in 1D VANETs
Georgie Knight, Alexander P. Kartun-Giles, Orestis Georgiou +1
In the IEEE 802.11p standard addressing vehicular communications, Basic Safety Messages (BSMs) can be bundled together and relayed as to increase the effective communication range…
Connectivity and Centrality in Dense Random Geometric Graphs
Alexander P. Kartun-Giles
Due to shorter range communication becoming more prevalent with the development of multiple-input, multiple-output antennas (MIMO) and millimeter wave communications, multi-hop, in…