Related papers: Probabilistic prediction in scale-free networks: D…

The antiferromagnetic Ising model in uncorrelated scale-free networks has been studied by means of Monte Carlo simulations. These networks are characterized by a connectivity (or degree) distribution P(k) ~ k^(- gamma). The disorder present…

We introduce a simple one-parameter network growth algorithm which is able to reproduce a wide variety of realistic network structures but without having to invoke any global information about node degrees such as preferential-attachment…

We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…

We propose a simple random process inducing various types of random graphs and the scale free random graphs among others. The model is of a threshold nature and differs from the preferential attachment approach discussed in the literature…

The cycle prefix network is a Cayley coset digraph based on sequences over an alphabet which has been proposed as a vertex symmetric communication network. This network has been shown to have many remarkable communication properties such as…

Methods connecting dynamical systems and graph theory have attracted increasing interest in the past few years, with applications ranging from a detailed comparison of different kinds of dynamics to the characterisation of empirical data.…

In this paper, we compare the number of unmatched nodes and the size of dilations in two main random network models, the Scale-Free and Clustered Scale-Free networks. The number of unmatched nodes determines the necessary number of control…

We find that scale-free random networks are excellently modeled by a deterministic graph. This graph has a discrete degree distribution (degree is the number of connections of a vertex) which is characterized by a power-law with exponent…

The Watts-Strogatz algorithm transferring a regular lattice to the small world network is modified by introducing preferential rewiring constrained by connectivity demand. The probability to link to/ unlink form a node is dependent on a…

Complex networks have been mostly characterized from the point of view of the degree distribution of their nodes and a few other motifs (or modules), with a special attention to triangles and cliques. The most exotic phenomena have been…

The entropy of network ensembles characterizes the amount of information encoded in the network structure, and can be used to quantify network complexity, and the relevance of given structural properties observed in real network datasets…

Spreading of either information or matter can often be treated as a network problem. It can be of great importance to be able to estimate the likelihood that spreading through a network reaches essentially the entire network while still not…

We consider a class of simple, non-trivial models of evolving weighted scale-free networks. The network evolution in these models is determined by attachment of new vertices to ends of preferentially chosen weighted edges. Resulting…

This paper investigates the effects of data size and frequency range on distributional semantic models. We compare the performance of a number of representative models for several test settings over data of varying sizes, and over test…

We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at…

We study the evolution of domain wall networks appearing after phase transitions in the early Universe. They exhibit interesting dynamical scaling behaviour which is not yet well understood, and are also simple models for the more…

We investigate wrinkling of two-dimensional random and triangular semiflexible polymer networks under shear. Both types of semiflexible networks exhibit wrinkling above a small critical shear angle, which scales with an exponent of the…

Recently it was shown (I.A.Gruzberg, A. Kl\"umper, W. Nuding and A. Sedrakyan, Phys.Rev.B 95, 125414 (2017)) that taking into account random positions of scattering nodes in the network model with $U(1)$ phase disorder yields a localization…

We study a problem of data packet transport in scale-free networks whose degree distribution follows a power-law with the exponent $\gamma$. We define load at each vertex as the accumulated total number of data packets passing through that…

We consider the Majority Vote model coupled with scale-free networks. Recent works point to a non-universal behavior of the Majority Vote model, where the critical exponents depend on the connectivity while the network's effective dimension…