We have performed the comparative spectral analysis of structural connectomes for various
organisms using open-access data. Our results indicate new peculiar features of …

Higher order networks are able to characterize data as different as functional brain networks,
protein interaction networks and social networks beyond the framework of pairwise …

In this work we analytically explain the origin of the mobility edge in the partially disordered
random regular graphs of degree d, ie, with a fraction $\beta $ of the sites being disordered …

We consider the properties of the random regular graph with node degree d perturbed by
chemical potentials μ k for a number of short k-cycles. We analyze both numerically and …

We consider clustering in rewired Erdős–Rényi networks with conserved vertex degree and
in random regular graphs from the localization perspective. It has been found in Avetisov et …

A bstract Using the matrix-forest theorem and the Parisi-Sourlas trick we formulate and solve
a one-matrix model with non-polynomial potential which provides perturbation theory for …

We propose two models of social segregation inspired by the Schelling model. Agents in our
models are nodes of evolving social networks. The total number of social connections of …

We study numerically the Anderson model on partially disordered random regular graphs
considered as the toy model for a Hilbert space of interacting disordered many-body system …

Pandemic propagation of COVID-19 motivated us to discuss the impact of the human
network clustering on epidemic spreading. Today, there are two clustering mechanisms …

Ensemble models of graphs are one of the most important theoretical tools to study complex
networks. Among them, exponential random graphs (ERGs) have proven to be very useful in …