We obtain graphicality conditions for general types of scale-free networks. The same conditions obtained for uncorrelated networks are obtained in the general case. Then an upper bound relating γ, the exponent of the degree distribution, with the cutoff exponent κ, as κ<1/γ is established. This bound is valid for all networks with a well-defined power-law degree distribution in the range γ≤2. Some recent numerical research on visibility networks arising from persistent fractional Brownian motion (fBm) processes are reviewed since they do not fulfill these conditions. As a consequence, a new relationship between the exponent γ of the degree distribution and the Hurst exponent H of the fBm process, γ⪅1/H, is postulated.I acknowledge support f...
<p>According to the values of the scaling exponents, the seven species listed are grouped into two c...
<p>Right column shows illustrations of prototypical networks: the (ring) lattice small-world, the cl...
We give an intuitive though general explanation of the finite-size effect in scale-free networks in ...
The structure of time series is usually characterized by means of correlations. A new proposal based...
This paper presents a tighter bound on the degree distribution of arbitrary Pólya urn graph process...
We consider growing interfaces as dynamical networks whose nodes are the discrete points of the inte...
In this paper, we propose a simple evolving network model with link and node removals as well as add...
We propose a general model of unweighted and undirected networks having the scale-free property and ...
Abstract. We show that not only preferential attachment but also preferential depletion leads to sca...
As for many complex systems, network structures are important as their backbone. From research on dy...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
We study the realizability of scale-free networks with a given degree sequence, showing that the fra...
The visibility graph approach and complex network theory provide a new insight into time series anal...
We study the realizability of scale-free networks with a given degree sequence, showing that the fra...
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-f...
<p>According to the values of the scaling exponents, the seven species listed are grouped into two c...
<p>Right column shows illustrations of prototypical networks: the (ring) lattice small-world, the cl...
We give an intuitive though general explanation of the finite-size effect in scale-free networks in ...
The structure of time series is usually characterized by means of correlations. A new proposal based...
This paper presents a tighter bound on the degree distribution of arbitrary Pólya urn graph process...
We consider growing interfaces as dynamical networks whose nodes are the discrete points of the inte...
In this paper, we propose a simple evolving network model with link and node removals as well as add...
We propose a general model of unweighted and undirected networks having the scale-free property and ...
Abstract. We show that not only preferential attachment but also preferential depletion leads to sca...
As for many complex systems, network structures are important as their backbone. From research on dy...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
We study the realizability of scale-free networks with a given degree sequence, showing that the fra...
The visibility graph approach and complex network theory provide a new insight into time series anal...
We study the realizability of scale-free networks with a given degree sequence, showing that the fra...
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-f...
<p>According to the values of the scaling exponents, the seven species listed are grouped into two c...
<p>Right column shows illustrations of prototypical networks: the (ring) lattice small-world, the cl...
We give an intuitive though general explanation of the finite-size effect in scale-free networks in ...