Related papers: Scale-Free Networks with the Same Degree Distribut…
Graphs and complex networks can be successively separated into connected components associated to respective seed nodes, therefore establishing a respective hierarchical organization. In the present work, we study the properties of the…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
We study the importance of local structural properties in networks which have been evolved for a power-law scaling in their Laplacian spectrum. To this end, the degree distribution, two-point degree correlations, and degree-dependent…
We propose a general model of unweighted and undirected networks having the scale-free property and fractal nature. Unlike the existing models of fractal scale-free networks (FSFNs), the present model can systematically and widely change…
The way in which different types of dynamics unfold in complex networks is intrinsically related to the propagation of activation along nodes, which is strongly affected by the network connectivity. In this work we investigate to which…
A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the…
In this article, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called {\bf Random Apollonian Networks}(RAN) as they can be considered…
We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the coevolution of topology and weight. In the model, we have the degree distribution exponent $\gamma$ restricted to a range between 2…
We propose a simple preferential attachment model of growing network using the complementary probability of Barab\'asi-Albert (BA) model, i.e., $\Pi(k_i) \propto 1-\frac{k_i}{\sum_j k_j}$. In this network, new nodes are preferentially…
We study spatial networks constructed by randomly placing nodes on a manifold and joining two nodes with an edge whenever their distance is less than a certain cutoff. We derive the general expression for the connectivity distribution of…
Large cascades are a common occurrence in many natural and engineered complex systems. In this paper we explore the propagation of cascades across networks using realistic network topologies, such as heterogeneous degree distributions, as…
Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to…
We study a social network consisting of over $10^4$ individuals, with a degree distribution exhibiting two power scaling regimes separated by a critical degree $k_{\rm crit}$, and a power law relation between degree and local clustering. We…
The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree…
Complex networks in different areas exhibit degree distributions with heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential…
We study a modified version of a model previously proposed by Jackson and Wolinsky to account for communicating information and allocating goods in socioeconomic networks. In the model, the utility function of each node is given by a…
We find that transport on scale-free random networks depends strongly on degree-correlated network topologies whereas transport on Erd$\ddot{o}$s-R$\acute{e}$nyi networks is insensitive to the degree correlation. An approach for the tuning…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
Complex networks have been studied extensively due to their relevance to many real systems as diverse as the World-Wide-Web (WWW), the Internet, energy landscapes, biological and social networks…
In heterogeneous network systems such as ecological and social networks, structural stability depends on how connectivity changes under node removal, as different removal sequences can trigger distinct modes of systemic collapse. While…