arXiv math/04064462004-06-23math.PRmath.STstat.TH

Survey: Information flow on trees

Elchanan Mossel

英文摘要：

Consider a tree network T, where each edge acts as an independent copy of a given channel M, and information is propagated from the root. For which T and M does the configuration obtained at level n of T typically contain significant information on the root variable? This model appeared independently in biology, information theory, and statistical physics. Its analysis uses techniques from the theory of finite markov chains, statistics, statistical physics, information theory, cryptography and noisy computation. In this paper, we survey developments and challenges related to this problem.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Gibbs measures of Potts model on Cayley trees: a survey and applications

In this paper we give a systematic review of the theory of Gibbs measures of Potts model on Cayley trees (developed since 2013) and discuss many applications of the Potts model to real world situations: mainly biology, physics, and some examples of alloy behavior, cell sorting, financial engineering, flocking birds, flowing foams, image segmentation, medicine, sociology etc.

2021-03-12math-phmath.MPmath.PR

Fringe trees, Crump-Mode-Jagers branching processes and $m$-ary search trees

This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time. This includes random recursive trees, preferential attachment trees, fragmentation trees, binary search trees and (more generally) $m$-ary search trees, as well as some other classes of random trees. We begin with general results, mainly due to Aldous (1991) and Jagers and Nerman (1984). The general results are applied to fringe trees and extended fringe trees for several particular types o…

2016-01-14math.PR

随机树上停车问题的结果与开放问题综述

Short survey of results and open problems for parking problems on random trees

本文综述随机树上停车问题的研究进展，涵盖相变与标度极限结果，并指出未来研究方向与开放问题。

2025-05-13math.PR

Stochastic block model entropy and broadcasting on trees with survey

The limit of the entropy in the stochastic block model (SBM) has been characterized in the sparse regime for the special case of disassortative communities [COKPZ17] and for the classical case of assortative communities but in the dense regime [DAM16]. The problem has not been closed in the classical sparse and assortative case. This paper establishes the result in this case for any SNR besides for the interval (1, 3.513). It further gives an approximation to the limit in this window. The result is obtained by expressing the global SBM entropy as an integral of local tree entropies in a broadc…

2021-01-29cs.ITmath.ITmath.PR

Ray-Knight representation of flows of branching processes with competition by pruning of Lévy trees

We introduce flows of branching processes with competition, which describe the evolution of general continuous state branching populations in which interactions between individuals give rise to a negative density dependence term. This generalizes the logistic branching processes studied by Lambert. Following the approach developed by Dawson and Li, we first construct such processes as the solutions of certain flow of stochastic differential equations. We then propose a novel genealogical description for branching processes with competition based on interactive pruning of Lévy-trees, and establ…

2017-11-28math.PR

Mating of trees for random planar maps and Liouville quantum gravity: a survey

We survey the theory and applications of mating-of-trees bijections for random planar maps and their continuum analog: the mating-of-trees theorem of Duplantier, Miller, and Sheffield (2014). The latter theorem gives an encoding of a Liouville quantum gravity (LQG) surface decorated by a Schramm-Loewner evolution (SLE) curve in terms of a pair of correlated linear Brownian motions. We assume minimal familiarity with the theory of SLE and LQG. Mating-of-trees theory enables one to reduce problems about SLE and LQG to problems about Brownian motion and leads to deep rigorous connections between …

2023-02-15math-phmath.COmath.CV

更多相关论文收起更多论文

Recursive tree processes and the mean-field limit of stochastic flows

Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We consider interacting particle systems on the complete graph in the mean-field limit, i.e., as the number of vertices tends to infinity. We are not only interested in the mean-field limit of a single process, but mainly in how several coupled processes behave in the limit. This turns out to be closely related to recursive tree processes as studied by Aldous a…

2020-03-18math.PR

On the flow-level stability of data networks without congestion control: the case of linear networks and upstream trees

In this paper, flow models of networks without congestion control are considered. Users generate data transfers according to some Poisson processes and transmit corresponding packet at a fixed rate equal to their access rate until the entire document is received at the destination; some erasure codes are used to make the transmission robust to packet losses. We study the stability of the stochastic process representing the number of active flows in two particular cases: linear networks and upstream trees. For the case of linear networks, we notably use fluid limits and an interesting phenomeno…

2011-09-07cs.NIcs.PFmath.PR

Scaling limits of Markov-Branching trees and applications

The goal of these lectures is to survey some of the recent progress on the description of large-scale structure of random trees. We use the framework of Markov-Branching sequences of trees and discuss several applications.

2016-05-25math.PR

Lattice trees, percolation and super-Brownian motion

This paper surveys the results of recent collaborations with Eric Derbez and with Takashi Hara, which show that intergrated super-Brownian excursion (ISE) arises as the scaling limit of both lattice trees and the incipient infinite percolation cluster, in high dimensions. A potential extension to oriented percolation is also mentioned.

1999-05-11math.PR

SPDE Approximation for Random Trees

We consider the genealogy tree for a critical branching process conditioned on non-extinction. We enumerate vertices in each generation of the tree so that for each two generations one can define a monotone map describing the ancestor--descendant relation between their vertices. We show that under appropriate rescaling this family of monotone maps converges in distribution in a special topology to a limiting flow of discontinuous monotone maps which can be seen as a continuum tree. This flow is a solution of an SPDE with respect to a Brownian sheet.

2010-08-25math.COmath.PR

An Upper Bound of the Information Flow From Children to Parent Node on Trees

We consider the transmission of a state from the root of a tree towards its leaves, assuming that each transmission occurs through a noisy channel. The states at the leaves are observed, while at deeper nodes we can compute the likelihood of each state given the observation. In this sense, information flows from child nodes towards the parent node. Here we find an upper bound of this children-to-parent information flow. To do so, first we introduce a new measure of information, the memory vector, whose norm quantifies whether all states have the same likelihood. Then we find conditions such th…

2022-04-22cs.ITmath.ITmath.PR

Information flow on trees

Consider a tree network $T$, where each edge acts as an independent copy of a given channel $M$, and information is propagated from the root. For which $T$ and $M$ does the configuration obtained at level $n$ of $T$ typically contain significant information on the root variable? This problem arose independently in biology, information theory and statistical physics. For all $b$, we construct a channel for which the variable at the root of the $b$-ary tree is independent of the configuration at level 2 of that tree, yet for sufficiently large $B>b$, the mutual information between the configurat…

2001-07-04math-phmath.COmath.MP