Independence polynomial and matching polynomial of the Koch network

2015 ◽  
Vol 29 (32) ◽  
pp. 1550234
Author(s):  
Yunhua Liao ◽  
Xiaoliang Xie
Keyword(s):  
Lattice Gas ◽  
Small World ◽  
Partition Functions ◽  
Complete Class ◽  
Dimer Model ◽  
Scale Free ◽  
Matching Polynomial ◽  
Independence Polynomial ◽  
Classical Models ◽  
Explicit Formulae

The lattice gas model and the monomer-dimer model are two classical models in statistical mechanics. It is well known that the partition functions of these two models are associated with the independence polynomial and the matching polynomial in graph theory, respectively. Both polynomials have been shown to belong to the “[Formula: see text]-complete” class, which indicate the problems are computationally “intractable”. We consider these two polynomials of the Koch networks which are scale-free with small-world effects. Explicit recurrences are derived, and explicit formulae are presented for the number of independent sets of a certain type.

Monomer–dimer model on a scale-free small-world network

2012 ◽  
Vol 391 (3) ◽  
pp. 828-833 ◽  
Author(s):  
Zhongzhi Zhang ◽  
Yibin Sheng ◽  
Qiang Jiang
Keyword(s):  
Small World ◽  
Small World Network ◽  
Dimer Model ◽  
Scale Free

Top Museums on Instagram

2019 ◽  
Vol 3 (2) ◽  
pp. 18-42 ◽  
Author(s):  
Vasiliki G. Vrana ◽  
Dimitrios A. Kydros ◽  
Evangelos C. Kehris ◽  
Anastasios-Ioannis T. Theocharidis ◽  
George I. Kavavasilis
Keyword(s):  
Social Network ◽  
Network Analysis ◽  
Small World ◽  
Marketing Strategies ◽  
The Other ◽  
Small World Network ◽  
Scale Free ◽  
Centrality Metrics ◽  
Photo Sharing ◽  
Visualization Algorithms

Pictures speak louder than words. In this fast-moving world where people hardly have time to read anything, photo-sharing sites become more and more popular. Instagram is being used by millions of people and has created a “sharing ecosystem” that also encourages curation, expression, and produces feedback. Museums are moving quickly to integrate Instagram into their marketing strategies, provide information, engage with audience and connect to other museums Instagram accounts. Taking into consideration that people may not see museum accounts in the same way that the other museum accounts do, the article first describes accounts' performance of the top, most visited museums worldwide and next investigates their interconnection. The analysis uses techniques from social network analysis, including visualization algorithms and calculations of well-established metrics. The research reveals the most important modes of the network by calculating the appropriate centrality metrics and shows that the network formed by the museum Instagram accounts is a scale–free small world network.

STABILITY OF TWO TYPICAL COMPLEX DYNAMICAL NETWORKS

2008 ◽  
Vol 22 (05) ◽  
pp. 553-560 ◽  
Author(s):  
WU-JIE YUAN ◽  
XIAO-SHU LUO ◽  
PIN-QUN JIANG ◽  
BING-HONG WANG ◽  
JIN-QING FANG
Keyword(s):  
Numerical Simulation ◽  
Dissipative System ◽  
Small World ◽  
Complex Dynamical Networks ◽  
Dynamical Networks ◽  
Scale Free ◽  
Scale Free Networks ◽  
General Complex ◽  
The Stability ◽  
Theoretical Results

When being constructed, complex dynamical networks can lose stability in the sense of Lyapunov (i. s. L.) due to positive feedback. Thus, there is much important worthiness in the theory and applications of complex dynamical networks to study the stability. In this paper, according to dissipative system criteria, we give the stability condition in general complex dynamical networks, especially, in NW small-world and BA scale-free networks. The results of theoretical analysis and numerical simulation show that the stability i. s. L. depends on the maximal connectivity of the network. Finally, we show a numerical example to verify our theoretical results.

scholarly journals Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Xiuwen Fu ◽  
Yongsheng Yang ◽  
Haiqing Yao
Keyword(s):  
Random Network ◽  
Small World ◽  
Coupled Map Lattice ◽  
Wireless Sensor ◽  
Cascading Failures ◽  
Scale Free Network ◽  
Scale Free ◽  
Network Topologies ◽  
Free Network ◽  
Entire Network

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, max-degree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.

