Alex Kartun-Giles

Dr. Alex Kartun-Giles

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2019 in Chaos, Solitons & Fractals: X
Verified
Journal Article
Open access
AKAlex Kartun-Giles
Alex Kartun-Giles
Ginestra BianconiGinestra Bianconi
Ginestra Bianconi

29 December 2015 in Journal of Statistical Physics
Verified
Journal Article
Open access
PDF file
AKAlex Kartun-Giles
Alex Kartun-Giles
OGOrestis Georgiou
Orestis Georgiou
CDCarl P. Dettmann
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.

30 September 2019 in Physical Review E
Verified
Journal Article
Closed access
PDF file
AKAlex Kartun-Giles
Alex Kartun-Giles
MBMarc Barthelemy
Marc Barthelemy
CDCarl P. Dettmann
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.

2 December 2016 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
GKGeorgie Knight
Georgie Knight
AKAlex Kartun-Giles
Alex Kartun-Giles
OGOrestis Georgiou
Orestis Georgiou
CDCarl P. Dettmann
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.

1 June 2015
Verified
Conference Paper
Closed access
AKAlex Kartun-Giles
Alex Kartun-Giles
OGOrestis Georgiou
Orestis Georgiou
CDCarl P. Dettmann
Carl P. Dettmann
Random geometric networks are mathematical structures consisting of a set of nodes placed randomly within a bounded set V ⊆ ℝ d mutually coupled with a probability dependent on their Euclidean separation, and are the classic model used within the expanding field of ad hoc wireless networks. In order to rank the importance of the network's communicating nodes, we consider the well established `betweenness' centrality measure (quantifying how often a node is on a shortest path of links between any pair of nodes), providing an analytic treatment of betweenness within a random graph model by deriving a closed form expression for the expected betweenness of a node placed within a dense random geometric network formed inside a disk of radius R. We confirm this with numerical simulations, and discuss the importance of the formula for mitigating the `boundary effect' connectivity phenomenon, for cluster head node election protocol design and for detecting the location of a network's `vulnerability backbone'.

7 April 2018 in Entropy
Verified
Journal Article
Open access
PDF file
AKAlex Kartun-Giles
Alex Kartun-Giles
DKDmitri Krioukov
Dmitri Krioukov
JGJames P. Gleeson
James P. Gleeson
YMYamir Moreno
Yamir Moreno
Ginestra BianconiGinestra Bianconi
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.