Cargando…
Path Counting on Tree-like Graphs with a Single Entropic Trap: Critical Behavior and Finite Size Effects
It is known that maximal entropy random walks and partition functions that count long paths on graphs tend to become localized near nodes with a high degree. Here, we revisit the simplest toy model of such a localization: a regular tree of degree p with one special node (“root”) that has a degree di...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10529157/ https://www.ncbi.nlm.nih.gov/pubmed/37761617 http://dx.doi.org/10.3390/e25091318 |