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...
Na minha lista:
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | inglês |
| Publicado em: |
2022
|
| Assuntos: | |
| Acesso em linha: | https://hdl.handle.net/20.500.12008/41045 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|
Registos relacionados: Large deviation principle for the Greedy exploration algorithm over Erdös-Rényi graphs
- Viscosity solutions and hyperbolic motions : a new PDE method for the N-body problem
- Fast computation of weighted distance functions and geodesic on implicit hyper-surfaces
- Large deviations for exploration processes on random graphs
- Superfluous edges and exponential expansions of De Bruijn and Kautz graphs
- The search for QoS in data networks : A statistical approach
- The principles of equality and transparency in the modification of public contracts. The meaning and scope the jurisprudence of the Court of Justice of the European Union