scholarly journals Polygon-Based Hierarchical Planar Networks Based on Generalized Apollonian Construction

Physics ◽  
2021 ◽  
Vol 3 (4) ◽  
pp. 998-1014
Author(s):  
Mikhail Tamm ◽  
Dmitry Koval ◽  
Vladimir Stadnichuk
Keyword(s):  
Complex Networks ◽  
Power Law ◽  
Degree Distribution ◽  
Small World ◽  
Scale Free ◽  
Model Network ◽  
Suggested Procedure ◽  
Similar Construction ◽  
Scale Free Graphs ◽  
Planar Networks

Experimentally observed complex networks are often scale-free, small-world and have an unexpectedly large number of small cycles. An Apollonian network is one notable example of a model network simultaneously having all three of these properties. This network is constructed by a deterministic procedure of consequentially splitting a triangle into smaller and smaller triangles. In this paper, a similar construction based on the consequential splitting of tetragons and other polygons with an even number of edges is presented. The suggested procedure is stochastic and results in the ensemble of planar scale-free graphs. In the limit of a large number of splittings, the degree distribution of the graph converges to a true power law with an exponent, which is smaller than three in the case of tetragons and larger than three for polygons with a larger number of edges. It is shown that it is possible to stochastically mix tetragon-based and hexagon-based constructions to obtain an ensemble of graphs with a tunable exponent of degree distribution. Other possible planar generalizations of the Apollonian procedure are also briefly discussed.

A Small-World Model of Scale-Free Networks: Features and Verifications

2011 ◽  
Vol 50-51 ◽  
pp. 166-170 ◽  
Author(s):  
Wen Jun Xiao ◽  
Shi Zhong Jiang ◽  
Guan Rong Chen
Keyword(s):  
Complex Networks ◽  
Power Law ◽  
Degree Sequence ◽  
Small World ◽  
Static Condition ◽  
Vertex Degree ◽  
Power Law Distribution ◽  
Least Common Multiple ◽  
Scale Free ◽  
Vertex Degrees

It is now well known that many large-sized complex networks obey a scale-free power-law vertex-degree distribution. Here, we show that when the vertex degrees of a large-sized network follow a scale-free power-law distribution with exponent  2, the number of degree-1 vertices, if nonzero, is of order N and the average degree is of order lower than log N, where N is the size of the network. Furthermore, we show that the number of degree-1 vertices is divisible by the least common multiple of , , . . ., , and l is less than log N, where l = < is the vertex-degree sequence of the network. The method we developed here relies only on a static condition, which can be easily verified, and we have verified it by a large number of real complex networks.

scholarly journals Generation of 2-mode scale-free graphs for link-level internet topology modeling

PLoS ONE ◽  
2020 ◽  
Vol 15 (11) ◽  
pp. e0240100
Author(s):  
Khalid Bakhshaliyev ◽  
Mehmet Hadi Gunes
Keyword(s):  
Power Law ◽  
Degree Distribution ◽  
Autonomous Systems ◽  
Node Degree ◽  
Bipartite Network ◽  
Research Issues ◽  
Scale Free ◽  
Internet Topology ◽  
Scale Free Graphs ◽  
Multi Access

Comprehensive analysis that aims to understand the topology of real-world networks and the development of algorithms that replicate their characteristics has been significant research issues. Although the accuracy of newly developed network protocols or algorithms does not depend on the underlying topology, the performance generally depends on the topology. As a result, network practitioners have concentrated on generating representative synthetic topologies and utilize them to investigate the performance of their design in simulation or emulation environments. Network generators typically represent the Internet topology as a graph composed of point-to-point links. In this study, we discuss the implications of multi-access links on the synthetic network generation and modeling of the networks as bi-partite graphs to represent both subnetworks and routers. We then analyze the characteristics of sampled Internet topology data sets from backbone Autonomous Systems (AS) and observe that in addition to the commonly recognized power-law node degree distribution, the subnetwork size and the router interface distributions often exhibit power-law characteristics. We introduce a SubNetwork Generator (SubNetG) topology generation approach that incorporates the observed measurements to produce bipartite network topologies. In particular, generated topologies capture the 2-mode relation between the layer-2 (i.e., the subnetwork and interface distributions) and the layer-3 (i.e., the degree distribution) that is missing from the current network generators that produce 1-mode graphs. The SubNetG source code and experimental data is available at https://github.com/netml/sonet.

Complex networks

2018 ◽  
Author(s):  
Graziano Vernizzi ◽  
Henri Orland
Keyword(s):  
Complex Networks ◽  
Small World ◽  
Laplacian Matrix ◽  
Square Lattice ◽  
Small World Networks ◽  
Scale Free ◽  
Scale Free Networks ◽  
Free Network ◽  
Scale Free Graphs ◽  
Regular Networks

