We studied the single-particle Anderson localization problem for non-Hermitian systems on
directed graphs. Random regular graph and various undirected standard random graph …

We study the rare fluctuations or large deviations of time-integrated functionals or
observables of an unbiased random walk evolving on Erdös-Rényi random graphs, and …

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 …

A bstract We consider a particular example of interplay between statistical models related to
CFT on one hand, and to the spectral properties of ODE, known as ODE/IS correspondence …

We discuss the generalization of a classical problem involving an N-step ideal polymer
adsorption at a sticky boundary (potential well of depth U). It is known that as N approaches …

The paper considers the behaviour of the number of paths of length $ N $ on graphs with
two heavy roots. Such vertices can be entropic traps. Numerical analysis is carried out for …

We have considered three different “one-body” statistical systems involving Brownian
excursions, which possess for fluctuations Kardar–Parisi–Zhang scaling with the critical …

In this paper we investigate the eigenvalue statistics of exponentially weighted ensembles of
full binary trees and p-branching star graphs. We show that spectral densities of …

We expose a series of exact mappings between particular cases of four statistical physics
models:(i) equilibrium 1D lattice gas with nearest-neighbor repulsion,(ii)(1+ 1) D …

In this article, we show numerically the strong finite-size effects in exponential random
graphs. Particularly, for the two-star model above the critical value of the chemical potential …