On preferential attachment models and continuous time Markov processes
13th October 2020, 11:00 am – 12:00 pm
Virtual (online) Zoom seminar; a link will be sent to the Bristol Combinatorics Seminar mailing list, the week before the seminar.
One of the most popular models for network growth is the preferential attachment model proposed by Barabási and Albert. In this model, a newly created vertex is connected to one of those already present in the graph with a probability proportional to their degrees. In this talk we present a new technique to analyse the degree of a vertex which has appeared at a large enough time in the Barabási–Albert model, as well as the distribution of a vertex selected uniformly at random in this random graph model. The main idea is to couple the degree growth process of a vertex to a set of Markov processes, and introduce an auxiliary branching structure superimposed to the random graph.