On Bollobás‐Riordan random pairing model of preferential attachment graph
From MaRDI portal
Publication:6074644
DOI10.1002/rsa.20985zbMath1522.05443arXiv1811.10764OpenAlexW3114192334MaRDI QIDQ6074644
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.10764
order statisticsasymptoticsrandom graphspairingsdegreeschord diagramsrecursive treesvertex expansion
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a random graph evolving by degrees
- Negative association of random variables, with applications
- The diameter of a scale-free random graph
- Asymptotic behavior and distributional limits of preferential attachment graphs
- 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
- Emergence of Scaling in Random Networks
- The Average Number of Stable Matchings
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- On random trees
- Directed scale-free graphs
- 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
- The Maximum Degree of the Barabási–Albert Random Tree
- Balls and bins: A study in negative dependence
- Paths in graphs
- A general model of web graphs
- On connectivity, conductance and bootstrap percolation for a random k‐out, age‐biased graph
- Joint degree distributions of preferential attachment random graphs
- On a memory game and preferential attachment graphs
- Vassiliev invariants and a strange identity related to the Dedekind eta-function
This page was built for publication: On Bollobás‐Riordan random pairing model of preferential attachment graph
