Related papers: A Diagrammatic Equation for Oriented Planar Graphs
We solve a supersymmetric matrix model with a general potential. While matrix models usually describe surfaces, supersymmetry enforces a cancellation of bosonic and fermionic loops and only diagrams corresponding to so-called branched…
We provide first order perturbation formulas for the matrix square root (in the positive semi-definite case) and the matrix modulus (in the general case). The results are new for singular matrices, and extend previously known Fr\'{e}chet…
We consider the hermitian random matrix model with external source and general polynomial potential, when the source has two distinct eigenvalues but is otherwise arbitrary. All such models studied so far have a common feature: an…
Undirected graphs can be used to describe matrix variate distributions. In this paper, we develop new methods for estimating the graphical structures and underlying parameters, namely, the row and column covariance and inverse covariance…
In the article we propose a general scheme for solutions of some approximation problems under a rather general setting. We illustrate the application of the proposed scheme by a series of examples, in particular we show that many results in…
Starting from the density-matrix equation of motion, we derive a semiclassical kinetic equation for a general two-band electronic Hamiltonian, systematically including quantum-mechanical corrections up to second order in space-time…
Let $G$ be a planar $3$-graph (i.e., a planar graph with vertex degree at most three) with $n$ vertices. We present the first $O(n^2)$-time algorithm that computes a planar orthogonal drawing of $G$ with the minimum number of bends in the…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
We consider solving a probably ill-conditioned linear operator equation, where the operator is not modeled by physical laws but is specified via training pairs (consisting of images and data) of the input-output relation of the operator. We…
We propose a new numerical domain decomposition method for solving elliptic equations on compact Riemannian manifolds. One advantage of this method is its ability to bypass the need for global triangulations or grids on the manifolds.…
We propose a penalized pseudo-likelihood criterion to estimate the graph of conditional dependencies in a discrete Markov random field that can be partially observed. We prove the convergence of the estimator in the case of a finite or…
A planar orthogonal drawing {\Gamma} of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and…
A theorem that constructs a path integral solution for general second order partial differential equations is specialized to obtain path integrals that are solutions of elliptic, parabolic, and hyperbolic linear second order partial…
We prove the following theorem. Given a planar graph $G$ and an integer $k$, it is possible in polynomial time to randomly sample a subset $A$ of vertices of $G$ with the following properties: (i) $A$ induces a subgraph of $G$ of treewidth…
Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schr\"odinger Hamiltonians on metric graphs, with a focus on results related to…
We study linear ordinary differential equations which are analytically parametrized on Hermitian symmetric spaces and invariant under the action of symplectic groups. They are generalizations of the classical Lam\'e equation. Our main…
We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…
We present a boundary element method to compute numerical approximations to the non-linear Molodensky problem, which reconstructs the surface of the earth from the gravitational potential and the gravity vector. Our solution procedure…
A linear ordinary differential equation is called algebraic if all its solution are algebraic over its field of definition. In this paper we solve the problem of finding closed form solution to algebraic linear ordinary differential…
We study parameterisation-independent closed planar curve matching as a Bayesian inverse problem. The motion of the curve is modelled via a curve on the diffeomorphism group acting on the ambient space, leading to a large deformation…