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...

Full description

Bibliographic Details

Main Author:	Bermolen, Paola (author)
Other Authors:	Goicoechea Jackson, Valeria (author), Jonckheere, Matthieu (author), Mordecki, Ernesto (author)
Format:	article
Language:	English
Published:	2022
Subjects:	Large deviation principle Greedy exploration algorithms Erdös-Rényi Graphs Comparison principle. Hamilton-Jacobi equations
Online Access:	https://hdl.handle.net/20.500.12008/41045
Tags:	Add Tag No Tags, Be the first to tag this record!