Co-authorship network structure analysis

Abstract The analysis of networks of collaboration between scientists reveals features of academic communities that help in understanding the specifics of collaborative scientific work and identifying the notable researchers. In these networks, the set of nodes consists of authors and there exists a link between two authors if they have coauthored one or more papers. This article presents an analysis of the co-authorship network based on bibliometric data retrieved from the distributed economic database. Here we use the simple network model without taking into account the strength of collaborative ties. The data were analyzed using statistical techniques in order to get such parameters as the number of papers per author, the number of authors per paper, the average number of coauthors per author and collaboration indices. We show that the largest component occupies near 90 % of the network and the node degree distribution follows a power-law. The study of typical distances between nodes and the degree of clustering makes it possible to classify the network as a ‘small world’ network.

Download Full-text

A Kind of Deterministic Small-World Network Derived from Polygonal Nesting

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.614.543 ◽

2014 ◽

Vol 614 ◽

pp. 543-549

Author(s):

Hui Li ◽

Liang Yuan

Keyword(s):

Long Range ◽

Outer Layer ◽

Degree Distribution ◽

Path Length ◽

Small Diameter ◽

Small World ◽

Average Path Length ◽

Node Degree ◽

Small World Network ◽

Central Node

A kind of deterministic small-world network is constructed based on polygonal nesting with discrete degree distribution. By adding contrapuntal edges and alternate-position edges between adjacent nests, the intra-nest edges and the long-range edges from the central node to certain outer layer nodes, the proposed polygonal nesting small-world (PNSW) networks have the property of large clustering coefficients. Also these kinds of PNSW networks have small diameter, average node degree and average path length, whose moments ofkorder are given.

Download Full-text

TIME-DELAY ROBUSTNESS OF CONSENSUS PROBLEMS IN REGULAR AND COMPLEX NETWORKS

International Journal of Modern Physics C ◽

10.1142/s0129183107011364 ◽

2007 ◽

Vol 18 (08) ◽

pp. 1339-1350 ◽

Cited By ~ 2

Author(s):

ZHENGPING WU ◽

ZHI-HONG GUAN

Keyword(s):

Time Delay ◽

Complex Networks ◽

Nearest Neighbor ◽

Small World ◽

Node Degree ◽

Small World Network ◽

Scale Free Network ◽

Star Network ◽

Scale Free ◽

Free Network

Recent advances in complex network research have stimulated increasing interests in understanding the relationship between the topology and dynamics of complex networks. Based on the theory of complex networks and computer simulation, we analyze the robustness to time-delay in linear consensus problem with different network topologies, such as global coupled network, star network, nearest-neighbor coupled network, small-world network, and scale-free network. It is found that global coupled network, star network, and scale-free network are vulnerable to time-delay, while nearest-neighbor coupled network and small-world network are robust to time-delay. And it is found that the maximum node degree of the network is a good predictor for time-delay robustness. And it is found that the robustness to time-delay can be improved significantly by a decoupling process to a small part of edges in scale-free network.

Download Full-text

An Experimental Study of SmallWorld Network Models for Wireless Networks

Journal of Cyber Security and Mobility ◽

10.13052/2245-1439.442 ◽

2016 ◽

Author(s):

Ziqian Dong ◽

Zheng Wang ◽

Wen Xie ◽

Obinna Emelumadu ◽

Chuan- Bi Lin ◽

...

Keyword(s):

Wireless Networks ◽

Wireless Network ◽

Routing Protocols ◽

Mobile Ad Hoc Network ◽

Network Models ◽

Small World ◽

Theoretical Models ◽

Node Degree ◽

Small World Network ◽

Distributed Routing

The concept of small world phenomenon has been observed and applied in many types of networks. This paper presents a study of two small-world network models in clustering formation and routing in wireless network, the Watts and Stragtz’s (WS) and the Newman and Watts (NW) models and evaluates their properties in term of average node degree and path length. We tested the small world phenomenon in wireless networks by simulating a wireless mobile ad hoc network with distributed routing protocols. We present the research challenges of bridging the gap between theoretical models and practical wireless network implementation. This study provides insights on how wireless networks behave under small world network models with distributed routing protocols.

Download Full-text

