4 citations · 13 across the 11 of their papers we have counts for
5 papers · 1 filter
Ensemble inequivalence and phase transitions in unlabeled networks
Oleg Evnin, Dmitri Krioukov
We discover a first-order phase transition in the canonical ensemble of random unlabeled networks with a prescribed average number of links. The transition is caused by the nonconc…
Statistical field theory of random graphs with prescribed degrees
Pawat Akara-pipattana, Oleg Evnin
Statistical field theory methods have been very successful with a number of random graph and random matrix problems, but it is challenging to apply these methods to graphs with pre…
Hammerstein equations for sparse random matrices
Pawat Akara-pipattana, Oleg Evnin
Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic m…
First return times on sparse random graphs
Oleg Evnin, Weerawit Horinouchi
We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this r…
A Gaussian integral that counts regular graphs
Oleg Evnin, Weerawit Horinouchi
In a recent article J. Phys. Compl. 4 (2023) 035005, Kawamoto evoked statistical physics methods for the problem of counting graphs with a prescribed degree sequence. This treatmen…