Related papers: Ising model on a Galton-Watson tree with a sparse …

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,…

We consider the ferromagnetic Ising model on a sequence of graphs $G_n$ converging locally weakly to a rooted random tree. Generalizing [Montanari, Mossel, Sly '11], under an appropriate "continuity" property, we show that the Ising…

Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…

Fix $n\in\mathbb{N}$. Let $\mathbf{T}_n$ be the set of rooted trees $(T,o)$ whose vertices are labeled by elements of $\{1,...,n\}$. Let $\nu$ be a strongly connected multi-type Galton-Watson measure. We give necessary and sufficient…

We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We…

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

We consider the set of random Bienaym\'e-Galton-Watson trees with a bounded number of offspring and bounded number of generations as a statistical mechanics model: a random tree is a rooted subtree of the maximal tree; the spin at a given…

Ising models describe the joint probability distribution of a vector of binary feature variables. Typically, not all the variables interact with each other and one is interested in learning the presumably sparse network structure of the…

A $d$-dimensional Ising model on a lattice torus is considered. As the size $n$ of the lattice tends to infinity, a Poisson approximation is given for the distribution of the number of copies in the lattice of any given local configuration,…

We consider testing for the parameters of Ferromagnetic Ising models. While testing for the presence of possibly sparse magnetizations, we provide a general lower bound of minimax separation rates which yields sharp results in high…

We are interested in the asymptotic behavior of critical Galton-Watson trees whose offspring distribution may have infinite variance, which are conditioned on having a large fixed number of leaves. We first find an asymptotic estimate for…

We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…

We investigate the ferromagnetic Ising model on the Erd\H{o}s-R\'enyi random graph $\mathbb{G}(n,m)$ with bounded average degree $d=2m/n$. Specifically, we determine the limiting distribution of $\log Z_{\mathbb{G}(n,m)}(\beta,B)$, where…

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…

This paper deals with branching processes in varying environment, namely, whose offspring distributions depend on the generations. We provide sufficient conditions for survival or extinction which rely only on the first and second moments…

In this work we show that for every $d < \infty$ and the Ising model defined on $G(n,d/n)$, there exists a $\beta_d > 0$, such that for all $\beta < \beta_d$ with probability going to 1 as $n \to \infty$, the mixing time of the dynamics on…

We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…

In [1] a detailed analysis was given of the large-time asymptotics of the total mass of the solution to the parabolic Anderson model on a supercritical Galton-Watson random tree with an i.i.d. random potential whose marginal distribution is…

Reducing a graph while preserving its overall properties is an important problem with many applications. Typically, reduction approaches either remove edges (sparsification) or merge nodes (coarsening) in an unsupervised way with no…