On connectivity, conductance and bootstrap percolation for a random k‐out, age‐biased graph

DOI10.1002/rsa.20872zbMath1444.05130arXiv1810.02041OpenAlexW2949516145MaRDI QIDQ5113931

Hüseyin Acan, Boris G. Pittel

Publication date: 19 June 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.02041

zbMATH Keywords

connectivityconductancebootstrap percolationuniform attachment graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Vertex degrees (05C07)

Related Items (2)

Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ On Bollobás‐Riordan random pairing model of preferential attachment graph

This page was built for publication: On connectivity, conductance and bootstrap percolation for a random k‐out, age‐biased graph