Mobile agents' dynamic small-world network based on attention mechanism

2020 21st Asia-Pacific Network Operations and Management Symposium (APNOMS) ◽

10.23919/apnoms50412.2020.9237037 ◽

2020 ◽

Author(s):

Rong Xie

Keyword(s):

Mobile Agents ◽

Small World ◽

Attention Mechanism ◽

Small World Network

Download Full-text

Analysis of Oncogene Protein Structure Using Small World Network Concept

Current Bioinformatics ◽

10.2174/1574893614666191113143840 ◽

2020 ◽

Vol 15 (7) ◽

pp. 732-740

Author(s):

Neetu Kumari ◽

Anshul Verma

Keyword(s):

Amino Acids ◽

Protein Structure ◽

Degree Distribution ◽

Protein Structures ◽

Small World ◽

Extreme Condition ◽

Centrality Measures ◽

Small World Network ◽

Network Concept ◽

Oncogene Protein

Background: The basic building block of a body is protein which is a complex system whose structure plays a key role in activation, catalysis, messaging and disease states. Therefore, careful investigation of protein structure is necessary for the diagnosis of diseases and for the drug designing. Protein structures are described at their different levels of complexity: primary (chain), secondary (helical), tertiary (3D), and quaternary structure. Analyzing complex 3D structure of protein is a difficult task but it can be analyzed as a network of interconnection between its component, where amino acids are considered as nodes and interconnection between them are edges. Objective: Many literature works have proven that the small world network concept provides many new opportunities to investigate network of biological systems. The objective of this paper is analyzing the protein structure using small world concept. Methods: Protein is analyzed using small world network concept, specifically where extreme condition is having a degree distribution which follows power law. For the correct verification of the proposed approach, dataset of the Oncogene protein structure is analyzed using Python programming. Results: Protein structure is plotted as network of amino acids (Residue Interaction Graph (RIG)) using distance matrix of nodes with given threshold, then various centrality measures (i.e., degree distribution, Degree-Betweenness correlation, and Betweenness-Closeness correlation) are calculated for 1323 nodes and graphs are plotted. Conclusion: Ultimately, it is concluded that there exist hubs with higher centrality degree but less in number, and they are expected to be robust toward harmful effects of mutations with new functions.

Download Full-text

The structure of co-publications multilayer network

Computational Social Networks ◽

10.1186/s40649-021-00089-w ◽

2021 ◽

Vol 8 (1) ◽

Author(s):

Ghislain Romaric Meleu ◽

Paulin Yonta Melatagia

Keyword(s):

Power Law ◽

Degree Distribution ◽

Preferential Attachment ◽

Small World ◽

Generation Model ◽

Small World Network ◽

Power Law Distribution ◽

Multilayer Networks ◽

Multilayer Network ◽

Scientific Papers

AbstractUsing the headers of scientific papers, we have built multilayer networks of entities involved in research namely: authors, laboratories, and institutions. We have analyzed some properties of such networks built from data extracted from the HAL archives and found that the network at each layer is a small-world network with power law distribution. In order to simulate such co-publication network, we propose a multilayer network generation model based on the formation of cliques at each layer and the affiliation of each new node to the higher layers. The clique is built from new and existing nodes selected using preferential attachment. We also show that, the degree distribution of generated layers follows a power law. From the simulations of our model, we show that the generated multilayer networks reproduce the studied properties of co-publication networks.

Download Full-text

Top Museums on Instagram

International Journal of Computational Methods in Heritage Science ◽

10.4018/ijcmhs.2019070102 ◽

2019 ◽

Vol 3 (2) ◽

pp. 18-42 ◽

Cited By ~ 1

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.

Download Full-text

A Small World Routing Protocol in Wireless Sensor Networks

Key Engineering Materials ◽

10.4028/www.scientific.net/kem.474-476.828 ◽

2011 ◽

Vol 474-476 ◽

pp. 828-833

Author(s):

Wen Jun Xu ◽

Li Juan Sun ◽

Jian Guo ◽

Ru Chuan Wang

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Routing Protocol ◽

Data Transmission ◽

Small World ◽

Wireless Sensor ◽

Small World Network ◽

Average Delay ◽

Network Diameter ◽

Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

Download Full-text