Related papers: Zero-one laws for binary random fields

This paper explores various distributional aspects of random variables defined as the ratio of two independent positive random variables where one variable has an $\alpha$-stable law, for $0<\alpha<1$, and the other variable has the law…

In the many fields in which the Ising model is applied nowadays, the spin variables are often assumed to be of spin-class $\{-1,1\}$ or $\{0,1\}$, even though for any mix of binary real valued spin-classes a proper Ising model distribution…

We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for…

We compare the ``unified approach'' for the estimation of upper limits with an approach based on the Bayes theory, in the special case that no events are observed. The ``unified approach'' predicts, in this case, an upper limit that…

We consider the length of {\em ordered loose paths} in the random $r$-uniform hypergraph $H=H^{(r)}(n, p)$. A ordered loose path is a sequence of edges $E_1,E_2,\ldots,E_\ell$ where $\max\{j\in E_i\}=\min\{j\in E_{i+1}\}$ for $1\leq…

We study the problem of transforming a multi-way contingency table into an equivalent table with uniform margins and same dependence structure. This is an old question which relates to recent advances in copula modeling for discrete random…

The Burton--Keane theorem for the almost-sure uniqueness of infinite clusters is a landmark of stochastic geometry. Let $\mu$ be a translation-invariant probability measure with the finite-energy property on the edge-set of a…

Many statistical models have likelihoods which are intractable: it is impossible or too expensive to compute the likelihood exactly. In such settings, a common approach is to replace the likelihood with an approximation, and proceed with…

We study the rate of convergence to a normal random variable of the real and imaginary parts of Tr(AU), where U is an N x N random unitary matrix and A is a deterministic complex matrix. We show that the rate of convergence is O(N^{-2 +…

We study the random-field Ising model on a Dyson hierarchical lattice, where the interactions decay in a power-law-like form, $J(r)\sim r^{-\alpha}$, with respect to the distance. Without a random field, the Ising model on the Dyson…

In this paper, we prove the first-order convergence law for the uniform attachment random graph with almost all vertices having the same degree. In the considered model, vertices and edges are introduced recursively: at time $m+1$ we start…

In this paper we consider a Bayesian analysis of contingency tables allowing for the possibility that cells may have probability zero. In this sense we depart from standard log-linear modeling that implicitly assumes a positivity…

A set $Z$ of vertices of a graph $G$ is a zero forcing set of $G$ if initially labeling all vertices in $Z$ with $1$ and all remaining vertices of $G$ with $0$, and then, iteratively and as long as possible, changing the label of some…

The zero-temperature Ising model is known to reach a fully ordered ground state in sufficiently dense random graphs. In sparse random graphs, the dynamics gets absorbed in disordered local minima at magnetization close to zero. Here, we…

Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular…

Motivated by an evolutionary biology question, we study the following problem: we consider the hypercube $\{0,1\}^L$ where each node carries an independent random variable uniformly distributed on $[0,1]$, except $(1,1,\ldots,1)$ which…

We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…

Zero forcing is a one-player game played on a graph. The player chooses some set of vertices to color, then iteratively applies a color change rule: If all but one of a colored vertex's neighbors are colored, color (i.e. "force") the…

An exact expression for the spin-spin correlation function is derived for the zero-temperature random-field Ising model defined on a Bethe lattice of arbitrary coordination number. The correlation length describing dynamic spin-spin…

Semiring semantics evaluates logical statements by values in some commutative semiring K. Random semiring interpretations, induced by a probability distribution on K, generalise random structures, and we investigate here the question of how…