Beyond Scale-Free Small-World Networks: Cortical Columns for Quick Brains

2013 ◽  
Vol 110 (10) ◽  
Author(s):  
Ralph Stoop ◽  
Victor Saase ◽  
Clemens Wagner ◽  
Britta Stoop ◽  
Ruedi Stoop
Keyword(s):  
Small World ◽  
Small World Networks ◽  
Scale Free ◽  
Cortical Columns

SCALE-FREE AND SMALL-WORLD PROPERTIES OF A SPECIAL HIERARCHICAL NETWORK

Fractals ◽  
2019 ◽  
Vol 27 (02) ◽  
pp. 1950010
Author(s):  
DAOHUA WANG ◽  
YUMEI XUE ◽  
QIAN ZHANG ◽  
MIN NIU
Keyword(s):  
Degree Distribution ◽  
Path Length ◽  
Small World ◽  
Average Path Length ◽  
Clustering Coefficient ◽  
Hierarchical Network ◽  
Scale Free

Many real systems behave similarly with scale-free and small-world structures. In this paper, we generate a special hierarchical network and based on the particular construction of the graph, we aim to present a study on some properties, such as the clustering coefficient, average path length and degree distribution of it, which shows the scale-free and small-world effects of this network.

scholarly journals An Efficient Method of Generating Deterministic Small-World and Scale-Free Graphs for Simulating Real-World Networks

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 59833-59842 ◽  
Author(s):  
Wenchao Jiang ◽  
Yinhu Zhai ◽  
Zhigang Zhuang ◽  
Paul Martin ◽  
Zhiming Zhao ◽  
...  
Keyword(s):  
Efficient Method ◽  
Real World ◽  
Small World ◽  
Scale Free ◽  
Scale Free Graphs

SMALL-WORLD AND SCALE-FREE PROPERTIES OF FRACTAL NETWORKS MODELED ON n-DIMENSIONAL SIERPINSKI PYRAMID

Fractals ◽  
2017 ◽  
Vol 25 (06) ◽  
pp. 1750057 ◽  
Author(s):  
CHENG ZENG ◽  
MENG ZHOU
Keyword(s):  
Small World ◽  
The Self ◽  
Scale Free ◽  
Evolving Networks ◽  
Self Similar

In this paper, we construct evolving networks based on the construction of the [Formula: see text]-dimensional Sierpinski pyramid by the self-similar structure. We show that such networks have scale-free and small-world effects.

scholarly journals Quantitative method for resilience assessment framework of airport network during COVID-19

PLoS ONE ◽  
2021 ◽  
Vol 16 (12) ◽  
pp. e0260940
Author(s):  
Jiuxia Guo ◽  
Yang Li ◽  
Zongxin Yang ◽  
Xinping Zhu
Keyword(s):  
Complex Network ◽  
Small World ◽  
Global Scale ◽  
Assessment Framework ◽  
Small World Networks ◽  
Scale Free ◽  
Global Pandemic ◽  
Network Metrics ◽  
Resilience Assessment

The resilience and vulnerability of airport networks are significant challenges during the COVID-19 global pandemic. Previous studies considered node failure of networks under natural disasters and extreme weather. Herein, we propose a complex network methodology combined with data-driven to assess the resilience of airport networks toward global-scale disturbance using the Chinese airport network (CAN) and the European airport network (EAN) as a case study. The assessment framework includes vulnerability and resilience analyses from the network- and node-level perspectives. Subsequently, we apply the framework to analyze the airport networks in China and Europe. Specifically, real air traffic data for 232 airports in China and 82 airports in Europe are selected to form the CAN and EAN, respectively. The complex network analysis reveals that the CAN and the EAN are scale-free small-world networks, that are resilient to random attacks. However, the connectivity and vulnerability of the CAN are inferior to those of the EAN. In addition, we select the passenger throughput from the top-50 airports in China and Europe to perform a comparative analysis. By comparing the resilience evaluation of individual airports, we discovered that the factors of resilience assessment of an airport network for global disturbance considers the network metrics and the effect of government policy in actual operations. Additionally, this study also proves that a country’s emergency response-ability towards the COVID-19 has a significantly affectes the recovery of its airport network.

Sign in / Sign up

Export Citation Format

Share Document