23 citations · 141 across the 35 of their papers we have counts for
38 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…
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…
Fulkerson duality for modulus of spanning trees and partitions
Huy Truong, Pietro Poggi-Corradini
One of the main properties of modulus on graphs is Fulkerson duality. In this paper, we study Fulkerson duality for spanning tree modulus. We introduce a new notion of Beurling par…
Density of continuous functions in Sobolev spaces with applications to capacity
Sylvester Eriksson-Bique, Pietro Poggi-Corradini
We show that capacity can be computed with locally Lipschitz functions in locally complete and separable metric spaces. Further, we show that if is a locally complete and…
Convergence of the Probabilistic Interpretation of Modulus
Nathan Albin, Joan Lind, Pietro Poggi-Corradini
Given a Jordan domain and two disjoint arcs on , the modulus of the curve family connecting and in is equal to the modulus of…
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…