Accessibility percolation on random rooted labeled trees

DOI10.1017/jpr.2019.29zbMath1416.05259OpenAlexW2964792391MaRDI QIDQ5226256

Qunqiang Feng, Zhishui Hu, Zheng Li

Publication date: 31 July 2019

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jpr.2019.29

zbMATH Keywords

local weak convergencerandom treeincreasing pathaccessibility percolationaccessible vertex

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of accessible paths in the hypercube
• Increasing paths in regular trees
• Branching processes, random trees, and a generalized scheme of arrangements of particles
• Phase transition for accessibility percolation on hypercubes
• Recurrence of distributional limits of finite planar graphs
• On the existence of accessibility in a tree-indexed percolation model
• On the existence of accessible paths in various models of fitness landscapes
• Random cutting and records in deterministic and random trees
• Random Trees

This page was built for publication: Accessibility percolation on random rooted labeled trees