Related papers: Discrete complex analysis on isoradial graphs

We consider determinantal Coulomb gas ensembles with a class of discrete rotational symmetric potentials whose droplets consist of several disconnected components. Under the insertion of a point charge at the origin, we derive the…

We consider a kernel based harmonic analysis of "boundary," and boundary representations. Our setting is general: certain classes of positive definite kernels. Our theorems extend (and are motivated by) results and notions from classical…

We use some properties of orthogonal polynomials to provide a class of upper/lower variance bounds for a function $g(X)$ of an absolutely continuous random variable $X$, in terms of the derivatives of $g$ up to some order. The new bounds…

We achieve the multifractal analysis of a class of complex valued statistically self-similar continuous functions. For we use multifractal formalisms associated with pointwise oscillation exponents of all orders. Our study exhibits new…

In this paper, we study some useful properties of persistent pairs in a discrete Morse function on a simplicial complex $K$. In case of $\dim K=1$ (i.e., a graph), by using the properties, we characterize strongly connectedness of critical…

Noncommutative harmonic analysis is used to solve a nonparametric estimation problem stated in terms of compound Poisson processes on compact Lie groups. This problem of decompounding is a generalization of a similar classical problem. The…

We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…

We show that the Bergman, Szego, and Poisson kernels associated to a finitely connected domain in the plane are all composed of finitely many easily computed functions of one variable. The new formulas give rise to new methods for computing…

In this paper, we present a method for factor analysis of discrete data. This is accomplished by fitting a dependent Poisson model with a factor structure. To be able to analyze ordinal data, we also consider a truncated Poisson…

Two discretizations, linear and nonlinear, of basic notions of the complex analysis are considered. The underlying lattice is an arbitrary quasicrystallic rhombic tiling of a plane. The linear theory is based on the discrete Cauchy-Riemann…

We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many lattice conditions and isolate the new P-time tractable…

The goal of this note is to show that continuous functions may be approximated using scattered translates of the Poisson kernel.

This monograph is about discrete energy minimization for discrete graphical models. It considers graphical models, or, more precisely, maximum a posteriori inference for graphical models, purely as a combinatorial optimization problem.…

To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…

We prove a complete complexity classification theorem for the planar eight-vertex model. For every parameter setting in ${\mathbb C}$ for the eight-vertex model, the partition function is either (1) computable in P-time for every graph, or…

We provide a unified method to study the adjacency matrices of regular graphs (including infinite ones) using holomorphic functional calculus. By applying this calculus on a specific ellipse that contains the spectrum, we derive an…

A cluster expansion is proposed, that applies to both continuous and discrete systems. The assumption for its convergence involves an extension of the neat Kotecky-Preiss criterion. Expressions and estimates for correlation functions are…

I derive a formulation of the 2-dimensional critical Ising model on non-uniform simplicial lattices. Surprisingly, the derivation leads to a set of geometric constraints that a lattice must satisfy in order for the model to have a…

In this paper we introduce a class of polygonal complexes for which we can define a notion of sectional combinatorial curvature. These complexes can be viewed as generalizations of 2-dimensional Euclidean and hyperbolic buildings. We focus…

For a family of second-order elliptic operators with rapidly oscillating periodic coefficients, we study the asymptotic behavior of the Green and Neumann functions, using Dirichlet and Neumann correctors. As a result we obtain asymptotic…