Related papers: A variational principle for a non-integrable model
In this survey we talk about what is known as Invariance Principle in dynamical systems. It states that the disintegration of measures with zero center Lyapunov exponents admits some extra invariance by holonomies. We focus on explaining…
A variational principle is further developed for out of equilibrium dynamical systems by using the concept of maximum entropy. With this new formulation it is obtained a set of two first-order differential equations, revealing the same…
We consider gradient models on the lattice $Z^d$. These models serve as effective models for interfaces and are also known as continuous Ising models. The height of the interface is modelled by a random field with an energy which is a…
We develop a quenched thermodynamic formalism for a wide class of random maps with non-uniform expansion, where no Markov structure, no uniformly bounded degree or the existence of some expanding dynamics is required. We prove that every…
We obtain a unified theory of discrete minimal surfaces based on discrete holomorphic quadratic differentials via a Weierstrass representation. Our discrete holomorphic quadratic differential are invariant under M\"{o}bius transformations.…
Using the weak convergence approach to large deviations, we formulate and prove the large deviation principle (LDP) for W-random graphs in the cut-norm topology. This generalizes the LDP for Erd\H{o}s-R{\' e}nyi random graphs by Chatterjee…
Quantifying the complexity of large graphs requires measures that extend beyond predefined structural features and scale efficiently with graph size. This work adopts a generative perspective, modeling large networks as exchangeable graphs…
We study counting statistics of number of transitions in a stochastic process. For mesoscopic systems, a path integral formulation for the counting statistics has already been derived. We here show that it is also possible to derive the…
In this work, we propose a multiscale approach for a nonstandard higher-order PDE based on the $p(\cdot)$-Kirchhoff energy. First, we consider a topological gradient approach for a semilinear case in order to detect important object of…
A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…
It is shown that a variety of deterministic cellular automaton models of highway traffic flow obey a variational principle which states that, for a given car density, the average car flow is a non-decreasing function of time. This result is…
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…
Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing metric regularity of a (set-valued) mapping. First, we demonstrate that one should always use directly the so-called general…
We present an intuitive diagrammatic representation of a new class of integrable $\s$-models. It is shown that to any given diagram corresponds an integrable theory that couples $N$ WZW models with a certain number of each of the following…
Galilean invariance is a cornerstone of classical mechanics. It states that for closed systems the equations of motion of the microscopic degrees of freedom do not change under Galilean transformations to different inertial frames. However,…
We present a sequential sampling methodology for weakly structural Markov laws, arising naturally in a Bayesian structure learning context for decomposable graphical models. As a key component of our suggested approach, we show that the…
Probabilistic dependency graphs (PDGs) are a flexible class of probabilistic graphical models, subsuming Bayesian Networks and Factor Graphs. They can also capture inconsistent beliefs, and provide a way of measuring the degree of this…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
Randomising networks using a naive `accept-all' edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities for…
We propose a method for inferring the conditional indepen- dence graph (CIG) of a high-dimensional discrete-time Gaus- sian vector random process from finite-length observations. Our approach does not rely on a parametric model (such as,…