Related papers: Local Statistics of Realizable Vertex Models
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
A basic issue in optimization, inverse theory,neural networks, computational chemistry and many other problems is the geometrical characterization of high dimensional functions. In inverse calculations one aims to characterize the set of…
We present a rather general method for proving local limit theorems, with a good rate of convergence, for sums of dependent random variables. The method is applicable when a Stein coupling can be exhibited. Our approach involves both…
This article presents a new search algorithm for the NP-hard problem of optimizing functions of binary variables that decompose according to a graphical model. It can be applied to models of any order and structure. The main novelty is a…
Recently, hypergraphs have attracted a lot of attention due to their ability to capture complex relations among entities. The insurgence of hypergraphs has resulted in data of increasing size and complexity that exhibit interesting…
A semi-parametric, non-linear regression model in the presence of latent variables is applied towards learning network graph structure. These latent variables can correspond to unmodeled phenomena or unmeasured agents in a complex system of…
We consider some aspects of a standard model employed in studies of many-body localization: interacting spinless fermions with quenched disorder, for non-zero filling fraction, here on $d$-dimensional lattices. The model may be recast as an…
This paper investigates probability density functions (PDFs) that are continuous everywhere, nearly uniform around the mode of distribution, and adaptable to a variety of distribution shapes ranging from bell-shaped to rectangular. From the…
Closure modeling - the statistical modeling of missing dynamics in the natural sciences and engineering - is a growing and active area of research. Existing methods for closure modeling are often computationally prohibitive, lack…
This note relates topics in statistical mechanics, graph theory and combinatorics, lattice quantum field theory, super quantum mechanics and string theory. We give a precise relation between the dimer model on a graph embedded on a torus…
We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator which generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined…
In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…
The Model-free Prediction Principle has been successfully applied to general regression problems, as well as problems involving stationary and locally stationary time series. In this paper we demonstrate how Model-Free Prediction can be…
Given a graph $G=(V,E)$, for a vertex set $S\subseteq V$, let $N(S)$ denote the set of vertices in $V$ that have a neighbor in $S$. Extending the concept of binding number of graphs by Woodall~(1973), for a vertex set $X \subseteq V$, we…
We present Monte Carlo simulations of an ultra coarse-grained lipid bilayer with different number of lipids on both leaflets. In the simulations, we employ a new method for measuring the elastic parameters of the membrane, including the…
A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…
This paper concerns periodic solutions for a 1D-model with nonlocal velocity given by the periodic Hilbert transform. There is a rich literature showing that this model presents singular behavior of solutions via numerics and mathematical…
We give one formulation of an algorithm of Hanany and Vegh which takes a lattice polygon as an input and produces a set of isoradial dimer models. We study the case of lattice triangles in detail and discuss the relation with coamoebas…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…