2000 character limit reached
Consistent Estimation in General Sublinear Preferential Attachment Trees
Published 23 Jun 2017 in math.ST and stat.TH | (1706.07607v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.