SearcharxivSearch

arXiv · 2603.14776

Discrete Gaussian Free Field via Hadamard's formula

Abstract

We present a novel way of constructing the Gaussian Free Field on a weighted graph via a dynamical expansion of the Green function along an expanding family of subgraphs. Along the way we obtain the discrete analogue of the classical Hadamard variational formula regarding the variation of the Green function under infinitesimal variations of the domain. In order to develop necessary machinery we construct expanding bases of the naturally associated energy spaces. An interesting observation is that both our discrete Hadamard variation formula and and the related construction of the discrete Gaussian Free Field are completely dimension-free and do not require smoothness of any kind. The graph model contains geometric information via the edges which supply the discrete topological information, and by conductances which give metric information. Going to a continuum limit, we would then obtain continuous version of the Hadamard variational formula and the associated Hadamard operator in e.g. fractal geometries of arbitrary dimension.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haakan Hedenmalm, Pavel Mozolyako, Daniil Panov. 2026-03-16. Discrete Gaussian Free Field via Hadamard's formula. https://arxiv.org/abs/2603.14776

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR