Related papers: Deducing a variational principle with minimal a pr…
We develop a new robust technique to deduce variance principles for non-integrable discrete systems. To illustrate this technique, we show the existence of a variational principle for graph homomorphisms from $\Z^m$ to a $d$-regular tree.…
We consider homogenization of random surfaces and study the variational principle for graph homomorphisms from subsets of $\mathbb{Z}^m$ into $\mathbb{Z}$, where the underlying uniform measure is perturbed by a random field. Motivated by…
At the core of the Robertson-Seymour theory of graph minors lies a powerful structure theorem which captures, for any fixed graph H, the common structural features of all the graphs not containing H as a minor. Robertson and Seymour prove…
A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…
Graph homomorphism has been an important research topic since its introduction [17]. Stated in the language of binary relational structures in that paper [17], Lov\'asz proved a fundamental theorem that, for a graph $H$ given by its $0$-$1$…
The problem of inferring the distribution of a random vector given that its norm is large requires modeling a homogeneous limiting density. We suggest an approach based on graphical models which is suitable for high-dimensional vectors. We…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…
Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph $G$ has certain properties, then it has a homomorphism to a triangle-free graph $\Gamma$ of bounded size". For example, bounds on…
We consider Riemann mappings from bounded Lipschitz domains in the plane to a triangle. We show that in this case the Riemann mapping has a linear variational principle: it is the minimizer of the Dirichlet energy over an appropriate affine…
Persistent homology is a cornerstone of topological data analysis, offering a multiscale summary of topology with robustness to nuisance transformations, such as rotations and small deformations. Persistent homology has seen broad use…
This paper investigates the use of methods from partial differential equations and the Calculus of variations to study learning problems that are regularized using graph Laplacians. Graph Laplacians are a powerful, flexible method for…
This article makes no claim to originality, other than, perhaps, the simple statement here called the {\it Abstract Maximum Principle}. Actually, the whole contents are strongly based on some H. Sussmann's and coauthors' papers, in which,…
We prove a moderate deviations principles for the size of the largest connected component in a random $d$-uniform hypergraph. The key tool is a version of the exploration process, that is also used to investigate the giant component of an…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
The purpose of the present paper is to establish moderate deviation principles for a rather general class of random variables fulfilling certain bounds of the cumulants. We apply a celebrated lemma of the theory of large deviations…
In this paper, we investigate whether Variational Principles can be associated with the Helmholtz equation subject to impedance (absorbing) boundary conditions. This model has been extensively studied in the literature from both…
In this paper, we study large and moderate deviation principles for stochastic partial differential equations (SPDEs) on metric graphs and their associated multiscale models via the weak convergence approach, providing a refined…
As a major step in their proof of Wagner's conjecture, Robertson and Seymour showed that every graph not containing a fixed graph $H$ as a minor has a tree-decomposition in which each torso is almost embeddable in a surface of bounded…
We establish a new connection between metric Diophantine approximation and the parametric geometry of numbers by proving a variational principle facilitating the computation of the Hausdorff and packing dimensions of many sets of interest…