相关论文: Reconstruction thresholds on regular trees
We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
The problem of reconstructing a sequence of independent and identically distributed symbols from a set of equal size, consecutive, fragments, as well as a dependent reference sequence, is considered. First, in the regime in which the…
We consider the Williams Bjerknes model, also known as the biased voter model on the $d$-regular tree $\bbT^d$, where $d \geq 3$. Starting from an initial configuration of "healthy" and "infected" vertices, infected vertices infect their…
The renormalization-decimation method is used to study the transmittivity of atomic wires, with one or more side branches attached at multiple sites. The rescaling process reduces all the branches, attached at an atomic site, to an…
The arboreal gas is the random (unrooted) spanning forest of a graph in which each forest is sampled with probability proportional to $\beta^{\# \text{edges}}$ for some $\beta\geq 0$, which arises as the $q\to 0$ limit of the…
In this article, we study concave recursions on trees, which appear widely in information theory through algorithms such as belief propagation, and in statistical mechanics through models on tree-like graphs, including the Ising model,…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We prove an invariance principle for linearly edge reinforced random walks on $\gamma$-stable critical Galton-Watson trees, where $\gamma \in (1,2]$ and where the edge joining $x$ to its parent has rescaled initial weight $d(\rho,…
The hardcore model is a model of lattice gas systems which has received much attention in statistical physics, probability theory and theoretical computer science. It is the probability distribution over independent sets $I$ of a graph…
The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges…
Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…
In a previous paper (arXiv:2510.19746), we have studied the maximal hard-code model on the square lattice ${\mathbb Z}^2$ from the perspective of recoverable systems. Here we extend this study to the case of the triangular lattice ${\mathbb…
We introduce a model of tree-rooted planar maps weighted by their number of $2$-connected blocks. We study its enumerative properties and prove that it undergoes a phase transition. We give the distribution of the size of the largest…
It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…
A tree is pathwise-random if all of its paths are Martin-Lof random. We show that (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any…
We consider models with nearest-neighbor interactions and with the set $[0,1]$ of spin values, on a Cayley tree of order $k\geq 1$. It is known that the "splitting Gibbs measures" of the model can be described by solutions of a nonlinear…
Given natural limitations on the length DNA sequences, designing phylogenetic reconstruction methods which are reliable under limited information is a crucial endeavor. There have been two approaches to this problem: reconstructing partial…
We study a generalization of the model introduced by Kistler and Schmidt in $2015$, that interpolates between the random energy model (REM) and the branching random walk (BRW). More precisely, we are interested in the asymptotic behaviour…
Maximum likelihood is one of the most widely used techniques to infer evolutionary histories. Although it is thought to be intractable, a proof of its hardness has been lacking. Here, we give a short proof that computing the maximum…