Related papers: Electrical varieties as vertex integrable statisti…
Many networked systems such as electric networks, the brain, and social networks of opinion dynamics are known to obey conservation laws. Examples of this phenomenon include the Kirchoff laws in electric networks and opinion consensus in…
Network topology inference is a cornerstone problem in statistical analyses of complex systems. In this context, the fresh look advocated here permeates benefits from convex optimization and graph signal processing, to identify the…
We investigate the $K$-theoretic Gysin map for type $A$ partial flag bundles from the viewpoint of integrability. We introduce several types of partition functions for one version of $q=0$ degeneration of $U_q(\widehat{sl_n})$ vertex models…
A new type of quantum transfer matrix, arising as a Cholesky factor for the steady state density matrix of a dissipative Markovian process associated with the boundary-driven Lindblad equation for the isotropic spin-1/2 Heisenberg (XXX)…
Quite often real-world networks can be thought of as being symmetric, in the abstract sense that vertices can be found to have similar or equivalent structural roles. However, traditional measures of symmetry in graphs are based on their…
The inverse spectral problem is studied for the Sturm-Liouville operator with a complex-valued potential and arbitrary entire functions in one of the boundary conditions. We obtain necessary and sufficient conditions for uniqueness, and…
We investigate the duality structure of quantum lattice systems with topological order, a collective order also appearing in fractional quantum Hall systems. We define electromagnetic (EM) duality for all of Kitaev's quantum double models…
We consider Sturm-Liouville operators on geometrical graphs without cycles (trees) with singular potentials from the class $W_2^{-1}$. We suppose that the potentials are known on a part of the graph, and study the so-called partial inverse…
We study the Yang-Baxter equation for the $R$-matrices of the six-vertex model. We analyze the solutions and give new parametrizations of the Yang-Baxter equation. In particular, we find the maximal commutative families of parametrized…
We study the solutions of the Yang-Baxter equation associated to nineteen vertex models invariant by the parity-time symmetry from the perspective of algebraic geometry. We determine the form of the algebraic curves constraining the…
We introduce a novel numerical framework for the exploration of Blaschke--Santal\'o diagrams, which are efficient tools characterizing the possible inequalities relating some given shape functionals. We introduce a parametrization of convex…
Topological invariants are fundamental characteristics reflecting global properties of quantum systems, yet their exploration has predominantly been limited to the static (DC) transport and transverse (Hall) channel. In this work, we extend…
Let $(G_n)_{n\geqslant 0}$ be a linear recurrence sequence defining a numeration system and satisfying mild structural hypotheses. For real-valued G-additive functions (additive in the greedy G-digits), we establish an…
Network detection is an important capability in many areas of applied research in which data can be represented as a graph of entities and relationships. Oftentimes the object of interest is a relatively small subgraph in an enormous,…
Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…
We introduce and study the domain wall boundary partition function of the integrable six-vertex model with triangular boundary. We first formulate the domain wall boundary partition function with triangular boundary by using the $U_q(sl_2)$…
We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…
Energy-based models (EBMs) are powerful probabilistic models, but suffer from intractable sampling and density evaluation due to the partition function. As a result, inference in EBMs relies on approximate sampling algorithms, leading to a…
We extend the latent position random graph model to the line graph of a random graph, which is formed by creating a vertex for each edge in the original random graph, and connecting each pair of edges incident to a common vertex in the…
Consider the real vector space of formal sums of non-empty, finite unoriented graphs without multiple edges and loops. Let the vertices of graphs be unlabelled but let every graph $\gamma$ be endowed with an ordered set of edges…