Related papers: Electrical networks and Lagrangian Grassmannians
Lagrangian and Hamiltonian neural networks (LNNs and HNNs, respectively) encode strong inductive biases that allow them to outperform other models of physical systems significantly. However, these models have, thus far, mostly been limited…
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\frac{1}{6}$ fraction of the triangular…
The pentagram map is a discrete integrable system first introduced by Schwartz in 1992. It was proved to be intregable by Schwartz, Ovsienko, and Tabachnikov in 2010. Gekhtman, Shapiro, and Vainshtein studied Poisson geometry associated to…
We discuss several parametrizations of the space of circular planar electrical networks. For any circular planar network we associate a canonical minimal network with the same response matrix, called a "standard" network. The conductances…
Analyzing and understanding the structure of complex relational data is important in many applications including analysis of the connectivity in the human brain. Such networks can have prominent patterns on different scales, calling for a…
There are numerous combinatorial objects associated to a Grassmannian permutation $w_\lambda$ that index cells of the totally nonnegative Grassmannian. We study several of these objects and their $q$-analogues in the case of permutations…
In this paper, we introduce the concept of completely positive matrix of linear maps on Hilbert $A$-modules over locally $C^{*}$-algebras and prove an analogue of Stinespring theorem for it. We show that any two minimal Stinespring…
Let $V$ and $V'$ be vector spaces of dimension $n$ and $n'$, respectively. Let $k\in\{2,...,n-2\}$ and $k'\in\{2,...,n'-2\}$. We describe all isometric and $l$-rigid isometric embeddings of the Grassmann graph $\Gamma_{k}(V)$ in the…
We show that a class of quasiregular Latt\`es maps, called orthotopic Latt\`es maps, are cellular Markov maps. This provides examples of expanding Thurston-type maps that are also uniformly quasiregular, and whose visual metrics are…
The introduction of relevant physical information into neural network architectures has become a widely used and successful strategy for improving their performance. In lattice gauge theories, such information can be identified with gauge…
The totally nonnegative Grassmannian $\mathrm{Gr}(k,n)_{\geq0}$ is the subset of the real Grassmannian $\mathrm{Gr}(k,n)$ consisting of points with all nonnegative Pl\"ucker coordinates. The circular Bruhat order is a poset isomorphic to…
This paper introduces Dirichlet matroids, a generalization of graphic matroids arising from electrical networks. We present four main theorems. First, we exhibit a matroid quotient involving geometric duals of networks embedded in surfaces…
Given a hypergraph G, we introduce a Grassmann algebra over the vertex set, and show that a class of Grassmann integrals permits an expansion in terms of spanning hyperforests. Special cases provide the generating functions for rooted and…
Given a set of cycles C of a graph G, the tree graph of G defined by C is the graph T(G,C) whose vertices are the spanning trees of G and in which two trees R and S are adjacent if the union of R and S contains exactly one cycle and this…
Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. Laplacian--like energy of a graph is newly proposed…
In this draft paper, we introduce a novel architecture for graph networks which is equivariant to the Euclidean group in $n$-dimensions. The model is designed to work with graph networks in their general form and can be shown to include…
We review a novel neural network architecture called lattice gauge equivariant convolutional neural networks (L-CNNs), which can be applied to generic machine learning problems in lattice gauge theory while exactly preserving gauge…
A rooted acyclic digraph N with labelled leaves displays a tree T when there exists a way to select a unique parent of each hybrid vertex resulting in the tree T. Let Tr(N) denote the set of all trees displayed by the network N. In general,…
The action of the cactus group $C_n$ on Young tableaux of a given shape $\lambda$ goes back to Berenstein and Kirillov and arises naturally in the study of crystal bases and quantum integrable systems. We show that this action is…
The subpath number of a graph G is defined as the total number of subpaths in G, and it is closely related to the number of subtrees, a well-studied topic in graph theory. This paper is a continuation of our previous paper [5], where we…