activity
20212026
most citedModeling resource consumption in the US air transportation system via minimum-cost percolation

3 citations · 9 across the 7 of their papers we have counts for

collaborators

8 papers

cs.AI2026

Evaluating LLM-Generated Preference Distributions

Fan Huang, Minsuk Kim, C. Tyler Diggans +1

Large Language Models (LLMs) are increasingly used as probabilistic generators for simulation, synthetic data generation, and decision support in settings where real-world data are…

cs.IT2025

Boltzmann-Shannon Index: A Geometric-Aware Measure of Clustering Balance

Emanuele Bossi, C. Tyler Diggans, Abd AlRahman R. AlMomani

The Boltzmann-Shannon Index (BSI) for clustered continuous data is introduced as a normalized measure that captures the relationship between geometry-based and frequency-based prob…

physics.soc-ph2025

Graph conductance, synchronization, and a new local bottleneck measure for decentralized network optimization

C. Tyler Diggans, Jeremie Fish, Abd AlRahman R. AlMomani

The two most prominent bottleneck measures in graph theory, commonly known as the isoperimetric number and conductance, are both referred to in the literature as Cheeger constants.…

physics.soc-ph2025★ 3 cited

Modeling resource consumption in the US air transportation system via minimum-cost percolation

Minsuk Kim, C. Tyler Diggans, Filippo Radicchi

We introduce a dynamic percolation model aimed at describing the consumption, and eventual exhaustion, of resources in transportation networks. In the model, rational agents progre…

physics.soc-ph2024

Generalizing Geometric Partition Entropy for the Estimation of Mutual Information in the Presence of Informative Outliers

C. Tyler Diggans, Abd AlRahman R. AlMomani

The recent introduction of geometric partition entropy brought a new viewpoint to non-parametric entropy quantification that incorporated the impacts of informative outliers, but i…

physics.soc-ph2021★ 3 cited

Spanning Trees of Recursive Scale-Free Graphs

C. Tyler Diggans, Erik M. Bollt, Daniel ben-Avraham

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 DG…

nlin.AO2021★ 3 cited

The Essential Synchronization Backbone Problem

C. Tyler Diggans, Jeremie Fish, Abd AlRahman R. AlMomani +1

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 st…

physics.soc-ph2021

Emergent hierarchy through conductance-based node constraints

C. Tyler Diggans, Jeremie Fish, Erik Bollt

The presence of hierarchy in many real-world networks is not yet fully explained. Complex interaction networks are often coarse-grain models of vast modular networks, where tightly…