4 papers
A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
Heman Shakeri, Torben Amtoft, Behnaz Moradi-Jamei +2
Cyclic structures are fundamental topological features in graphs, playing critical roles in network robustness, information flow, community structure, and various dynamic processes…
The scaling limit of fair Peano paths
Nathan Albin, Joan Lind, Pietro Poggi-Corradini
We study random Peano paths on planar square grids that arise from fair random spanning trees. These are trees that are sampled in such a way as to have the same (if possible) edge…
An exact-arithmetic algorithm for spanning tree modulus
Nathan Albin, Kapila Kottegoda, Pietro Poggi-Corradini
Spanning tree modulus is a generalization of effective resistance that is closely related to graph strength and fractional arboricity. The optimal edge density associated with span…
Minimizing the determinant of the graph Laplacian
Nathan Albin, Joan Lind, Anna Melikyan +1
In this paper, we study extremal values for the determinant of the weighted graph Laplacian under simple nondegeneracy conditions on the weights. We derive necessary and sufficient…