Vol. 14, No. 3, 2021

Download this article
Download this article For screen
For printing
Recent Issues

Volume 14
Issue 3, 361–540
Issue 2, 181–360
Issue 1, 1–179

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editors’ Interests
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Author Index
Coming Soon
 
Other MSP Journals
Fragility of nonconvergence in preferential attachment graphs with three types

Ben Andrews and Jonathan Jordan

Vol. 14 (2021), No. 3, 531–540
Abstract

Preferential attachment networks are a type of random network where new nodes are connected to existing ones at random and are more likely to connect to those that already have many connections. We investigate further a family of models introduced by Antunović, Mossel and Rácz where each vertex in a preferential attachment graph is assigned a type, based on the types of its neighbours. Instances of this type of process where the proportions of each type present do not converge over time seem to be rare.

Previous work found that a “rock-paper-scissors” setup where each new node’s type was determined by a rock-paper-scissors contest between its two neighbours does not converge. Here, two cases similar to that are considered, one which is like the above but with an arbitrarily small chance of picking a random type and one where there are four neighbours which perform a knockout tournament to determine the new type.

These two new setups, despite seeming very similar to the rock-paper-scissors model, do in fact converge, perhaps surprisingly.

Keywords
preferential attachment, competing types, rock-paper-scissors
Mathematical Subject Classification
Primary: 05C82
Milestones
Received: 2 February 2021
Revised: 18 February 2021
Accepted: 26 February 2021
Published: 17 July 2021

Communicated by John C. Wierman
Authors
Ben Andrews
School of Mathematics and Statistics
University of Sheffield
Sheffield
United Kingdom
Jonathan Jordan
School of Mathematics and Statistics
University of Sheffield
Sheffield
United Kingdom