Related papers: Deducing a variational principle with minimal a pr…

A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…

We establish a large deviation principle (LDP) for probability graphons, which are symmetric functions from the unit square into the space of probability measures. This notion extends classical graphons and provides a flexible framework for…

We study a topologically exact, negative Schwarzian unimodal map whose critical point is non-recurrent and flat. Assuming the critical order is either logarithmic or polynomial, we establish the Large Deviation Principle and give a partial…

In this work, we propose a global model selection criterion to estimate the graph of conditional dependencies of a random vector based on a finite sample. By global criterion, we mean optimizing a function over the entire set of possible…

A variation principle for mass transport in solids is derived that recasts transport coefficients as minima of local thermodynamic average quantities. The result is independent of diffusion mechanism, and applies to amorphous and…

We consider sufficient conditions for the existence of $k$-th powers of Hamiltonian cycles in $n$-vertex graphs $G$ with minimum degree $\mu n$ for arbitrarily small $\mu>0$. About 20 years ago Koml\'os, Sark\"ozy, and Szemer\'edi resolved…

In the recent years, with the incorporation of contact geometry, there has been a renewed interest in the study of dissipative or non-conservative systems in physics and other areas of applied mathematics. The equations arising when…

A method to construct a geometric structure with the same solutions as a given variational principle is presented. The method applies to large families of variational principles. In particular, the known results that assign cosymplectic…

In this paper we explore maximal deviations of large random structures from their typical behavior. We introduce a model for a high-dimensional random graph process and ask analogous questions to those of Vapnik and Chervonenkis for…

In this article, we mainly obtain the Riemann-Hurwitz theorems for harmonic morphisms on (vertex-weighted) metric graphs or metrized complexes of algebraic curves, inspired of the recent work on harmonic morphisms of graphs or metrized…

What does an Erdos-Renyi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and…

Let the random variable $X\, :=\, e(\mathcal{H}[B])$ count the number of edges of a hypergraph $\mathcal{H}$ induced by a random $m$-element subset $B$ of its vertex set. Focussing on the case that the degrees of vertices in $\mathcal{H}$…

We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…

We study the dynamics of smooth interval maps with non-flat critical points. For every such a map that is topologically exact, we establish the full (level-2) Large Deviation Principle for empirical means. In particular, the Large Deviation…

We introduce a new family of closed differential forms naturally associated with minimal graphical submanifolds in Euclidean space, defined in arbitrary codimension. For each minimal graph, we construct an explicit closed form whose…

We prove several cases of Zimmer's conjecture for actions of higher-rank cocompact lattices on low dimensional manifolds. For example, if $\Gamma$ is a cocompact lattice in $\mathrm{Sl}(n, \mathbb R)$, $M$ is a compact manifold, and…

We introduce a correspondence principle (analogous to the Furstenberg correspondence principle) that allows one to extract an infinite random graph or hypergraph from a sequence of increasingly large deterministic graphs or hypergraphs. As…

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…

Robin Forman's highly influential 2002 paper A User's Guide to Discrete Morse Theory presents an overview of the subject in a very readable manner. As a proof of concept, the author determines the topology (homotopy type) of the abstract…

We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…