Related papers: A Diagrammatic Equation for Oriented Planar Graphs
We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph $\Gamma^{\square}(n,k,q)$ as follows: the…
For any orthogonal polynomials system on real line we construct an appropriate oscillator algebra such that the polynomials make up the eigenfunctions system of the oscillator hamiltonian. The general scheme is divided into two types: a…
A covariant non-local extention if the stationary Schr\"odinger equation is presented and it's solution in terms of Heisenbergs's matrix quantum mechanics is proposed. For the special case of the Riesz fractional derivative, the calculation…
In the broad range of studies related to quantum graphs, quantum graph spectra appear as a topic of special interest. They are important in the context of diffusion type problems posed on metric graphs. Theoretical findings suggest that…
In this paper the one-dimensional nonparaxial nonlinear Schr\"odinger equation is considered. This was proposed as an alternative to the classical nonlinear Schr\"odinger equation in those situations where the assumption of paraxiality may…
We introduce a complex-plane generalization of the consecutive level-spacing distribution, used to distinguish regular from chaotic quantum spectra. Our approach features the distribution of complex-valued ratios between nearest- and…
We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal distributions in a mathematically substantiated way, and to…
This paper presents foundational theoretical results on distributed parameter estimation for undirected probabilistic graphical models. It introduces a general condition on composite likelihood decompositions of these models which…
We propose a novel and systematic method for coarse-graining oscillator networks described by phase equations. Our coarse-graining method enables us to obtain the closed coarse-grained equations for a few effective eigenmodes, which is…
The algorithm for generation of exact solutions of the nonlinear equation in partial derivatives of a divergent type which is included in the formulation of magnetostatics, hydro-and aerodynamics, quantum mechanics (stationary Schr\"odinger…
Recently, the author has proposed a generalization of the matrix and vector models approach to the theory of random surfaces and polymers. The idea is to replace the simple matrix or vector (path) integrals by gauge theory or non-linear…
We consider a class of non-linear dynamics on a graph that contains and generalizes various models from network systems and control and study convergence to uniform agreement states using gradient methods. In particular, under the…
Two criteria for planarity of a Feynman diagram upon its propagators (momentum flows) are presented. Instructive Mathematica programs that solve the problem and examples are provided. A simple geometric argument is used to show that while…
We present a novel general framework to deal with forward and backward components of the electromagnetic field in axially-invariant nonlinear optical systems, which include those having any type of linear or nonlinear transverse…
We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for this problem, which may produce drawings with exponential…
In \emph{smooth orthogonal layouts} of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this paper, we study the problem of finding smooth orthogonal…
Matrix field theory is a combinatorially non-local field theory which has recently been found to be a non-trivial but solvable QFT example. To generalize such non-perturbative structures to other models, a more combinatorial understanding…
Dyadic lattice graphs and their duals are commonly used as discrete approximations to the hyperbolic plane. We use them to give examples of random rooted graphs that are stationary for simple random walk, but whose duals have only a…
Pairwise Markov Random Fields (MRFs) or undirected graphical models are parsimonious representations of joint probability distributions. Variables correspond to nodes of a graph, with edges between nodes corresponding to conditional…
In this work, we present a new diagrammatic method for computing the effective Hamiltonian of driven nonlinear oscillators. At the heart of our method is a self-consistent perturbation expansion developed in phase space, which establishes a…