Large deviation principle for the Greedy exploration algorithm over Erdös-Rényi graphs

We prove a large deviation principle for a greedy exploration process on an Erdös-Rényi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the general strategy to study large deviations of processes proposed by Feng and Kurtz (2006), based on the convergence of no...

Popoln opis

Bibliografske podrobnosti

Glavni avtor:	Bermolen, Paola (author)
Drugi avtorji:	Goicoechea Jackson, Valeria (author), Jonckheere, Matthieu (author), Mordecki, Ernesto (author)
Format:	article
Jezik:	angleščina
Izdano:	2022
Teme:	Large deviation principle Greedy exploration algorithms Erdös-Rényi Graphs Comparison principle. Hamilton-Jacobi equations
Online dostop:	https://hdl.handle.net/20.500.12008/41045
Oznake:	Označite Brez oznak, prvi označite!