Competing first passage percolation on random regular graphs

Competing first passage percolation on random regular graphs

We consider two competing first passage percolation processes started from uniformly chosen subsets of a random regular graph on N vertices. The processes are allowed to spread with different rates, start from vertex subsets of different sizes or at different times. We obtain tight results regarding...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Random structures & algorithms 2017-07, Vol.50 (4), p.534-583
Hauptverfasser: Antunović, Tonći, Dekel, Yael, Mossel, Elchanan, Peres, Yuval
Format: Artikel
Sprache:eng
Schlagworte:
coupling method
Graph theory
growth process
Marketing
Markets
Percolation
Social networks
submodularity
Vertex sets
viral marketing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider two competing first passage percolation processes started from uniformly chosen subsets of a random regular graph on N vertices. The processes are allowed to spread with different rates, start from vertex subsets of different sizes or at different times. We obtain tight results regarding the sizes of the vertex sets occupied by each process, showing that in the generic situation one process will occupy Θ(1)Nα vertices, for some 0
ISSN:1042-9832
1098-2418
DOI:10.1002/rsa.20699