Related papers: A Diagrammatic Equation for Oriented Planar Graphs
Our primary motivation is existence and uniqueness for the obstacle problem on graphs. That is, we look for unique solutions to the problem $Lu = \chi_{\{u>0\}}$, where $L$ is the Laplacian matrix associated to a graph, and $u$ is a…
In this paper, we look at a probabilistic approach to a non-local quadratic form that has lately attracted some interest. This form is related to a recently introduced non-local normal derivative. The goal is to construct two Markov…
We show how to compute for $n$-vertex planar graphs in $O(n^{11/6}{\rm polylog}(n))$ expected time the diameter and the sum of the pairwise distances. The algorithms work for directed graphs with real weights and no negative cycles. In…
In this paper, we consider a biharmonic equation with respect to the Dirichlet problem on a domain of a locally finite graph. Using the variation method, we prove that the equation has two distinct solutions under certain conditions.
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
Given a dynamic graph subject to insertions and deletions of edges, a natural question is whether the graph presently admits a planar embedding. We give a deterministic fully-dynamic algorithm for general graphs, running in amortized…
For a linear ODE with indeterminate coefficients, we explicitly exhibit a fundamental system of solutions, in terms of the coefficients. We show that the generalized Wronskians of the fundamental system are given by an action of the Schur…
In this paper, we present finite element approximations of a class of Generalized random fields defined over a bounded domain of R d or a smooth d-dimensional Riemannian manifold (d $\ge$ 1). An explicit expression for the covariance matrix…
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching…
Quantum splines are curves in a Hilbert space or, equivalently, in the corresponding Hilbert projective space, which generalize the notion of Riemannian cubic splines to the quantum domain. In this paper, we present a generalization of this…
Exponential random graph theory is the complex network analog of the canonical ensemble theory from statistical physics. While it has been particularly successful in modeling networks with specified degree distributions, a naive model of a…
Quantum graphs have recently been introduced as model systems to study the spectral statistics of linear wave problems with chaotic classical limits. It is proposed here to generalise this approach by considering arbitrary, directed graphs…
This paper proposes a $C^{0}$ (non-Lagrange) primal finite element approximation of the linear elliptic equations in non-divergence form with oblique boundary conditions in planar, curved domains. As an extension of [Calcolo, 58 (2022), No.…
Prior to the parallel solution of a large linear system, it is required to perform a partitioning of its equations/unknowns. Standard partitioning algorithms are designed using the considerations of the efficiency of the parallel…
Hermitian symplectic spaces provide a natural framework for the extension theory of symmetric operators. Here we show that hermitian symplectic spaces may also be used to describe the solution to the factorisation problem for the scattering…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an \emph{orthogonal representation} that describes the desired…
The planar filament equation and its relation to the modified Korteweg-deVries equation are studied in the context of Poisson geometry. The structure of the planar filament equation is shown to be similar to that of the 3-D localized…
Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…
In this paper, we study orthogonal representations of simple graphs $G$ in $\mathbb{R}^d$ from an algebraic perspective in case $d = 2$. Orthogonal representations of graphs, introduced by Lov\'asz, are maps from the vertex set to…