This article deals with complex networks, and in particular small world and scale free networks. Various networks exhibit the small world phenomenon, including social networks and gene expression networks. The local ordering property of small world networks is typically associated with regular networks such as a 2D square lattice. The small world phenomenon can be observed in most scale free networks, but few small world networks are scale free. The article first provides a brief background on small world networks and two models of scale free graphs before describing the replica method and how it can be applied to calculate the spectral densities of the adjacency matrix and Laplacian matrix of a scale free network. It then shows how the effective medium approximation can be used to treat networks with finite mean degree and concludes with a discussion of the local properties of random matrices associated with complex networks.

scholarly journals Detecting different topologies immanent in scale-free networks with the same degree distribution

2019 ◽  
Vol 116 (14) ◽  
pp. 6701-6706 ◽  
Author(s):  
Dimitrios Tsiotas
Keyword(s):  
Complex Networks ◽  
Power Law ◽  
Network Topology ◽  
Degree Distribution ◽  
Growth Process ◽  
Preferential Attachment ◽  
Self Similarity ◽  
Scale Free ◽  
Scale Free Networks ◽  
Definition Of

The scale-free (SF) property is a major concept in complex networks, and it is based on the definition that an SF network has a degree distribution that follows a power-law (PL) pattern. This paper highlights that not all networks with a PL degree distribution arise through a Barabási−Albert (BA) preferential attachment growth process, a fact that, although evident from the literature, is often overlooked by many researchers. For this purpose, it is demonstrated, with simulations, that established measures of network topology do not suffice to distinguish between BA networks and other (random-like and lattice-like) SF networks with the same degree distribution. Additionally, it is examined whether an existing self-similarity metric proposed for the definition of the SF property is also capable of distinguishing different SF topologies with the same degree distribution. To contribute to this discrimination, this paper introduces a spectral metric, which is shown to be more capable of distinguishing between different SF topologies with the same degree distribution, in comparison with the existing metrics.

The structural properties and the spanning trees entropy of the generalized Fractal Scale-Free Lattice

2019 ◽  
Vol 8 (2) ◽  
Author(s):  
Raihana Mokhlissi ◽  
Dounia Lotfi ◽  
Mohamed El Marraki ◽  
Joyati Debnath
Keyword(s):  
Complex Networks ◽  
Structural Properties ◽  
Power Law ◽  
Degree Distribution ◽  
Spanning Trees ◽  
Free Lattice ◽  
Scale Free ◽  
Computer Scientists ◽  
Electrical Engineers ◽  
Number Of Spanning Trees

Abstract Enumerating all the spanning trees of a complex network is theoretical defiance for mathematicians, electrical engineers and computer scientists. In this article, we propose a generalization of the Fractal Scale-Free Lattice and we study its structural properties. As its degree distribution follows a power law, we prove that the proposed generalization does not affect the scale-free property. In addition, we use the electrically equivalent transformations to count the number of spanning trees in the generalized Fractal Scale-Free Lattice. Finally, in order to evaluate the robustness of the generalized lattice, we compute and compare its entropy with other complex networks having the same average degree.

scholarly journals Dense Networks With Mixture Degree Distribution

2021 ◽  
Vol 9 ◽  
Author(s):  
Xiaomin Wang ◽  
Fei Ma ◽  
Bing Yao
Keyword(s):  
Complex Networks ◽  
Degree Distribution ◽  
Metabolic Networks ◽  
First Passage Time ◽  
Small World ◽  
Passage Time ◽  
Friendship Networks ◽  
Scale Free ◽  
Dense Networks ◽  
Protein Protein Interaction

Complex networks have become a powerful tool to describe the structure and evolution in a large quantity of real networks in the past few years, such as friendship networks, metabolic networks, protein–protein interaction networks, and software networks. While a variety of complex networks have been published, dense networks sharing remarkable structural properties, such as the scale-free feature, are seldom reported. Here, our goal is to construct a class of dense networks. Then, we discover that our networks follow the mixture degree distribution; that is, there is a critical point above which the cumulative degree distribution has a power-law form and below which the exponential distribution is observed. Next, we also prove the networks proposed to show the small-world property. Finally, we study random walks on our networks with a trap fixed at a vertex with the highest degree and find that the closed form for the mean first-passage time increases logarithmically with the number of vertices of our networks.

scholarly journals Random complex networks

2014 ◽  
Vol 1 (3) ◽  
pp. 357-367 ◽  
Author(s):  
Michael Small ◽  
Lvlin Hou ◽  
Linjun Zhang
Keyword(s):  
Complex Networks ◽  
Degree Distribution ◽  
Preferential Attachment ◽  
Small World ◽  
Node Degree ◽  
Scale Free ◽  
Wide Range ◽  
Random Complex ◽  
Law Degree ◽  
Attachment Process

