71 citations · 283 across the 26 of their papers we have counts for
3 papers · 1 filter
Paths counting on simple graphs: from escape to localization
S. K. Nechaev, M. V. Tamm, O. V. Valba
We study the asymptotic behavior of the number of paths of length on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap f…
Eigenvalue tunnelling and decay of quenched random networks
V. Avetisov, M. Hovhannisyan, A. Gorsky +3
We consider the canonical ensemble of -vertex Erdős-Rényi (ER) random topological graphs with quenched vertex degree, and with fugacity for each closed triple of bonds. We c…
Towards a robust algorithm to determine topological domains from colocalization data
Alexander P. Moscalets, Leonid I. Nazarov, Mikhail V. Tamm
One of the most important tasks in understanding the complex spatial organization of the genome consists in extracting information about this spatial organization, the function and…