Graph Colorings Applied in Scale-Free Networks

2013 ◽  
Vol 760-762 ◽  
pp. 2199-2204 ◽  
Author(s):  
Chao Yang ◽  
Bing Yao ◽  
Hong Yu Wang ◽  
Xiang'en Chen ◽  
Si Hua Yang
Keyword(s):  
Communication Networks ◽  
Information Networks ◽  
Chromatic Numbers ◽  
Graph Colorings ◽  
Graph Models ◽  
Important Method ◽  
Scale Free ◽  
Scale Free Networks ◽  
As Graph

Building up graph models to simulate scale-free networks is an important method since graphs have been used in researching scale-free networks and communication networks, such as graph colorings can be used for distinguishing objects of communication and information networks. In this paper we determine the avdtc chromatic numbers of some models related with researching networks.

Edge-Magic Total Labellings of some Network Models

2013 ◽  
Vol 347-350 ◽  
pp. 2752-2757 ◽  
Author(s):  
Hong Yu Wang ◽  
Bing Yao ◽  
Chao Yang ◽  
Si Hua Yang ◽  
Xiang En Chen ◽  
...  
Keyword(s):  
Network Models ◽  
Graph Colorings ◽  
Scale Free ◽  
Symmetric Graphs ◽  
Scale Free Networks ◽  
Self Similar ◽  
As Graph

It has been known that edge-symmetric graphs can be used as models of some scale-free networks, such as hierarchial networks and self-similar networks, such as graph colorings can be used for distinguishing objects of communication and informa-tion networks. We study the edge-magic property of edge-symmetric graphs, and construct graphs having edge-magic total labellings from smaller graphs.

scholarly journals Six Susceptible-Infected-Susceptible Models on Scale-free Networks

2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Satoru Morita
Keyword(s):  
Field Theory ◽  
Mean Field Theory ◽  
Mean Field ◽  
Information Networks ◽  
Propagation Mechanism ◽  
Contact Rate ◽  
Scale Free ◽  
Scale Free Networks ◽  
Information Spread ◽  
Nature And Society

Abstract Spreading phenomena are ubiquitous in nature and society. For example, disease and information spread over underlying social and information networks. It is well known that there is no threshold for spreading models on scale-free networks; this suggests that spread can occur on such networks, regardless of how low the contact rate may be. In this paper, I consider six models with different contact and propagation mechanisms, which include models studied so far, but are apt to be confused. To compare these six models, I analyze them by degree-based mean-field theory. I find that the result depends on the details of contact and propagation mechanism.

Information Networks as Complex Systems

2011 ◽  
pp. 43-58
Author(s):  
Yoshiteru Ishida
Keyword(s):  
Complex Systems ◽  
Complex Network ◽  
Normal State ◽  
Small World ◽  
Information Networks ◽  
Small World Networks ◽  
Scale Free ◽  
Abnormal State ◽  
Scale Free Networks ◽  
Spatial Prisoner’S Dilemma

Complex network such as scale-free networks and small-world networks have been studied with the dynamics when the information percolates through the networks. This chapter reports the problem of spreading the normal state (rather than spreading of the abnormal state) that is formalized as cleaning a contaminated network by mutual copying. Repairing by copying is the “double edged sword” that could spread contamination when properly used. A framework for controlling copying involving a spatial Prisoner’s Dilemma is introduced. Adaptive character to the network environment has been observed.

Enhancing traffic capacity of scale-free networks by link-directed strategy

2016 ◽  
Vol 27 (03) ◽  
pp. 1650028 ◽  
Author(s):  
Jinlong Ma ◽  
Weizhan Han ◽  
Qing Guo ◽  
Shuai Zhang
Keyword(s):  
Communication Networks ◽  
Routing Protocol ◽  
Underlying Structure ◽  
Transport Efficiency ◽  
Scale Free ◽  
Traffic Capacity ◽  
Scale Free Networks ◽  
High Betweenness ◽  
Direction Determining ◽  
High Degree

The transport efficiency of a network is strongly related to the underlying structure. In this paper, we propose an efficient strategy named high-betweenness-first (HBF) for the purpose of improving the traffic handling capacity of scale-free networks by limiting a fraction of undirected links to be unidirectional ones based on the links’ betweenness. Compared with the high-degree-first (HDF) strategy, the traffic capacity can be more significantly enhanced under the proposed link-directed strategy with the shortest path (SP) routing protocol. Simulation results in the Barabási–Albert (BA) model for scale-free networks show that the critical generating rate [Formula: see text] which can evaluate the overall traffic capacity of a network system is larger after applying the HBF strategy, especially with nonrandom direction-determining rules. Because of the strongly improved traffic capacity, this work is helpful to design and optimize modern communication networks such as the software defined network.

Graphs as Models of Scale-Free Networks

2013 ◽  
Vol 380-384 ◽  
pp. 2034-2037 ◽  
Author(s):  
Bing Yao ◽  
Chao Yang ◽  
Ming Yao ◽  
Hong Yu Wang ◽  
Xiang En Chen ◽  
...  
Keyword(s):  
Theoretical Analysis ◽  
Genetic Information ◽  
Spanning Trees ◽  
Research Field ◽  
Network Graph ◽  
Graph Models ◽  
Scale Free ◽  
Scale Free Networks ◽  
Definition Of ◽  
Experimental Researches

In bioinformatics research field, researchers from biology, and physics, mathematics, computer science and other disciplines explore the mystery of genetic language by the combination of experimental researches and theoretical analysis, and try reveals the essence of biological genetic information. Bollobás and Riordan pointed out that the definition of scale-free in the context of network graph models has never been made precise. We use spanning trees and other graphs to illustrate some results and phenomenon and try expressing mathematically key notions from researching scale-free networks, and explore constructions and operations of complex networks.

scholarly journals Dynamics analysis of an online gambling spreading model on scale-free networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yu Kong ◽  
Tao Li ◽  
Yuanmei Wang ◽  
Xinming Cheng ◽  
He Wang ◽  
...  
Keyword(s):  
Network Topology ◽  
Negative Impact ◽  
Online Gambling ◽  
Basic Reproductive Number ◽  
Reproductive Number ◽  
Scale Free ◽  
Spreading Model ◽  
Spreading Dynamics ◽  
Scale Free Networks ◽  
Gambling Policy

AbstractNowadays, online gambling has a great negative impact on the society. In order to study the effect of people’s psychological factors, anti-gambling policy, and social network topology on online gambling dynamics, a new SHGD (susceptible–hesitator–gambler–disclaimer) online gambling spreading model is proposed on scale-free networks. The spreading dynamics of online gambling is studied. The basic reproductive number $R_{0}$ R 0 is got and analyzed. The basic reproductive number $R_{0}$ R 0 is related to anti-gambling policy and the network topology. Then, gambling-free equilibrium $E_{0}$ E 0 and gambling-prevailing equilibrium $E_{ +} $ E + are obtained. The global stability of $E_{0}$ E 0 is analyzed. The global attractivity of $E_{ +} $ E + and the persistence of online gambling phenomenon are studied. Finally, the theoretical results are verified by some simulations.

scholarly journals Effective gravitation path routing strategy on scale-free networks

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Jinlong Ma ◽  
Junfeng Zhang ◽  
Yongqiang Zhang
Keyword(s):  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks
Sign in / Sign up

Export Citation Format

Share Document