Open problems in stochastic reinforcement models
From MaRDI portal
Cites work
- A preferential attachment model with random initial degrees
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Coupling Online and Offline Analyses for Random Power Law Graphs
- Coupling Scale-Free and Classical Random Graphs
- Diameter in ultra-small scale-free random graphs
- Diameters in preferential attachment models
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- Random Deletion in a Scale-Free Random Graph Process
- Random graphs and complex networks. Volume 1
- Random networks with concave preferential attachment rule
- Random networks with preferential growth and vertex death
- Random networks with sublinear preferential attachment: degree evolutions
- Random networks with sublinear preferential attachment: the giant component
- Random trees and general branching processes
- Recurrence of distributional limits of finite planar graphs
- The degree sequence of a scale-free random graph process
- The growth and composition of branching populations
- The Maximum Degree of the Barabási–Albert Random Tree
This page was built for publication: Open problems in stochastic reinforcement models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860639)