Self-Reinforced Preferential Attachment

Yogesh Dahiya, Frank den Hollander

We consider a preferential attachment random graph with self-reinforcement. Each time a new vertex comes in, it attaches itself to an old vertex with a probability that is proporti…