The combination of the compactness of networks, featuring small diameters, and their
complex architectures results in a variety of critical effects dramatically different from those in …

The relationship between network structure and dynamics is one of the most extensively
investigated problems in the theory of complex systems of recent years. Understanding this …

We investigate topologically biased failure in scale-free networks with a degree distribution
P (k)∝ k-γ. The probability p that an edge remains intact is assumed to depend on the …

We consider three spatial scale-free random graph models: finite and infinite Geometric
Inhomogeneous Random Graphs, and Scale-Free Percolation. In these spatial models, the …

In this paper we study a version of (non-Markovian) first passage percolation on graphs,
where the transmission time between two connected vertices is non-iid, but increases by a …

The natural connectivity is recently reported as a novel spectral measure of robustness in
complex networks. It has a clear physical meaning and a simple mathematical formulation …

Biased (degree-dependent) percolation was recently shown to provide strategies for turning
robust networks fragile and vice versa. Here, we present more detailed results for biased …

This work considers an Ising model on the Apollonian network, where the exchange
constant J i, j∼ 1/(kikj) μ between two neighboring spins (i, j) is a function of the degree k of …

We study the spread of information in finite and infinite inhomogeneous spatial random
graphs. We assume that each edge has a transmission cost that is a product of an iid …

Здiйснено огляд недавнiх результатiв емпiричних, числових та теоретичних дослiджень
складних мереж, що описують багато систем у природi й суспiльствi. Прикладами …