Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
From MaRDI portal
Publication:5086992
DOI10.1017/jpr.2021.59zbMath1492.05141arXiv1908.02407OpenAlexW3101210987MaRDI QIDQ5086992
Hüseyin Acan, Boris G. Pittel, Alan M. Frieze
Publication date: 8 July 2022
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.02407
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05)
Cites Work
- Looking for vertex number one
- The cover time of the preferential attachment graph
- On a random graph evolving by degrees
- The diameter of a scale-free random graph
- Concentration of measure and isoperimetric inequalities in product spaces
- Preferential attachment without vertex growth: emergence of the giant component
- Asymptotic behavior and distributional limits of preferential attachment graphs
- On certain connectivity properties of the internet topology
- A new class of scale free random graphs
- The degree sequence of a scale-free random graph process
- Random Graphs and Complex Networks
- Introduction to Random Graphs
- On the probable behaviour of some algorithms for finding the stability number of a graph
- Emergence of Scaling in Random Networks
- Note on the heights of random recursive trees and random m‐ary search trees
- On random trees
- Linearized chord diagrams and an upper bound for vassiliev invariants
- Perfect matchings and Hamiltonian cycles in the preferential attachment model
- Robustness and Vulnerability of Scale-Free Random Graphs
- Crawling on Simple Models of Web Graphs
- The Maximum Degree of the Barabási–Albert Random Tree
- On connectivity, conductance and bootstrap percolation for a random k‐out, age‐biased graph
- Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
- Joint degree distributions of preferential attachment random graphs
- Lower Bounds and Algorithms for Dominating Sets in Web Graphs
- Random Graphs
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
- On a memory game and preferential attachment graphs
- On Bollobás‐Riordan random pairing model of preferential attachment graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
