Consistent Estimation in General Sublinear Preferential Attachment Trees
classification
🧮 math.ST
stat.TH
keywords
attachmentpreferentialempiricalestimatorgeneraltreesalmostbranching
read the original abstract
We propose an empirical estimator of the preferential attachment function $f$ in the setting of general preferential attachment trees. Using a supercritical continuous-time branching process framework, we prove the almost sure consistency of the proposed estimator. We perform simulations to study the empirical properties of our estimators.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.