3 citations · 9 across the 7 of their papers we have counts for
5 papers · 1 filter
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.…
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…
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…
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…
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…