Related papers: Discrete complex analysis on isoradial graphs
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
Given a graph $G$, we form a random subgraph $G_p$ by including each edge of $G$ independently with probability $p$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite…
In these notes we consider power series representations of functions on the unit disk in the complex plane which define harmonic and holomorphic functions and related matters concerning boundary values, Poisson kernels, and so on.
Piecewise-linear (PL) Morse theory and discrete Morse theory are used in shape analysis tasks to investigate the topological features of discretized spaces. In spite of their common origin in smooth Morse theory, various notions of critical…
We introduce a new way to sample inhomogeneous random graphs designed to have a lot of flexibility in the assignment of the degree sequence and the individual edge probabilities while remaining tractable. To achieve this we run a Poisson…
Studies of the Deep Inelastic Scattering (DIS) have provided fundamental information of the nucleon structure for decades. The electron-ion collider (EIC) will be the first collider capable of DIS study with both polarized lepton and…
It is widely believed that the celebrated 2D Ising model at criticality has a universal and conformally invariant scaling limit, which is used in deriving many of its properties. However, no mathematical proof of universality and conformal…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
An isoradial graph is a planar graph in which each face is inscribable into a circle of common radius. We study the 2-dimensional perfect matchings on a bipartite isoradial graph, obtained from the union of an isoradial graph and its…
In this pedagogical paper we review the discrete symmetries of the Dirac equation using elementary tools, but in a comparative order: the usual 3 + 1 dimensional case and the 2 + 1 dimensional case. Motivated by new applications of the 2d…
We prove a spectral decomposition theorem for a well-known self-similar graph, for some finite graphs which are quotients of this graph and for a compactification of it.
We characterize the generating function of bipartite planar maps counted according to the degree distribution of their black and white vertices. This result is applied to the solution of the hard particle and Ising models on random planar…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
We consider the range of random analytic functions with finite radius of convergence. We show that any unbounded random Taylor series with rotationally invariant coefficients has dense image in the plane. We moreover show that if in…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
H. Widom derived formulae expressing correlation functions of orthogonal and symplectic ensembles of random matrices in terms of orthogonal polynomials (H. Widom. J. Stat. Phys. 94, (1999) 347-363). We obtain similar results for discrete…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models,…