Related papers: Triadic closure in configuration models with unbou…
The asymptotic behaviour of dynamical processes in networks can be expressed as a function of spectral properties of the corresponding adjacency and Laplacian matrices. Although many theoretical results are known for the spectra of…
This paper presents an approach to the modeling of degree-degree correlation in complex networks. Thus, a simple function, \Delta(k', k), describing specific degree-to- degree correlations is considered. The function is well suited to…
We investigate the degree distribution $P(k)$ and the clustering coefficient $C$ of the line graphs constructed on the Erd\"os-R\'enyi networks, the exponential and the scale-free growing networks. We show that the character of the degree…
The "power of choice" has been shown to radically alter the behavior of a number of randomized algorithms. Here we explore the effects of choice on models of tree and network growth. In our models each new node has k randomly chosen…
The hidden variable formalism (based on the assumption of some intrinsic node parameters) turned out to be a remarkably efficient and powerful approach in describing and analyzing the topology of complex networks. Owing to one of its most…
In this letter, we proposed an ungrowing scale-free network model, wherein the total number of nodes is fixed and the evolution of network structure is driven by a rewiring process only. In spite of the idiographic form of $G$, by using a…
Real-world networks, e.g. the social relations or world-wide-web graphs, exhibit both small-world and scale-free behaviour. We interpret lattice triangulations as planar graphs by identifying triangulation vertices with graph nodes and…
We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment…
Apart from the role the clustering coefficient plays in the definition of the small-world phenomena, it also has great relevance for practical problems involving networked dynamical systems. To study the impact of the clustering coefficient…
Triangles are abundant in real-world networks but rare in standard null models for sparse graphs. Existing explanations typically rely on explicit triadic closure mechanisms or geometry-based connection rules. We propose an alternative…
Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse…
In this paper, we present a detailed analysis of the global clustering coefficient in scale-free graphs. Many observed real-world networks of diverse nature have a power-law degree distribution. Moreover, the observed degree distribution…
Many real networks have cliques as their constitutional units. Here we present a family of scale-free network model consist of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and…
A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the…
We propose and study a model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent. The model represents a hybrid of the growing networks based on…
We provide a local probabilistic description of the limiting statistics of large preferential attachment trees in terms of the ordinary degree (number of neighbors) but augmented with information on leafdegree (number of neighbors that are…
We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $\gamma$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality…
We have developed different network approaches to complex patterns of frictional interfaces (contact areas developments). Here, we analyze the dynamics of static friction. We found, under the correlation measure, the fraction of triangles…
In this paper, by both simulations and theoretical predictions we study two and three node (or degree) correlations in random Apollonian network (RAN), which have small-world and scale-free topologies. Using the rate equation approach under…
Scale-free networks, in which the distribution of the degrees obeys a power-law, are ubiquitous in the study of complex systems. One basic network property that relates to the structure of the links found is the degree assortativity, which…