Random walks on edge colored random graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918131409092608 |
|---|---|
| author | Cooper, Colin Frieze, Alan |
| author_facet | Cooper, Colin Frieze, Alan |
| contents | We consider random walks on edge coloured random graphs, where the colour of an edge reflects the cost of using it. In the simplest instance, the edges are coloured red or blue. Blue edges are free to use, whereas red edges incur a unit cost every time they are traversed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_16633 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Random walks on edge colored random graphs Cooper, Colin Frieze, Alan Combinatorics Probability We consider random walks on edge coloured random graphs, where the colour of an edge reflects the cost of using it. In the simplest instance, the edges are coloured red or blue. Blue edges are free to use, whereas red edges incur a unit cost every time they are traversed. |
| title | Random walks on edge colored random graphs |
| topic | Combinatorics Probability |
| url | https://arxiv.org/abs/2405.16633 |