Abstract Exactly what is meant by a ‘complex’ network is not clear; however, what is clear is that it is something other than a random graph. Complex networks arise in a wide range of real social, technological and physical systems. In all cases, the most basic categorization of these graphs is their node degree distribution. Particular groups of complex networks may exhibit additional interesting features, including the so-called small-world effect or being scale-free. There are many algorithms with which one may generate networks with particular degree distributions (perhaps the most famous of which is preferential attachment). In this paper, we address what it means to randomly choose a network from the class of networks with a particular degree distribution, and in doing so we show that the networks one gets from the preferential attachment process are actually highly pathological. Certain properties (including robustness and fragility) which have been attributed to the (scale-free) degree distribution are actually more intimately related to the preferential attachment growth mechanism. We focus here on scale-free networks with power-law degree sequences—but our methods and results are perfectly generic.

SNAM

2016 ◽  
pp. 215-236 ◽  
Author(s):  
Bassant Youssef ◽  
Scott F. Midkiff ◽  
Mohamed R. M. Rizk
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Degree Distribution ◽  
Network Models ◽  
Small World ◽  
Clustering Coefficient ◽  
Network Nodes ◽  
Scale Free ◽  
Complex Network Models ◽  
Novel Model

Complex networks are characterized by having a scale-free power-law (PL) degree distribution, a small world phenomenon, a high average clustering coefficient, and the emergence of community structure. Most proposed models did not incorporate all of these statistical properties and neglected incorporating the heterogeneous nature of network nodes. Even proposed heterogeneous complex network models were not generalized for different complex networks. We define a novel aspect of node-heterogeneity which is the node connection standard heterogeneity. We introduce our novel model “settling node adaptive model” SNAM which reflects this new nodes' heterogeneous aspect. SNAM was successful in preserving PL degree distribution, small world phenomenon and high clustering coefficient of complex networks. A modified version of SNAM shows the emergence of community structure. We prove using mathematical analysis that networks generated using SNAM have a PL degree distribution.

scholarly journals Co-Movement in Stock Markets Based on Directed Complex Network

2016 ◽  
Vol 8 (2) ◽  
pp. 179
Author(s):  
Zhen Du ◽  
Pujiang Chen ◽  
Na Luo ◽  
Yingjie Tang
Keyword(s):  
Complex Network ◽  
Power Law ◽  
Degree Distribution ◽  
Path Length ◽  
Stock Exchange ◽  
Small World ◽  
Clustering Coefficient ◽  
Power Law Distribution ◽  
Scale Free ◽  
Set Up

<p>In this paper, directed complex network is applied to the study of A shares in SSE (Shanghai Stock Exchange). In order to discuss the intrinsic attributes and regularities in stock market, we set up a directed complex network, selecting 450 stocks as nodes between 2012 and 2014 and stock yield correlation connected as edges. By discussing out-degree and in-degree distribution, we find essential nodes in stock network, which represent the leading stock,. Moreover, we analyze directed average path length and clustering coefficient in the condition of different threshold, which shows that the network doesn’t have a small- world effect. Furthermore, we see that when threshold is between 0.08 and 0.15, the network follows the power-law distribution and behaves scale-free.</p>

NECESSARY BACKBONE OF SUPERHIGHWAYS FOR TRANSPORT ON GEOGRAPHICAL COMPLEX NETWORKS

2009 ◽  
Vol 12 (01) ◽  
pp. 73-86 ◽  
Author(s):  
YUKIO HAYASHI
Keyword(s):  
Wireless Communication ◽  
Theoretical Prediction ◽  
Complex Networks ◽  
Shortest Path ◽  
Power Law ◽  
Degree Distribution ◽  
Topological Structure ◽  
Topological Properties ◽  
Scale Free ◽  
Law Degree

Many real networks have a common topological structure called scale-free (SF) that follows a power law degree distribution, and are embedded on an almost planar space which is suitable for wireless communication. However, the geographical constraints on local cycles cause more vulnerable connectivity against node removals, whose tolerance is reduced from the theoretical prediction under the assumption of uncorrelated locally tree-like structure. We consider a realistic generation of geographical networks with the SF property, and show the significant improvement of the robustness by adding a small fraction of shortcuts between randomly chosen nodes. Moreover, we quantitatively investigate the contribution of shortcuts to transport many packets on the shortest path for the spatially different amount of communication requests. Such a shortcut strategy preserves topological properties and a backbone naturally emerges bridging isolated clusters.

Sign in / Sign up

Export Citation Format

Share Document