Related papers: Discrete complex analysis on isoradial graphs
We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…
While discrete harmonic functions have been objects of interest for quite some time, this is not the case for discrete polyharmonic functions, as appear for instance in the asymptotics of path counting problems. In this article, a novel…
We study Poisson structures over singular varieties. In this purpose, we consider the Koszul complex associated to the equations of a complete intersection. This complex forms a differential graded algebra which is equivalent to the algebra…
We prove weak approximation for isotrivial families of rationally connected varieties defined over the function field of a smooth projective complex curve.
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
We prove the universality of correlation functions of chiral unitary and unitary ensembles of random matrices in the microscopic limit. The essence of the proof consists in reducing the three-term recursion relation for the relevant…
We study a discrete-to-continuous Gamma-limit of a family of high-contrast double porosity type functionals defined on a scaled integer lattice. Under periodicity and p-growth conditions we prove the homogenization result and describe the…
We study the map from conductances to edge energies for harmonic functions on finite graphs with Dirichlet boundary conditions. We prove that for any compatible acyclic orientation and choice of energies there is a unique choice of…
We present an analog to classic potential theory on weighted graphs. With nodes partitioned into exterior, boundary and interior nodes and an appropriate decomposition of the Laplacian, we define discrete analogues to the trace operators,…
We apply the topology of convergence on compact sets to define unpredictable functions [5, 6]. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and…
We derive an exact path integral formulation for the partition function for the Ising model using a mapping between spins and poles of a Laurent expansion for a field on the complex plane. The advantage in using this formulation for the…
We study the stochastic dynamics of Ising spin models with random bonds, interacting on finitely connected Poissonnian random graphs. We use the dynamical replica method to derive closed dynamical equations for the joint spin-field…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
The result of performing integrations over connection type variables in the path integral for the discrete field theory may be poorly defined in the case of non-compact gauge group with the Haar measure exponentially growing in some…
We compute the automorphism groups of the Torelli complex and the complex of separating curves for all but finitely many compact orientable surfaces. As an application, we show that the abstract commensurators of the Torelli group and the…
Strictly proper kernel scores are well-known tool in probabilistic forecasting, while characteristic kernels have been extensively investigated in the machine learning literature. We first show that both notions coincide, so that insights…
In this work, following the Discrete de Rham (DDR) paradigm, we develop an arbitrary-order discrete divdiv complex on general polyhedral meshes. The construction rests 1) on discrete spaces that are spanned by vectors of polynomials whose…