Related papers: Local Statistics of Realizable Vertex Models
Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…
We consider random graphs on the set of $N^2$ vertices placed on the discrete $2$-dimensional torus. The edges between pairs of vertices are independent, and their probabilities decay with the distance $\rho$ between these vertices as…
We study a simple geometric model for local transformations of bipartite graphs. The state consists of a choice of a vector at each white vertex made in such a way that the vectors neighboring each black vertex satisfy a linear relation.…
We study a random graph model in continuous time. Each vertex is partially copied with the same rate, i.e.\ an existing vertex is copied and every edge leading to the copied vertex is copied with independent probability $p$. In addition,…
The family of visibility algorithms were recently introduced as mappings between time series and graphs. Here we extend this method to characterize spatially extended data structures by mapping scalar fields of arbitrary dimension into…
Chatterjee, Diaconis and Sly (2011) recently established the consistency of the maximum likelihood estimate in the $\beta$-model when the number of vertices goes to infinity. By approximating the inverse of the Fisher information matrix, we…
We construct a class of spatially polynomial velocity fields that are exact solutions of the planar unsteady Navier-Stokes equation. These solutions can be used as simple benchmarks for testing numerical methods or verifying the feasibility…
We propose a duality between quiver gauge theories and the combinatorics of dimer models. The connection is via toric diagrams together with multiplicities associated to points in the diagram (which count multiplicities of fields in the…
We show that there is a deterministic local algorithm (constant-time distributed graph algorithm) that finds a 5-approximation of a minimum dominating set on outerplanar graphs. We show there is no such algorithm that finds a…
In this paper, we study the mechanics of statistically non-uniform two-phase elastic discrete structures. In particular, following the methodology proposed in (Luciano and Willis, Journal of the Mechanics and Physics of Solids 53,…
The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…
Model sets are projections of certain lattice subsets. It was realised by Moody that dynamical properties of such sets are induced from the torus associated with the lattice. We follow and extend this approach by studying dynamics on the…
We study the properties of the set of marginal distributions of infinite translation-invariant systems in the 2D square lattice. In cases where the local variables can only take a small number $d$ of possible values, we completely solve the…
Standard statistical mechanical or condensed matter arguments tell us that bulk properties of a physical system do not depend too much on boundary conditions. Random tilings of large regions provide counterexamples to such intuition, as…
The densest subgraph problem is a classic problem in combinatorial optimisation. Danisch, Chan, and Sozio propose a definition for \emph{local density} that assigns to each vertex $v$ a value $\rho^*(v)$. This local density is a…
The delta interaction at a vertex generalizes the Robin (generalized Neumann) boundary condition on an interval. Study of a single vertex with N infinite leads suffices to determine the localized effects of such a vertex on densities of…
We consider graphs made of one-dimensional wires connected at vertices and on which may live a scalar potential. We are interested in a scattering situation where the graph is connected to infinite leads. We investigate relations between…
In this paper, the dynamics of heuristic algorithms for constructing small vertex covers (or independent sets) of finite-connectivity random graphs is analysed. In every algorithmic step, a vertex is chosen with respect to its vertex…
The area of graph property testing seeks to understand the relation between the global properties of a graph and its local statistics. In the classical model, the local statistics of a graph is defined relative to a uniform distribution…
The theoretical models providing mathematical abstractions for several significant optimization problems in machine learning, combinatorial optimization, computer vision and statistical physics have intrinsic similarities. We propose a…