Broadcasting‐induced colorings of preferential attachment trees
From MaRDI portal
Publication:6076722
DOI10.1002/RSA.21142zbMATH Open1525.05167arXiv2110.15050MaRDI QIDQ6076722FDOQ6076722
Authors:
Publication date: 17 October 2023
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Abstract: In this work we consider random two-colourings of random linear preferential attachment trees, which includes random recursive trees, random plane-oriented recursive trees, random binary search trees, and a class of random -ary trees. The random colouring is defined by assigning the root of the tree the colour red or blue with equal probability, and all other vertices are assigned the colour of their parent with probability and the other colour otherwise. These colourings have been previously studied in other contexts, including Ising models and broadcasting, and can be considered as generalizations of bond percolation. With the help of P'olya urns, we prove limiting distributions, after proper rescalings, for the number of vertices of each colour, the number of monochromatic subtrees of each colour, as well as the number of leaves and fringe subtrees with two-colourings. Using methods from analytic combinatorics, we also provide precise descriptions of the limiting distribution after proper rescaling of the size of the root cluster; the largest monochromatic subtree containing the root. The description of the limiting distributions extends previous work on bond percolation in random preferential attachment trees.
Full work available at URL: https://arxiv.org/abs/2110.15050
Recommendations
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15)
Cites Work
- Emergence of Scaling in Random Networks
- Belief propagation, robust reconstruction and optimal recovery of block models
- Analytic combinatorics
- Random Trees
- Title not available (Why is that?)
- The degree sequence of a scale-free random graph process
- Probability on trees and networks
- Probability: a graduate course
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Asymptotic degree distribution in random recursive trees
- Broadcasting on trees and the Ising model.
- Broadcasting on random recursive trees
- Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
- Note on the heights of random recursive trees and random m‐ary search trees
- The Multiplicative Process
- Title not available (Why is that?)
- Sur les séries de Taylor n'ayant que des singularites algebrico- logarithmiques sur leur cercle de convergence
- The total progeny in a branching process and a related random walk
- Title not available (Why is that?)
- Progress in high-dimensional percolation and random graphs
- The Mittag-Leffler process and a scaling limit for the block counting process of the Bolthausen-Sznitman coalescent
- The fragmentation process of an infinite recursive tree and Ornstein-Uhlenbeck type processes
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- An impossibility result for reconstruction in the degree-corrected stochastic block model
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- The shark random swim. (Lévy flight with memory)
- On a class of random walks with reinforced memory
- New insights on the reinforced elephant random walk using a martingale approach
This page was built for publication: Broadcasting‐induced colorings of preferential attachment trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076722)