Carl P. Dettmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Carl P. Dettmann has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Konstantinos Koufos
WMG, University of Warwick
11 shared publications - Justin Porter Coon
Department of Engineering Science, University of Oxford, Oxford, U.K.
6 shared publications Orestis Georgiou
5 shared publications- Alexander P. Kartun-Giles
School of Mathematics University of Bristol University Walk BS8 1TW Bristol United Kingdom
4 shared publications - Orestis Georgiou
Ultraleap Ltd,Bristol,UK
4 shared publications - Orestis Georgiou
School of Mathematics University of Bristol United Kingdom
4 shared publications
Latest Publications
- Open Access
- 25 August 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (5)
Entropy of random geometric graphs in high and low dimensions
We use a multivariate central limit theorem (CLT) to study the distribution of random geometric graphs (RGGs) on the cube and torus in the high-dimensional limit with general node distributions. We find that the distribution of RGGs on the torus converges to the Erdős-Rényi (ER) ensemble when the nodes are uniformly distributed, but that the distribution for RGGs with non-uniformly distributed nodes on the torus, and for RGGs with any distribution of nodes with kurtosis greater than 1 on the cube is different. In these cases, the distribution has a lower maximum entropy than the ER ensemble, but is still symmetric. Soft RGGs in either geometry converge to the ER ensemble. An Edgeworth correction to the CLT is then developed to derive the $ \mathscr{O}\left(d^{-\frac{1}{2}}\right) $ sub-leading term of the Shannon entropy of RGGs in dimension for both geometries. We also provide numerical approximations of maximum entropy in low-dimensional hard and soft RGGs, and calculate exactly the entropy of hard RGGs with three nodes in the one-dimensional cube and torus.- 25 August 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (5)
Open AccessEntropy of random geometric graphs in high and low dimensions
We use a multivariate central limit theorem (CLT) to study the distribution of random geometric graphs (RGGs) on the cube and torus in the high-dimensional limit with general node distributions. We find that the distribution of RGGs on the torus converges to the Erdős-Rényi (ER) ensemble when the nodes are uniformly distributed, but that the distribution for RGGs with non-uniformly distributed nodes on the torus, and for RGGs with any distribution of nodes with kurtosis greater than 1 on the cube is different. In these cases, the distribution has a lower maximum entropy than the ER ensemble, but is still symmetric. Soft RGGs in either geometry converge to the ER ensemble. An Edgeworth correction to the CLT is then developed to derive the $ \mathscr{O}\left(d^{-\frac{1}{2}}\right) $ sub-leading term of the Shannon entropy of RGGs in dimension for both geometries. We also provide numerical approximations of maximum entropy in low-dimensional hard and soft RGGs, and calculate exactly the entropy of hard RGGs with three nodes in the one-dimensional cube and torus. - Open Access
- 3 April 2024
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 34 (2) , 225-236
Kronecker Sequences with Many Distances
1 What is the maximum local complexity for equally spaced points on a torus Td (defined in Section 2)? Equally spaced refers to the set {nα}1≤n≤N for fixed α∈Td. Local complexity refers to the numb...
- 3 April 2024
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 34 (2) , 225-236
Open AccessKronecker Sequences with Many Distances
1 What is the maximum local complexity for equally spaced points on a torus Td (defined in Section 2)? Equally spaced refers to the set {nα}1≤n≤N for fixed α∈Td. Local complexity refers to the numb...
- Open Access
- 3 September 2023
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 629
Sunflower hard disk graphs
- 3 September 2023
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 629
Open AccessSunflower hard disk graphs
- Open Access
- 24 July 2023
- Published by Taylor & Francis in Journal of Mathematics and Music
- Vol. 18 (2) , 203-216
Algebraic tunings
- 24 July 2023
- Published by Taylor & Francis in Journal of Mathematics and Music
- Vol. 18 (2) , 203-216
Open AccessAlgebraic tunings
- 16 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (5) , 6001-6008
Control Mechanisms for Mobile Devices
In this paper we consider control mechanisms for mobile devices in a stochastic environment. In particular, we consider a device in $n$ -dimensional space subject to Brownian perturbations where a control mechanism moves the device towards its target location at a speed which is a function of its displacement. For this scenario, we construct stochastic differential equations for the mobility process and solve for the steady state probability density function of displacement. From this we are able to give general solutions to key metrics such as displacement outage (the long term probability of exceeding a given distance from the target), connectivity probability (derived from the SNR distribution in a Rayleigh channel with pathloss), the mean time at which the device first exceeds a given distance from the target, and the mean kinetic energy required by the control mechanism. We evaluate these metrics for important special cases of the control mechanism and also study the optimization problem of minimizing kinetic energy over the parameters of the control function.
- 16 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (5) , 6001-6008
Control Mechanisms for Mobile Devices
In this paper we consider control mechanisms for mobile devices in a stochastic environment. In particular, we consider a device in $n$ -dimensional space subject to Brownian perturbations where a control mechanism moves the device towards its target location at a speed which is a function of its displacement. For this scenario, we construct stochastic differential equations for the mobility process and solve for the steady state probability density function of displacement. From this we are able to give general solutions to key metrics such as displacement outage (the long term probability of exceeding a given distance from the target), connectivity probability (derived from the SNR distribution in a Rayleigh channel with pathloss), the mean time at which the device first exceeds a given distance from the target, and the mean kinetic energy required by the control mechanism. We evaluate these metrics for important special cases of the control mechanism and also study the optimization problem of minimizing kinetic energy over the parameters of the control function.
- Open Access
- 19 October 2022
- Published by Elsevier in Statistics & Probability Letters
- Vol. 193
The distribution of the number of isolated nodes in the 1-Dimensional soft random geometric graph
- 19 October 2022
- Published by Elsevier in Statistics & Probability Letters
- Vol. 193
Open AccessThe distribution of the number of isolated nodes in the 1-Dimensional soft random geometric graph
- Open Access
- 1 December 2021
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 31 (12) , 123119
Spherical billiards with almost complete escape
A dynamical billiard consists of a point particle moving uniformly except for mirror-like collisions with the boundary. Recent work has described the escape of the particle through a hole in the boundary of a circular or spherical billiard, making connections with the Riemann Hypothesis. Unlike the circular case, the sphere with a single hole leads to a non-zero probability of never escaping. Here, we study variants in which almost all initial conditions escape, with multiple small holes or a thin strip. We show that equal spacing of holes around the equator is an efficient means of ensuring almost complete escape and study the long time survival probability for small holes analytically and numerically. We find that it approaches a universal function of a single parameter, hole area multiplied by time.
- 1 December 2021
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 31 (12) , 123119
Open AccessSpherical billiards with almost complete escape
A dynamical billiard consists of a point particle moving uniformly except for mirror-like collisions with the boundary. Recent work has described the escape of the particle through a hole in the boundary of a circular or spherical billiard, making connections with the Riemann Hypothesis. Unlike the circular case, the sphere with a single hole leads to a non-zero probability of never escaping. Here, we study variants in which almost all initial conditions escape, with multiple small holes or a thin strip. We show that equal spacing of holes around the equator is an efficient means of ensuring almost complete escape and study the long time survival probability for small holes analytically and numerically. We find that it approaches a universal function of a single parameter, hole area multiplied by time.
- 27 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1
On the k Nearest-Neighbor Path Distance from the Typical Intersection in the Manhattan Poisson Line Cox Process
In this paper we calculate the exact cumulative distribution function (CDF) of the path distance (L1 norm) between a randomly selected intersection and the k-th nearest node of the Cox point process driven by the Manhattan Poisson line process. The CDF is expressed as a sum over the integer partition function $p\!\left(k\right)$ , which allows us to numerically evaluate the CDF in a simple manner. The distance distributions can be used to study the k-coverage of broadcast signals in intelligent transportation systems (ITS) transmitted from a \ac{RSU} that is located at an intersection. They can also be insightful for network dimensioning in urban vehicle-to-everything (V2X) systems, because they can yield the exact distribution of network load within a cell, provided that the \ac{RSU} is located at an intersection. Finally, they can find useful applications in other branches of science like spatial databases, emergency response planning, and districting. We corroborate the applicability of the distance distribution model using the map of an urban area.- 27 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1
On the k Nearest-Neighbor Path Distance from the Typical Intersection in the Manhattan Poisson Line Cox Process
In this paper we calculate the exact cumulative distribution function (CDF) of the path distance (L1 norm) between a randomly selected intersection and the k-th nearest node of the Cox point process driven by the Manhattan Poisson line process. The CDF is expressed as a sum over the integer partition function $p\!\left(k\right)$ , which allows us to numerically evaluate the CDF in a simple manner. The distance distributions can be used to study the k-coverage of broadcast signals in intelligent transportation systems (ITS) transmitted from a \ac{RSU} that is located at an intersection. They can also be insightful for network dimensioning in urban vehicle-to-everything (V2X) systems, because they can yield the exact distribution of network load within a cell, provided that the \ac{RSU} is located at an intersection. Finally, they can find useful applications in other branches of science like spatial databases, emergency response planning, and districting. We corroborate the applicability of the distance distribution model using the map of an urban area.- Open Access
Lower bounds and dense discontinuity phenomena for the stabilizability radius of linear switched systems
We investigate the stabilizability of discrete-time linear switched systems, when the sole control action of the controller is the switching signal, and when the controller has access to the state of the system in real time. Despite their apparent simplicity, determining if such systems are stabilizable appears to be a very challenging problem, and basic examples have been known for long, for which the stabilizability question is open. We provide new results allowing us to bound the so-called stabilizability radius, which characterizes the stabilizability property of discrete-time linear switched systems. These results allow us to compute significantly improved explicit lower bounds on the stabilizability radius for the above-mentioned examples. As a by-product, we exhibit a discontinuity property for this problem, which brings theoretical understanding of its complexity.
Open AccessLower bounds and dense discontinuity phenomena for the stabilizability radius of linear switched systems
We investigate the stabilizability of discrete-time linear switched systems, when the sole control action of the controller is the switching signal, and when the controller has access to the state of the system in real time. Despite their apparent simplicity, determining if such systems are stabilizable appears to be a very challenging problem, and basic examples have been known for long, for which the stabilizability question is open. We provide new results allowing us to bound the so-called stabilizability radius, which characterizes the stabilizability property of discrete-time linear switched systems. These results allow us to compute significantly improved explicit lower bounds on the stabilizability radius for the above-mentioned examples. As a by-product, we exhibit a discontinuity property for this problem, which brings theoretical understanding of its complexity.
- 29 December 2020
- Published by American Physical Society (APS) in Physical Review E
- Vol. 102 (6) , 062312
Connectivity in one-dimensional soft random geometric graphs
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on the distance between them. We derive bounds on the probability that the graph is fully connected by analyzing key modes of disconnection. In particular, analytic expressions are given for the mean and variance of the number of isolated nodes, and a sharp threshold established for their occurrence. Bounds are also derived for uncrossed gaps, and it is shown analytically that uncrossed gaps have negligible probability in the scaling at which isolated nodes appear. This is in stark contrast to the hard RGG in which uncrossed gaps are the most important factor when considering network connectivity.
- 29 December 2020
- Published by American Physical Society (APS) in Physical Review E
- Vol. 102 (6) , 062312
Connectivity in one-dimensional soft random geometric graphs
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on the distance between them. We derive bounds on the probability that the graph is fully connected by analyzing key modes of disconnection. In particular, analytic expressions are given for the mean and variance of the number of isolated nodes, and a sharp threshold established for their occurrence. Bounds are also derived for uncrossed gaps, and it is shown analytically that uncrossed gaps have negligible probability in the scaling at which isolated nodes appear. This is in stark contrast to the hard RGG in which uncrossed gaps are the most important factor when considering network connectivity.