Random graph processes with dependencies
<p>Random graph processes are basic mathematical models for large-scale networks evolving over time. Their systematic study was pioneered by Erdös and Rényi around 1960, and one key feature of many 'classical' models is that the edges appear independently. While this makes them amena...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | Tese |
| Idioma: | English |
| Publicado em: |
2012
|
| Assuntos: |