Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms
From MaRDI portal
Publication:2164797
DOI10.1007/s10463-022-00827-5OpenAlexW4298839302MaRDI QIDQ2164797
Publication date: 17 August 2022
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.04611
Related Items
Cites Work
- A preferential attachment model with random initial degrees
- Multivariate regular variation of discrete mass functions with applications to preferential attachment networks
- Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
- Rates of convergence of the Hastings and Metropolis algorithms
- Monte Carlo methods in Bayesian computation
- On nodes of small degrees and degree profile in preferential dynamic attachment circuits
- Preferential attachment random graphs with edge-step functions
- Degree growth rates and index estimation in a directed preferential attachment model
- Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment
- Fitting the linear preferential attachment model
- On the asymptotic normality of estimating the affine preferential attachment network models with random initial degrees
- Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
- Random Graphs and Complex Networks
- Emergence of Scaling in Random Networks
- Growing networks with mixed attachment mechanisms
- Advanced Markov Chain Monte Carlo Methods
- Goodness of Fit of Social Network Models
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Probability
- A general model of web graphs
- Asymptotic normality of in- and out-degree counts in a preferential attachment model
- Estimating formation mechanisms and degree distributions in mixed attachment networks
- Equation of State Calculations by Fast Computing Machines
- Monte Carlo sampling methods using Markov chains and their applications
- A Simplex Method for Function Minimization