Related papers: Zero-one laws for binary random fields
The zero forcing number $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ with colored (black) vertices which forces the set $V(G)$ to be colored (black) after some times. "color change rule": a white vertex is changed to a…
Starting from the operator algebra of the (1+1)D Ising model on a spatial lattice, this paper explicitly constructs a subalgebra of smooth operators that are natural candidates for continuum fields in the scaling limit. At the critical…
We investigate the validity of the Liouville property for a class of elliptic equations with a potential, posed on infinite graphs. Under suitable assumptions on the graph and on the potential, we prove that the unique bounded solution is…
In this paper, we prove that for every positive $\varepsilon$, there exists an $\alpha\in(1/(k-1),1/(k-1)+\varepsilon)$ such that the binomial random graph $G(n,n^{-\alpha})$ does not obey 0-1 law w.r.t. first order sentences with k…
We study limit theorems in the context of random perturbations of dispersing billiards in finite and infinite measure. In the context of a planar periodic Lorentz gas with finite horizon, we consider random perturbations in the form of…
We consider a zero-field Ising model defined on a quasiperiodic graph, the so-called Labyrinth tiling. Exact information about the critical behaviour is obtained from duality arguments and the subclass of models which yield commuting…
An existence result is presented for the worst-case error of lattice rules for high dimensional integration over the unit cube, in an unanchored weighted space of functions with square-integrable mixed first derivatives. Existing studies…
We discuss a gauged XY model a $\theta$-term on an arbitrary lattice in 1+1 dimensions, and show that the theory reduces exactly to the 2d Ising model on the dual lattice in the limit of the strong gauge coupling, provided that the…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
In this paper, we study two problems related to planar matchings in random bipartite graphs. First, we colour each edge of the complete bipartite graph $K_{n,n}$ uniformly randomly from amongst ${r}$ colours and show that if ${r}$ grows…
The ground state critical properties of the Random Field Ising Model (RFIM) on the diamond hierarchical lattice are investigated via a combining method encompassing real space renormalization group and an exact recurrence procedure. The…
Recently, it has been shown that, when the dimension of a graph turns out to be infinite dimensional in a broad sense, the upper critical surface and the corresponding critical behavior of an arbitrary Ising spin glass model defined over…
Zero forcing parameters, associated with graphs, have been studied for over a decade, and have gained popularity as the number of related applications grows. In particular, it is well-known that such parameters are related to certain vertex…
Motivated in part by an observation that the zero forcing number for the complement of a tree on $n$ vertices is either $n-3$ or $n-1$ in one exceptional case, we consider the zero forcing number for the complement of more general graphs…
We consider an inverse problem for Schr\"odinger operators on a connected equilateral graph $G$ with standard matching conditions. The graph $G$ consists of at least two odd cycles glued together at a common vertex. We prove an Ambarzumian…
A graphon is said to have the $H$-property if a random undirected graph $G_n$ on $n$ nodes sampled from it has a node-wise disjoint cycle cover almost surely as $n\to\infty$. It has been shown in the earlier work that the $H$-property obeys…
We study a model of random graph where vertices are $n$ i.i.d. uniform random points on the unit sphere $S^d$ in $\mathbb{R}^{d+1}$, and a pair of vertices is connected if the Euclidean distance between them is at least $2- \epsilon$. We…
The purpose of this paper is to present a mathematical theory that can be used as a foundation for statistics that include improper priors. This theory includes improper laws in the initial axioms and has in particular Bayes theorem as a…
We consider graphs with vertices of degree 1 or 2 and prove that the numbers of components of sizes 2 to q have a limit normal distribution for any q > 1. The result is also extended to multigraphs.
We show that the flat chaotic analytic zero points (i.e. zeroes of a random entire function whose Taylor coefficients are independent complex-valued Gaussian random variables, and the variance of the k-th coefficient is 1/k!) can be…