Isomorphism and embedding problems for infinite limits of scale-free graphs
From MaRDI portal
Recommendations
- Random graphs associated to some discrete and continuous time preferential attachment models
- Asymptotic behavior and distributional limits of preferential attachment graphs
- A preferential attachment process approaching the Rado graph
- Infinite limits and adjacency properties of a generalized copying model
- Infinite Limits of Copying Models of the Web Graph
Cited in
(18)- \(\gamma\)-variable first-order logic of uniform attachment random graphs
- MSO 0-1 law for recursive random trees
- An explicit construction of \((3,t)\)-existentially closed graphs
- Bounded expansion in web graphs.
- Then-ordered graphs: A new graph class
- Perfect matchings and Hamiltonian cycles in the preferential attachment model
- A preferential attachment process approaching the Rado graph
- Asymmetry and structural information in preferential attachment graphs
- Preferential attachment processes approaching the Rado multigraph
- Subgraphs in preferential attachment models
- On the dense preferential attachment graph models and their graphon induced counterpart
- Generating infinite random graphs
- Infinite Locally Random Graphs
- Infinite limits and adjacency properties of a generalized copying model
- Evolving Shelah‐Spencer graphs
- Infinite random geometric graphs
- Logical convergence laws via stochastic approximation and Markov processes
- First order complexity of finite random structures
This page was built for publication: Isomorphism and embedding problems for infinite limits of scale-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921680)
