AKAlexander P. Kartun-Giles

Alexander P. Kartun-Giles

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Alexander P. Kartun-Giles has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Introduction to Complex Networks in Climate Finance

    by 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 hydro energy technologies, this perspective explores the complexity in low-carbon finance markets, defined as markets that direct capital flows towards low-carbon technologies, using network approaches to study their structure and dynamics. Investors are modeled as nodes which form a network or higher-order network connected by edges representing projects in which joint funding or security-related insurance was provided or other investment-related interaction occurred. We review the literature on investor networks generally, particularly in the case of complex networks, and address areas where these ideas were applied in this emerging field. The complex investor dynamics which emerge from the extant funding scenarios are not well understood. These dynamics have the potential to result in interesting non-linear behaviour, growth, and decline, which can be studied, explained and controlled using the tools of network science.


  • Two-Hop Connectivity to the Roadside in a VANET Under the Random Connection Model

    by Alexander P. Kartun-Giles, Konstantinos Koufos, Xiao Lu, Dusit Niyato

    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 (VANET) where other cars can act as relays. The pairwise channels experience Rayleigh fading in the random connection model, and so exist, with probability function of the mutual distance between the cars, or between the cars and the RSU. We derive exact equivalents for the expected number of cars with a two-hop connection to the RSU when the car density $\rho$ tends to zero and infinity, and determine its behaviour using an infinite oscillating power series in $\rho$ , which is accurate for all regimes. We also corroborate those findings to a realistic situation, using snapshots of actual traffic data. Finally, a normal approximation is discussed for the probability mass function of the number of cars with a two-hop connection to the RSU.


  • Shape of shortest paths in random spatial networks

    by 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 L, geodesics exhibit deviations from their mean length L that are of order Lχ, while the transversal fluctuations, known as wandering, grow as Lξ. We find that when weighting edges directly with their Euclidean span in various spatial network models, we have two distinct classes defined by different exponents ξ=3/5 and χ=1/5, or ξ=7/10 and χ=2/5, depending only on coarse details of the specific connectivity laws used. Also, the travel-time fluctuations are Gaussian, rather than Tracy-Widom, which is rarely seen in first-passage models. The first class contains proximity graphs such as the hard and soft random geometric graph, and the k-nearest neighbor random geometric graphs, where via Monte Carlo simulations we find ξ=0.60±0.01 and χ=0.20±0.01, showing a theoretical minimal wandering. The second class contains graphs based on excluded regions such as β skeletons and the Delaunay triangulation and are characterized by the values ξ=0.70±0.01 and χ=0.40±0.01, with a nearly theoretically maximal wandering exponent. We also show numerically that the so-called Kardar-Parisi-Zhang (KPZ) relation χ=2ξ−1 is satisfied for all these models. These results shed some light on the Euclidean first-passage process but also raise some theoretical questions about the scaling laws and the derivation of the exponent values and also whether a model can be constructed with maximal wandering, or non-Gaussian travel fluctuations, while embedded in space.


  • Open Access

    Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks

    by 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 measure their local cohesiveness. In this paper, we show how, given two nodes with the same clustering coefficient, the topology of their neighbourhoods can be significantly different, which demonstrates the need to go beyond this simple characterization. We perform a large scale statistical analysis of the topology of node neighbourhoods of real networks by first constructing their clique complexes, and then computing their Betti numbers. We are able to show significant differences between the topology of node neighbourhoods of real networks and the stochastic topology of null models of random simplicial complexes revealing local organisation principles of the node neighbourhoods. Moreover we observe that a large scale statistical analysis of the topological properties of node neighbourhoods is able to clearly discriminate between power-law networks, and planar road networks.

  • Open Access

    Sparse Power-Law Network Model for Reliable Statistical Predictions Based on Sampled Data

    by Alexander P. Kartun-Giles, Dmitri Krioukov, James P. Gleeson, Yamir Moreno, Ginestra Bianconi

    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 taken into consideration. An exchangeable model is a model that does not depend on the order in which nodes are sampled. Despite a large variety of non-equilibrium (growing) and equilibrium (static) sparse complex network models that are widely used in network science, how to reconcile sparseness (constant average degree) with the desired statistical properties of projectivity and exchangeability is currently an outstanding scientific problem. Here we propose a network process with hidden variables which is projective and can generate sparse power-law networks. Despite the model not being exchangeable, it can be closely related to exchangeable uncorrelated networks as indicated by its information theory characterization and its network entropy. The use of the proposed network process as a null model is here tested on real data, indicating that the model offers a promising avenue for statistical network modelling.


  • Euclidean Matchings in Ultra-Dense Networks

    by Alexander Kartun-Giles, Suhanya Jayaprakasam, Sunwoo Kim

    In order to study the fundamental limits of the advantage of network ultra-densification in 5G, we study the spatial spectral efficiency gain achieved when densely deployed communication devices embedded in the d-dimensional Euclidean plane are optimally ‘matched’ in near-neighbour pairs. In light of recent success in probabilisitc modelling, we study devices distributed uniformly at random in the unit cube which enter into one-on-one contracts with each another. This is known in statistical physics as an Euclidean ‘matching’. Communication channels each have their own maximal data capacity given by Shannon’s theorem. The length of the shortest matching then corresponds to the maximum one-hop capacity on those points. Interference is then added as a further constraint, which is modelled using shapes as guard regions, such as a disk, diametral disk, or equilateral triangle, matched to points, in a similar light to computational geometry. The disk, for example, produces the Delaunay triangulation, while the diametral disk produces a beta-skeleton. We also discuss deriving the scaling limit of both models using the replica method from the physics of disordered systems.


  • Counting Geodesic Paths in 1D VANETs

    by Georgie Knight, Alexander P. Kartun-Giles, Orestis Georgiou, Carl P. Dettmann

    In the IEEE 802.11p standard addressing vehicular communications, basic safety messages can be bundled together and relayed as to increase the effective communication range of transmitting vehicles. This process forms a vehicular ad hoc network (VANET) for the dissemination of safety information. The number of “shortest multihop paths” (or geodesics) connecting two network nodes is an important statistic which can be used to enhance throughput, validate threat events, protect against collusion attacks, infer location information, and also limit redundant broadcasts thus reducing interference. To this end, we analytically calculate for the first time the mean and variance of the number of geodesics in 1-D VANETs.


  • Open Access

    Connectivity of Soft Random Geometric Graphs Over Annuli

    by Alexander P. Kartun-Giles, Orestis Georgiou, Carl P. Dettmann

    Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present analytic formulas for the connection probability of these spatially embedded graphs, describing the connectivity behaviour as a dense-network limit is approached. This extends recent work modelling ad hoc networks in non-convex domains.

  • Open Access

    Betweenness Centrality in Dense Random Geometric Networks

    by Alexander P. Kartun-Giles, Orestis Georgiou, Carl P. Dettmann

    Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how often all paths in the network characterisable as topologically `shortest' contain a given node (betweenness centrality), deriving an expression in terms of a known integral whenever 1) the network boundary is the perimeter of a disk and 2) the network is extremely dense. Our method shows how similar formulas can be obtained for any convex geometry. Numerical corroboration is provided, as well as a discussion of our formula's potential use for cluster head election and boundary detection in densely deployed wireless ad hoc networks.