And/or trees: A local limit point of view

@article{Broutin2018AndorTA,
  title={And/or trees: A local limit point of view},
  author={Nicolas Broutin and C{\'e}cile Mailler},
  journal={Random Structures \& Algorithms},
  year={2018},
  volume={53},
  pages={000 - 000}
}
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression represented in (one of) its tree shapes. Fix an integer k, take a sequence of random (rooted) trees of increasing size, say (tn)n≥1 , and label each of these random trees uniformly at random in order to get a random Boolean expression on k variables. We prove that… 

Local limits of Markov Branching trees and their volume growth

We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given

Minimax functions on Galton–Watson trees

The behaviour of minimax recursions defined on random trees, where the tree is given by a Galton–Watson branching process, truncated at some depth 2n, and the terminal values of the level 2n nodes are drawn independently from some common distribution is examined.

Absorbing Patterns in BST-Like Expression-Trees

The results prove that random BST-like trees have to be considered with care, and that they offer a richer range of behaviours than uniform random trees.

What is the satisfiability threshold of random balanced Boolean expressions?

It is proved that if for every c>0 c >0 it holds that kNexp(−cN)→0, then asymptotically with high probability the Boolean expression is either a tautology or an antitautology.

Uniform Random Expressions Lack Expressivity

It is proved that if there is a subexpression that is absorbing for a given operator, then, after repeatedly applying the induced simplification to a uniform random expression of size n, it is obtained an equivalent expression of constant expected size.

51 : 10 Uniform Random Expressions Lack Expressivity

It is proved that if there is a subexpression that is absorbing for a given operator, then, after repeatedly applying the induced simplification to a uniform random expression of size n, it is obtained an equivalent expression of constant expected size.

Recursive functions on conditional Galton‐Watson trees

The limit behavior when the leaf values are drawn independently from a fixed distribution on $S$ is described, and the tree $T_n$ is a random Galton--Watson tree of size n.

Scaling Limits of Markov-Branching Trees and Applications

The goal of these lecture notes 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

References

SHOWING 1-10 OF 44 REFERENCES

And/Or Trees Revisited

A detailed analysis of the functions enumerating some sub-families of trees, and of their radius of convergence, allows us to improve on the upper bound of $P(f)$, established by Lefmann and Savický.

Coloring rules for finite trees, and probabilities of monadic second order sentences

An extension of the idea shows that for a particular model of Boolean formulas in k variables, k fixed, the fraction of such formulas of size n which compute a given Boolean function approaches a positive limit as na`.

Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered trees

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on

The fraction of large random trees representing a given Boolean function in implicational logic

The relation between the probability of a function and its complexity is obtained when random expressions are drawn according to a critical branching process and it is proved that most expressions computing any given function in this system are “simple”.

A sprouting tree model for random boolean functions

A new probability distribution for Boolean functions of k variables of size n is defined, which is compared with two previously‐known distributions induced by two other random trees: the Catalan tree and the Galton‐Watson tree.

Bootstrap Percolation on Infinite Trees and Non-Amenable Groups

It is proved that on any $2k-regular non-amenable graph, the critical probability for the $k$-rule is strictly positive, and that in any rooted tree $T$ there is a way of erasing children of the root, together with all their descendants, and repeating this for all remaining children, and so on.

The CRT is the scaling limit of unordered binary trees

We prove that a uniform, rooted unordered binary tree (also known as rooted, binary Pólya tree) with n leaves has the Brownian continuum random tree as its scaling limit for the Gromov‐Hausdorff

The Number of Trees

The mathematical theory of trees was first discussed by Cayley in 1857 (1). He was successful in finding recursion formulas for counting the number of trees or rooted trees having a finite number of

Subcritical pattern languages for and/or trees

Let $P_k(f)$ denote the density of and/or trees defining a boolean function $f$ within the set of and/or trees with fixed number of variables $k$. We prove that there exists constant $B_f$ such that

On growing random binary trees