Related papers: Effective resistance in metric spaces
We study equilibrium configurations of non-Euclidean plates, in which the reference metric is uniaxially periodic. This work is motivated by recent experiments on thin sheets of composite thermally responsive gels [1]. Such sheets bend…
Given a resistive electrical network, we would like to determine whether all the resistances (edges) in the network are working, and if not, identify which edge (or edges) are faulty. To make this determination, we are allowed to measure…
Non-Hermitian systems have been widely explored in platforms ranging from photonics to electric circuits. A defining feature of non-Hermitian systems is exceptional points (EPs), where both eigenvalues and eigenvectors coalesce. Tropical…
For uncertainty propagation of highly complex and/or nonlinear problems, one must resort to sample-based non-intrusive approaches [1]. In such cases, minimizing the number of function evaluations required to evaluate the response surface is…
We provide new algorithms and conditional hardness for the problem of estimating effective resistances in $n$-node $m$-edge undirected, expander graphs. We provide an $\widetilde{O}(m\epsilon^{-1})$-time algorithm that produces with high…
This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…
Simplifications of a result from a prior paper concerning the electric resistance between points in a distance-regular graph are given. In particular, we prove that the maximal resistance between points is bounded by twice the resistance…
We present a framework for performing efficient regression in general metric spaces. Roughly speaking, our regressor predicts the value at a new point by computing a Lipschitz extension --- the smoothest function consistent with the…
Electrical Resistivity Tomography (ERT) is increasingly used to study subsurface hydrological processes. It shows promising potential for estimating soil water content, a key but challenging property to quantify. However, converting the…
Exploratory Landscape Analysis (ELA) provides numerical features for characterizing black-box optimization problems. In high-dimensional settings, however, ELA suffers from sparsity effects, high estimator variance, and the prohibitive cost…
We introduce the epidemic quasimetric on graphs and study its behavior with respect to clustering techniques. In particular we compare its behavior to known objects such as the graph distance, effective resistance, and modulus of path…
We explicitly compute the effective resistances between any two vertices of a ladder graph by using circuit reductions. Using our findings, we obtain explicit formulas for Kirchhoff index and admissible invariants of a ladder graph…
We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean spaces. Of special interest are the Method of Alternating Projections (MAP) and the Douglas-Rachford or Averaged Alternating Reflection Algorithm…
Soft, porous mechanical metamaterials exhibit pattern transformations that may have important applications in soft robotics, sound reduction and biomedicine. To design these innovative materials, it is important to be able to simulate them…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
A theoretical approach has been undertaken in order to model the thermodynamic equilibrium of a vesicle adhering to a flat substrate. The vesicle is treated in a canonical description with a fixed number of sites. A finite number of these…
We study the spectral implications of re-weighting a graph by the $\ell_\infty$-Lewis weights of its edges. Our main motivation is the ER-Minimization problem (Saberi et al., SIAM'08): Given an undirected graph $G$, the goal is to find…
In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. (*) Panchromatic Graphs: For fixed integer k, a k-panchromatic graph is, roughly speaking, a…
Registering an object shape to a sequence of point clouds undergoing non-rigid deformation is a long-standing challenge. The key difficulties stem from two factors: (i) the presence of local minima due to the non-convexity of registration…
We construct a theory to introduce the concept of topologically robust exceptional points (EP). Starting from an ordered system with $N$ elements, we find the necessary condition to have the highest order exceptional point, namely…