Related papers: Random Apollonian networks with tailored clusterin…
We present and study in this paper a simple algorithm that produces so called growing Parallel Random Apollonian Networks (P-RAN) in any dimension d. Analytical derivations show that these networks still exhibit small-word and scale-free…
We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the…
In this paper we study the toughness of Random Apollonian Networks (RANs), a random graph model which generates planar graphs with power-law properties. We consider their important characteristics: every RAN is a uniquely representable…
We propose an extended local-world evolving network model including a triad formation step. In the process of network evolution, random fluctuation in the number of new edges is involved. We derive analytical expressions for degree…
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node…
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…
The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…
In this paper, a random clique network model to mimic the large clustering coefficient and the modular structure that exist in many real complex networks, such as social networks, artificial networks, and protein interaction networks, is…
The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows to find the critical threshold and the size of the giant component. Numerical simulations…
Recent results from statistical physics show that large classes of complex networks, both man-made and of natural origin, are characterized by high clustering properties yet strikingly short path lengths between pairs of nodes. This class…
Discoveries of the scale-free and small-world features are reported on a network constructed from the seismic data. It is shown that the connectivity distribution decays as a power law, and the value of the degrees of separation, i.e., the…
We investigate localization properties of the Apollonian network (AN) in the presence of diagonal and off-diagonal disorder. By employing a site-resolved localization measure, we show that the localization degree is strongly dependent on…
In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…
We present a systematic and detailed study of the robustness of directed networks under random and targeted removal of links. We work with a set of network models of random and scale free type, generated with specific features of clustering…
We have proposed two new dynamic networks where two node are swapped each other, and showed that the both networks behave as a small world like in the average path length but can not make any effective discussions on the clustering…
Network models with preferential attachment, where new nodes are injected into the network and form links with existing nodes proportional to their current connectivity, have been well studied for some time. Extensions have been introduced…
It has been shown that many complex networks shared distinctive features, which differ in many ways from the random and the regular networks. Although these features capture important characteristics of complex networks, their applicability…
We extend the study of a model of competitive cluster growth in an active medium to a basis of networks; this is done by adding nonlocal connections with probability $p$ to sites on a regular lattice, thus enabling one to interpolate…
We investigate a model of evolving random network, introduced by us previously {[}{\it Phys. Rev. Lett.} {\bf 83}, 5587 (1999){]} . The model is a generalization of the Bak-Sneppen model of biological evolution, with the modification that…
It is highly desirable and challenging for a wireless ad hoc network to have self-organization properties in order to achieve network wide characteristics. Studies have shown that Small World properties, primarily low average path length…