Measuring preferential attachment in growing networks with missing-timelines using Markov chain Monte Carlo

► We propose a Markov chain Monte Carlo method for estimating the rate of preferential attachment in growing networks. ► Our method is applicable even when the order of the nodes in time of the growing network is unknown. ► We illustrate our method on a patent citation network.