Related papers: Discrete complex analysis on isoradial graphs
We develop a linear theory of discrete complex analysis on general quad-graphs, continuing and extending previous work of Duffin, Mercat, Kenyon, Chelkak and Smirnov on discrete complex analysis on rhombic quad-graphs. Our approach based on…
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…
Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs…
We study various mathematical aspects of discrete models on graphs, specifically the Dimer and the Ising models. We focus on proving gluing formulas for individual summands of the partition function. We also obtain partial results regarding…
We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…
Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…
We prove a number of double-sided estimates relating discrete counterparts of several classical conformal invariants of a quadrilateral: cross-ratios, extremal lengths and random walk partition functions. The results hold true for any…
We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…
Based on the classical Pl\"ucker correspondence, we present algebraic and geometric properties of discrete integrable line complexes in $CP^3$. Algebraically, these are encoded in a discrete integrable system which appears in various guises…
We investigate properties of the set of discrete Morse functions on a simplicial complex as defined by Forman. It is not difficult to see that the pairings of discrete Morse functions of a finite simplicial complex again form a simplicial…
Given a sequence of regular planar domains converging in the sense of kernel, we prove that the corresponding Green's functions converge uniformly on the complex sphere, provided the limit domain is also regular, and the connectivity is…
We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of…
The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising…
Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
We study structural properties and the harmonic analysis of discrete subgroups of the Euclidean group. In particular, we 1. obtain an efficient description of their dual space, 2. develop Fourier analysis methods for periodic mappings on…
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…
We define a new theory of discrete Riemann surfaces and present its basic results. The key idea is to consider not only a cellular decomposition of a surface, but the union with its dual. Discrete holomorphy is defined by a straightforward…
We derive the Green's functions (concentrated force and couple in an infinite space) for the isotropic planar relaxed micromorphic model. Since the relaxed micromorphic model particularises into the microstretch, Cosserat (micropolar),…