Related papers: Effective Resistance in Simplicial Complexes as Bi…
This paper explores the implications of blocking duality---pioneered by Fulkerson et al.---in the context of $p$-modulus on networks. Fulkerson's blocking duality is an analogue on networks to the method of conjugate families of curves in…
Persistent homology is a popular method for computing topological features of (metric) data. Standard approaches based on the \v{C}ech or Rips filtration are stable under small perturbations of the data, but highly sensitive to outliers.…
The \emph{resistance matrix} of a simple connected graph $G$ is denoted by $R$, and is defined by $R =(r_{ij})$, where $r_{ij}$ is the resistance distance between the vertices $i$ and $j$ of $G$. In this paper, we consider the resistance…
The effective nonlinear response of films of random composites consisting of a binary composite with nonlinear particles randomly embedded in a linear host is theoretically and numerically studied. A theoretical expression for the effective…
This article introduces and studies a new class of graphs motivated by discrete curvature. We call a graph resistance nonnegative if there exists a distribution on its spanning trees such that every vertex has expected degree at most two in…
Let $G$ be a finite plane multigraph and $G'$ its dual. Each edge $e$ of $G$ is interpreted as a resistor of resistance $R_e$, and the dual edge $e'$ is assigned the dual resistance $R_{e'}:=1/R_e$. Then the equivalent resistance $r_e$ over…
This paper introduces the notion of weak rigidity to characterize a framework by pairwise inner products of inter-agent displacements. Compared to distance-based rigidity, weak rigidity requires fewer constrained edges in the graph to…
Robust heteroclinic networks are invariant sets that can appear as attractors in symmetrically coupled or otherwise constrained dynamical systems. These networks may have a very complicated structure that is poorly understood and determined…
A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
Contrast functions play a fundamental role in information geometry, providing a means for generating the geometric structures of a statistical manifold: a pseudo-Riemannian metric and a pair of torsion-free conjugate affine connections.…
We investigate a special case of hereditary property in graphs, referred to as {\em robustness}. A property (or structure) is called robust in a graph $G$ if it is inherited by all the connected spanning subgraphs of $G$. We motivate this…
We propose a mathematical framework for designing robust networks of coupled phase-oscillators by leveraging a vulnerability measure proposed by Tyloo et. al that quantifies how much a small perturbation to a phase-oscillator's natural…
This is part 1 of 3 from the master's thesis: Modeling Compact Objects with Effective Field Theory, supervised by Amanda Weltman. Using the Effective Field Theory framework for extended objects and the coset construction, we build the…
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
A metrized graph is a finite weighted graph whose edges are thought of as line segments. In this expository paper, we study the Laplacian operator on a metrized graph and some important functions related to it, including the ``j-function'',…
An analytic approach is presented to developing exact expressions for the two-point resistance between arbitrary nodes on certain non-regular resistor networks. This generalises previous approaches, which only deliver results for networks…
Elastic quantum bound-state reflection from a hard-wall boundary provides direct information regarding the structure and compressibility of quantum bound states. We discuss elastic quantum bound-state reflection and derive a general theory…
The connection between network topology and stability remains unclear. General approaches that clarify this relationship and allow for more efficient stability analysis would be desirable. Inspired by chemical reaction networks, I…
Part 2 of 3 from master's thesis: Modeling Compact Objects with Effective Field Theory. Using the Effective Field Theory framework for extended objects, we build the effective theory of a binary system made up of the most general compact…