Related papers: Electrical varieties as vertex integrable statisti…
In this paper, we generalize a recently introduced Expectation Maximization (EM) method for graphs and apply it to content-based networks. The EM method provides a classification of the nodes of a graph, and allows to infer relations…
In this article we continue our investigations of one particle quantum scattering theory for Schroedinger operators on a set of connected (idealized one-dimensional) wires forming a graph with an arbitrary number of open ends. The…
The first and shorter part of this thesis deals with the structural assumption of invertibility in a Lie groupoid. When this assumption is dropped, we obtain the notion of a Lie category: a small category, endowed with a compatible…
In the first part, we introduce the notion of fractional statistics in the sense of Haldane. We illustrate it on simple models related to anyon physics and to integrable models solvable by the Bethe ansatz. In the second part, we describe…
We develop the shape derivative analysis of solutions to the problem of scattering of time-harmonic electromagnetic waves by a bounded penetrable obstacle. Since boundary integral equations are a classical tool to solve electromagnetic…
Boundary value problems on hedgehog-type graphs for Sturm-Liouville differential operators with general matching conditions are studied. We investigate inverse spectral problems of recovering the coefficients of the differential equation…
In the 1970s, Gy\H{o}ri and Lov\'{a}sz showed that for a $k$-connected $n$-vertex graph, a given set of terminal vertices $t_1, \dots, t_k$ and natural numbers $n_1, \dots, n_k$ satisfying $\sum_{i=1}^{k} n_i = n$, a connected vertex…
In most domains of network analysis researchers consider networks that arise in nature with weighted edges. Such networks are routinely dichotomized in the interest of using available methods for statistical inference with networks. The…
The network reconfiguration problem seeks to find a rooted tree $T$ such that the energy of the (unique) feasible electrical flow over $T$ is minimized. The tree requirement on the support of the flow is motivated by operational constraints…
We design two variational algorithms to optimize specific 2-local Hamiltonians defined on graphs. Our algorithms are inspired by the Quantum Approximate Optimization Algorithm. We develop formulae to analyze the energy achieved by these…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
We study spectra of alloy-type random Schr\"odinger operators on metric graphs. For finite edge subsets of general graphs we prove a Wegner estimate which is linear in the volume (i.e. the number of edges) and the length of the considered…
Stochastic network models play a central role across a wide range of scientific disciplines, and questions of statistical inference arise naturally in this context. In this paper we investigate goodness-of-fit and two-sample testing…
The Sturm-Liouville operator on a star-shaped graph is considered. We assume that the potential is known a priori on all the edges except one, and study the partial inverse problem, which consists in recovering the potential on the…
Any elliptic operator defines an automorphism on the orthogonal subspace to the eigenfunctions associated with the lowest eigenvalue, whose inverse is the orthogonal Green operator. In this study, we show that elliptic Schr\"{o}dinger…
We consider the ensemble of adjacency matrices of Erd\H{o}s-R\'{e}nyi random graphs, that is, graphs on $N$ vertices where every edge is chosen independently and with probability $p\equiv p(N)$. We rescale the matrix so that its bulk…
We study information matrices for statistical models by the $L^2$-Wasserstein metric. We call them Wasserstein information matrices (WIMs), which are analogs of classical Fisher information matrices. We introduce Wasserstein score functions…
We associate a deformation of Heisenberg algebra to the suitably normalized Yang $R$-matrix and we investigate its properties. Moreover, we construct new examples of quantum vertex algebras which possess the same representation theory as…
We use the averaged variational principle introduced in a recent article on graph spectra [7] to obtain upper bounds for sums of eigenvalues of several partial differential operators of interest in geometric analysis, which are analogues of…
We propose a classical analogue of the vertex algebra in the context of classical integrable field theories. We use this fundamental notion to describe the auxiliary function of the linear auxiliary problem as a classical vertex operator.…