Christopher Tyler Diggans
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
Christopher Tyler Diggans has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Abd AlRahman R. AlMomani
Clarkson University
4 shared publications Erik M. Bollt
Clarkson Center for Complex Systems Science, Clarkson University, Potsdam, New York 13699, USA
2 shared publicationsDaniel Ben-Avraham
Clarkson Center for Complex Systems Science, Clarkson University, Potsdam, New York 13699, USA
1 shared publication- Daniel Ben-Avraham
Department of Physics Clarkson University 13699-5820 Potsdam NY USA
1 shared publication - Erik M. Bollt
Clarkson University
1 shared publication - Filippo Radicchi
Indiana University
1 shared publication
Latest Publications
- Open Access
- 29 August 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-12
Modeling resource consumption in the US air transportation system via minimum-cost percolation
Percolation theory has been proven useful to study the robustness of supply-and-demand networks (SDNs) such as transportation and communication infrastructures. Here, we show that it can also be leveraged to understand how resources of SDNs are utilized, and eventually depleted. We introduce a model where rational agents consume network’s edges along demanded minimum-cost paths. Due to the finiteness of its resources, the network undergoes a transition between a percolating phase where it can properly serve demand to a non-percolating phase where demand can no longer be supplied. By applying the framework to weighted, directed, temporal, and multi-layer network representations of the US air transportation system, we underscore several key benefits for the overall system that could emerge by simply promoting code-share arrangements among airlines without altering their current schedule of operation.
- 29 August 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-12
Open AccessModeling resource consumption in the US air transportation system via minimum-cost percolation
Percolation theory has been proven useful to study the robustness of supply-and-demand networks (SDNs) such as transportation and communication infrastructures. Here, we show that it can also be leveraged to understand how resources of SDNs are utilized, and eventually depleted. We introduce a model where rational agents consume network’s edges along demanded minimum-cost paths. Due to the finiteness of its resources, the network undergoes a transition between a percolating phase where it can properly serve demand to a non-percolating phase where demand can no longer be supplied. By applying the framework to weighted, directed, temporal, and multi-layer network representations of the US air transportation system, we underscore several key benefits for the overall system that could emerge by simply promoting code-share arrangements among airlines without altering their current schedule of operation.
- Open Access
- 1 March 2025
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 35 (3)
Generalizing geometric partition entropy for the estimation of mutual information in the presence of informative outliers
The recent introduction of geometric partition entropy brought a new viewpoint to non-parametric entropy quantification that incorporated the impacts of informative outliers, but its original formulation was limited to the context of a one-dimensional state space. A generalized definition of geometric partition entropy is now provided for samples within a bounded (finite measure) region of a d-dimensional vector space. The basic definition invokes the concept of a Voronoi diagram, but the computational complexity and reliability of Voronoi diagrams in high dimension make estimation by direct theoretical computation unreasonable. This leads to the development of approximation schemes that enable estimation that is faster than the current methods by orders of magnitude. The partition intersection (π) approximation, in particular, enables direct estimates of marginal entropy in any context resulting in an efficient and versatile mutual information estimator. This new measure-based paradigm for data-driven information theory allows flexibility in the incorporation of geometry to vary the representation of outlier impact, which leads to a significant broadening in the applicability of the established entropy-based concepts. The incorporation of informative outliers is illustrated through analysis of transient dynamics in the synchronization of coupled chaotic dynamical systems.
- 1 March 2025
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 35 (3)
Open AccessGeneralizing geometric partition entropy for the estimation of mutual information in the presence of informative outliers
The recent introduction of geometric partition entropy brought a new viewpoint to non-parametric entropy quantification that incorporated the impacts of informative outliers, but its original formulation was limited to the context of a one-dimensional state space. A generalized definition of geometric partition entropy is now provided for samples within a bounded (finite measure) region of a d-dimensional vector space. The basic definition invokes the concept of a Voronoi diagram, but the computational complexity and reliability of Voronoi diagrams in high dimension make estimation by direct theoretical computation unreasonable. This leads to the development of approximation schemes that enable estimation that is faster than the current methods by orders of magnitude. The partition intersection (π) approximation, in particular, enables direct estimates of marginal entropy in any context resulting in an efficient and versatile mutual information estimator. This new measure-based paradigm for data-driven information theory allows flexibility in the incorporation of geometry to vary the representation of outlier impact, which leads to a significant broadening in the applicability of the established entropy-based concepts. The incorporation of informative outliers is illustrated through analysis of transient dynamics in the synchronization of coupled chaotic dynamical systems.
- Open Access
- 1 December 2023
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 33 (12)
Boltzmann–Shannon interaction entropy: A normalized measure for continuous variables with an application as a subsample quality metric
The recent introduction of geometric partition entropy offered an alternative to differential Shannon entropy for the quantification of uncertainty as estimated from a sample drawn from a one-dimensional bounded continuous probability distribution. In addition to being a fresh perspective for the basis of continuous information theory, this new approach provided several improvements over traditional entropy estimators including its effectiveness on sparse samples and a proper incorporation of the impact from extreme outliers. However, a complimentary relationship exists between the new geometric approach and the basic form of its frequency-based predecessor that is leveraged here to define an entropy measure with no bias toward the sample size. This stable normalized measure is named the Boltzmann–Shannon interaction entropy (BSIE)) as it is defined in terms of a standard divergence between the measure-based and frequency-based distributions that can be associated with the two historical figures. This parameter-free measure can be accurately estimated in a computationally efficient manner, and we illustrate its utility as a quality metric for subsampling in the context of nonlinear polynomial regression.
- 1 December 2023
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 33 (12)
Open AccessBoltzmann–Shannon interaction entropy: A normalized measure for continuous variables with an application as a subsample quality metric
The recent introduction of geometric partition entropy offered an alternative to differential Shannon entropy for the quantification of uncertainty as estimated from a sample drawn from a one-dimensional bounded continuous probability distribution. In addition to being a fresh perspective for the basis of continuous information theory, this new approach provided several improvements over traditional entropy estimators including its effectiveness on sparse samples and a proper incorporation of the impact from extreme outliers. However, a complimentary relationship exists between the new geometric approach and the basic form of its frequency-based predecessor that is leveraged here to define an entropy measure with no bias toward the sample size. This stable normalized measure is named the Boltzmann–Shannon interaction entropy (BSIE)) as it is defined in terms of a standard divergence between the measure-based and frequency-based distributions that can be associated with the two historical figures. This parameter-free measure can be accurately estimated in a computationally efficient manner, and we illustrate its utility as a quality metric for subsampling in the context of nonlinear polynomial regression.
- Open Access
Geometric Partition Entropy: Coarse-Graining a Continuous State Space
Entropy is re-examined as a quantification of ignorance in the predictability of a one dimensional continuous phenomenon. Although traditional estimators for entropy have been widely utilized in this context, we show that both the thermodynamic and Shannon’s theory of entropy are fundamentally discrete, and that the limiting process used to define differential entropy suffers from similar problems to those encountered in thermodynamics. In contrast, we consider a sampled data set to be observations of microstates (unmeasurable in thermodynamics and nonexistent in Shannon’s discrete theory), meaning, in this context, it is the macrostates of the underlying phenomenon that are unknown. To obtain a particular coarse-grained model we define macrostates using quantiles of the sample and define an ignorance density distribution based on the distances between quantiles. The geometric partition entropy is then just the Shannon entropy of this finite distribution. Our measure is more consistent and informative than histogram-binning, especially when applied to complex distributions and those with extreme outliers or under limited sampling. Its computational efficiency and avoidance of negative values can also make it preferable to geometric estimators such as k-nearest neighbors. We suggest applications that are unique to this estimator and illustrate its general utility through an application to time series in the approximation of an ergodic symbolic dynamics from limited observations.
Open AccessGeometric Partition Entropy: Coarse-Graining a Continuous State Space
Entropy is re-examined as a quantification of ignorance in the predictability of a one dimensional continuous phenomenon. Although traditional estimators for entropy have been widely utilized in this context, we show that both the thermodynamic and Shannon’s theory of entropy are fundamentally discrete, and that the limiting process used to define differential entropy suffers from similar problems to those encountered in thermodynamics. In contrast, we consider a sampled data set to be observations of microstates (unmeasurable in thermodynamics and nonexistent in Shannon’s discrete theory), meaning, in this context, it is the macrostates of the underlying phenomenon that are unknown. To obtain a particular coarse-grained model we define macrostates using quantiles of the sample and define an ignorance density distribution based on the distances between quantiles. The geometric partition entropy is then just the Shannon entropy of this finite distribution. Our measure is more consistent and informative than histogram-binning, especially when applied to complex distributions and those with extreme outliers or under limited sampling. Its computational efficiency and avoidance of negative values can also make it preferable to geometric estimators such as k-nearest neighbors. We suggest applications that are unique to this estimator and illustrate its general utility through an application to time series in the approximation of an ergodic symbolic dynamics from limited observations.
- 22 February 2022
- Published by American Physical Society (APS) in Physical Review E
- Vol. 105 (2) , 024312
Spanning trees of recursive scale-free graphs
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the Dorogovtsev-Goltsev-Mendes (DGM) net. The recursions allow for many large-scale properties of the ensemble of spanning trees to be analytically solved exactly. We show how a judicious application of the prescribed growth rules selects for certain subsets of the spanning trees with particular desired properties (small world, extended diameter, degree distribution, etc.), and thus approximates and/or provides solutions to several optimization problems on undirected and unweighted networks. The analysis of spanning trees enhances the usefulness of recursive graphs as sophisticated models for everyday life complex networks.
- 22 February 2022
- Published by American Physical Society (APS) in Physical Review E
- Vol. 105 (2) , 024312
Spanning trees of recursive scale-free graphs
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the Dorogovtsev-Goltsev-Mendes (DGM) net. The recursions allow for many large-scale properties of the ensemble of spanning trees to be analytically solved exactly. We show how a judicious application of the prescribed growth rules selects for certain subsets of the spanning trees with particular desired properties (small world, extended diameter, degree distribution, etc.), and thus approximates and/or provides solutions to several optimization problems on undirected and unweighted networks. The analysis of spanning trees enhances the usefulness of recursive graphs as sophisticated models for everyday life complex networks.
- 1 November 2021
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 31 (11) , 113142
The essential synchronization backbone problem
Network optimization strategies for the process of synchronization have generally focused on the re-wiring or re-weighting of links in order to (1) expand the range of coupling strengths that achieve synchronization, (2) expand the basin of attraction for the synchronization manifold, or (3) lower the average time to synchronization. A new optimization goal is proposed in seeking the minimum subset of the edge set of the original network that enables the same essential ability to synchronize in that the synchronization manifolds have conjugate stability. We call this type of minimal spanning subgraph an essential synchronization backbone of the original system, and we present two algorithms: one is a strategy for an exhaustive search for a true solution, while the other is a method of approximation for this combinatorial problem. The solution spaces that result from different choices of dynamical systems and coupling schemes vary with the level of a hierarchical structure present and also the number of interwoven central cycles. Applications can include the important problem in civil engineering of power grid hardening, where new link creation may be costly, and the defense of certain key links to the functional process may be prioritized.
- 1 November 2021
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 31 (11) , 113142
The essential synchronization backbone problem
Network optimization strategies for the process of synchronization have generally focused on the re-wiring or re-weighting of links in order to (1) expand the range of coupling strengths that achieve synchronization, (2) expand the basin of attraction for the synchronization manifold, or (3) lower the average time to synchronization. A new optimization goal is proposed in seeking the minimum subset of the edge set of the original network that enables the same essential ability to synchronize in that the synchronization manifolds have conjugate stability. We call this type of minimal spanning subgraph an essential synchronization backbone of the original system, and we present two algorithms: one is a strategy for an exhaustive search for a true solution, while the other is a method of approximation for this combinatorial problem. The solution spaces that result from different choices of dynamical systems and coupling schemes vary with the level of a hierarchical structure present and also the number of interwoven central cycles. Applications can include the important problem in civil engineering of power grid hardening, where new link creation may be costly, and the defense of certain key links to the functional process may be prioritized.
- 22 May 2020
- Published by American Physical Society (APS) in Physical Review E
- Vol. 101 (5) , 052315
Stochastic and mixed flower graphs
Stochasticity is introduced to a well studied class of recursively grown graphs: -flower nets, which have power-law degree distributions as well as small-world properties (when . The stochastic variant interpolates between different (deterministic) flower graphs thus adding flexibility to the model. The random multiplicative growth process involved, however, leads to a spread ensemble of networks with finite variance for the number of links, nodes, and loops. Nevertheless, the degree exponent and loopiness exponent attain unique values in the thermodynamic limit of infinitely large graphs. We also study a class of mixed flower networks, closely related to the stochastic flowers, but which are grown recursively in a deterministic way. The deterministic growth of mixed flower-nets eliminates ensemble spreads, and their recursive growth allows for exact analysis of their (uniquely defined) mixed properties.- 22 May 2020
- Published by American Physical Society (APS) in Physical Review E
- Vol. 101 (5) , 052315
Stochastic and mixed flower graphs
Stochasticity is introduced to a well studied class of recursively grown graphs: -flower nets, which have power-law degree distributions as well as small-world properties (when . The stochastic variant interpolates between different (deterministic) flower graphs thus adding flexibility to the model. The random multiplicative growth process involved, however, leads to a spread ensemble of networks with finite variance for the number of links, nodes, and loops. Nevertheless, the degree exponent and loopiness exponent attain unique values in the thermodynamic limit of infinitely large graphs. We also study a class of mixed flower networks, closely related to the stochastic flowers, but which are grown recursively in a deterministic way. The deterministic growth of mixed flower-nets eliminates ensemble spreads, and their recursive growth allows for exact analysis of their (uniquely defined) mixed properties.