And/or trees: A local limit point of view
And/or trees: A local limit point of view
复制标题
和/或树木:局部极限的观点
DOI:
10.1002/rsa.20758
复制
发表时间:
2018
影响因子:
1
通讯作者:
Broutin N
中科院分区:
文献类型:
--
作者:
Broutin N
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 integerk, take a sequence of random (rooted) trees of increasing size, say , and label each of these random trees uniformly at random in order to get a random Boolean expression onkvariables. We prove that, under rather weak local conditions on the sequence of random trees , the distribution induced on Boolean functions by this procedure converges asntends to infinity. In particular, we characterize two different behaviors of this limit distribution depending on the shape of the local limit of : adegeneratecase when the local limit has no leaves; and a non‐degenerate case, which we are able to describe in more details under stronger conditions. In this latter case, we provide a relationship between the probability of a given Boolean function and itscomplexity. The examples covered by this unified framework include trees that interpolate between models with logarithmic typical distances (such as random binary search trees) and other ones with square root typical distances (such as conditioned Galton–Watson trees).
登录
查看更多内容
DOI:
--
发表时间:
2008
期刊:
影响因子:
--
作者:
J. Kozik
通讯作者:
J. Kozik
DOI:
--
发表时间:
1997
期刊:
Random Struct. Algorithms
影响因子:
--
作者:
Alan R. Woods
通讯作者:
Alan R. Woods
DOI:
--
发表时间:
2009
期刊:
Random Struct. Algorithms
影响因子:
--
作者:
J. Marckert;G. Miermont
通讯作者:
G. Miermont
DOI:
10.1017/s1446788700016517
发表时间:
1980-12
期刊:
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
影响因子:
--
作者:
G. Grimmett
通讯作者:
G. Grimmett
DOI:
--
发表时间:
1995
期刊:
Random Struct. Algorithms
影响因子:
--
作者:
H. Lefmann;P. Savický
通讯作者:
P. Savický