Related papers: Reconstruction for the Asymmetric Ising Model on R…
The reconstruction problem on the tree has been studied in numerous contexts including statistical physics, information theory and computational biology. However, rigorous reconstruction thresholds have only been established in a small…
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the first exact reconstruction threshold obtained in roughly a…
It is well known that reconstruction problems, as the interdisciplinary subject, have been studied in numerous contexts including statistical physics, information theory and computational biology, to name a few. We consider a $2q$-state…
In this paper, we consider a broadcasting process in which information is propagated from a given root node on a noisy tree network, and answer the question that whether the symbols at the nth level of the tree contain non-vanishing…
We give a criterion of the form Q(d)c(M)<1 for the non-reconstructability of tree-indexed q-state Markov chains obtained by broadcasting a signal from the root with a given transition matrix M. Here c(M) is an explicit function, which is…
Consider an information source generating a symbol at the root of a tree network whose links correspond to noisy communication channels, and broadcasting it through the network. We study the problem of reconstructing the transmitted symbol…
We consider the Ising model on a general tree under various boundary conditions: all plus, free and spin-glass. In each case, we determine when the root is influenced by the boundary values in the limit as the boundary recedes to infinity.…
Consider a Markov chain $(\xi_v)_{v \in V} \in [k]^V$ on the infinite $b$-ary tree $T = (V,E)$ with irreducible edge transition matrix $M$, where $b \geq 2$, $k \geq 2$ and $[k] = \{1,...,k\}$. We denote by $L_n$ the level-$n$ vertices of…
Motivated by the theory of spin-glasses in physics, we study the so-called reconstruction problem for the related distributions on the tree, and on the sparse random graph $G(n,d/n)$. Both cases, reduce naturally to studying broadcasting…
The Ising antiferromagnet is an important statistical physics model with close connections to the {\sc Max Cut} problem. Combining spatial mixing arguments with the method of moments and the interpolation method, we pinpoint the replica…
We study the fixed-magnetization ferromagnetic Ising model on random $d$-regular graphs for $d\ge 3$ and inverse temperature below the tree reconstruction threshold. Our main result is that for each magnetization $\eta$, the free energy…
Partition functions are an important research object in combinatorics and mathematical physics [Barvinok, 2016]. In this work, we consider the partition function of the Ising antiferromagnet on random regular graphs and characterize its…
We investigate the mixed spin-$(s,\tfrac12)$ Ising model on a Cayley tree of order three ($k=3$), extending the approach of \cite{Akin2024}. For the representative case $s=5$, the associated recursion leads to an 11-dimensional dynamical…
We consider the task of learning Ising models when the signs of different random variables are flipped independently with possibly unequal, unknown probabilities. In this paper, we focus on the problem of robust estimation of…
We consider noisy binary channels on regular trees and introduce periodic enhancements consisting of locally self-correcting the signal in blocks without break of the symmetry of the model. We focus on the realistic class of within-descent…
We consider the stochastic dynamics near zero-temperature of the random ferromagnetic Ising model on a Cayley tree of branching ratio $K$. We apply the Boundary Real Space Renormalization procedure introduced in our previous work (C.…
We consider an Ising model on the Cayley tree $\Gamma_k$ of arbitrary order $k\ge1$ with three spin species of values $(\tfrac12,1,\tfrac32)$ distributed deterministically with period three along the generations. Within the framework of…
Strong Disorder Renormalization for the Random Transverse Field Ising model leads to a complicated topology of surviving clusters as soon as $d>1$. Even if one starts from a Cayley tree, the network of surviving renormalized clusters will…
We consider a branching random walk with binary state space and index set $T^k$, the infinite rooted tree in which each node has k children (also known as the model of "broadcasting on a tree"). The root of the tree takes a random value 0…
We solve the growing asymmetric Ising model [Phys. Rev. E 89, 012105 (2014)] in the topologies of deterministic and stochastic (random) scale-free trees predicting its non-monotonous behavior for external fields smaller than the coupling…