Related papers: A Diagrammatic Equation for Oriented Planar Graphs
The paper concerns parameterized equilibria governed by generalized equations whose multivalued parts are modeled via regular normals to nonconvex conic constraints. Our main goal is to derive a precise pointwise second-order formula for…
In this paper, we study the \textsf{Planar Disjoint Paths} problem: Given an undirected planar graph $G$ with $n$ vertices and a set $T$ of $k$ pairs $(s_i,t_i)_{i=1}^k$ of vertices, the goal is to find a set $\mathcal P$ of $k$ pairwise…
We investigate the Polchinski ERG equation for d-dimensional O(N) scalar field theory. In the context of the non-perturbative derivative expansion we find families of regular solutions and establish their relation with the physical fixed…
Ordinary Differential Equations are a simple but powerful framework for modeling complex systems. Parameter estimation from times series can be done by Nonlinear Least Squares (or other classical approaches), but this can give…
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
We provide a graphical calculus for computing averages of tensor network diagrams with respect to the distribution of random vectors containing independent uniform complex phases. Our method exploits the order structure of the partially…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…
We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in…
We formulate a renormalization group approach to a general nonlinear oscillator problem. The approach is based on the exact group law obeyed by solutions of the corresponding ordinary differential equation. We consider both the autonomous…
We provide global gradient estimates for solutions to a general type of nonlinear parabolic equations, possibly in a Riemannian geometry setting. Our result is new in comparison with the existing ones in the literature, in light of the…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
We consider a time-fractional parabolic equation of doubly nonlinear type, featuring nonlinear terms both inside and outside the differential operator in time. The main nonlinearities are maximal monotone graphs, without restrictions on the…
A probabilistic method is derived for solution of ohmic circuit problems. It is compared to the standard approach, which is construction and solution of a set of coupled, linear equations manifesting Kirchhoff's laws. An example is made of…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic mathematical theory of such equations exists, it has not been…
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a…