About clique number estimates and exact enumeration in scale-free networks

2020 ◽  
Vol 8 (2) ◽  
Author(s):  
Andrej Jursa ◽  
Mária Markošová ◽  
Boris Rudolf
Keyword(s):  
Upper Bound ◽  
Computation Time ◽  
Clique Number ◽  
Exact Enumeration ◽  
Scale Free ◽  
Scale Free Networks ◽  
Number Problem ◽  
Upper Bound Estimate ◽  
Arbitrary Graphs ◽  
Short Time

Abstract In this article, we present several analytical methods for both correlated and uncorrelated scale-free networks to obtain the clique number upper bound estimate. To test these estimates, we developed several tools to construct networks with scale-free degree distribution. To compute an exact clique number of network in short time, we also developed a clique finder algorithm. As the empirical results show, the various estimate methods gives good upper bounding for the clique numbers. Our clique finder proves to be able to solve clique number problem of arbitrary graphs in a good computation time. To show this, we applied our clique finder on benchmark graphs from various known databases.

Accelerated Network Traversal Using Multi/Many-Cores

2018 ◽  
pp. 59-86
Keyword(s):  
Big Data ◽  
Computation Time ◽  
Small World ◽  
Parallel Architectures ◽  
New Paradigm ◽  
Scale Free ◽  
Scale Free Networks ◽  
Heterogeneous Nodes ◽  
Synthetic Networks

New BSP platforms like TOTEM are following a similar approach to Big Data industry-proven frameworks but applied to exploit the potential of HPC heterogeneous nodes that combine multi-cores and GPUs. The performance of platforms under this new paradigm depends on minimizing the computation time of partitions by increasing the suitability of partitions to processors. However, there is a lack of studies on the suitability of parallel architectures for processing different families of graphs, including small-world and scale-free networks. In this chapter, the authors show how to characterize the performance of multi/many-cores when traversing synthetic networks of varying topology in order to reveal the suitability of multi-cores and GPUs for processing different families of graphs.

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

scholarly journals Antigen receptor repertoires of one of the smallest known vertebrates

2021 ◽  
Vol 7 (1) ◽  
pp. eabd8180
Author(s):  
Orlando B. Giorgetti ◽  
Prashant Shingate ◽  
Connor P. O’Meara ◽  
Vydianathan Ravi ◽  
Nisha E. Pillai ◽  
...  
Keyword(s):  
Immune Responses ◽  
Antigen Receptor ◽  
Fundamental Property ◽  
Cell Receptor ◽  
Immune Reactivity ◽  
Self Similarity ◽  
Frequency Distributions ◽  
Scale Free ◽  
Scale Free Networks ◽  
Incomplete Sampling

The rules underlying the structure of antigen receptor repertoires are not yet fully defined, despite their enormous importance for the understanding of adaptive immunity. With current technology, the large antigen receptor repertoires of mice and humans cannot be comprehensively studied. To circumvent the problems associated with incomplete sampling, we have studied the immunogenetic features of one of the smallest known vertebrates, the cyprinid fish Paedocypris sp. “Singkep” (“minifish”). Despite its small size, minifish has the key genetic facilities characterizing the principal vertebrate lymphocyte lineages. As described for mammals, the frequency distributions of immunoglobulin and T cell receptor clonotypes exhibit the features of fractal systems, demonstrating that self-similarity is a fundamental property of antigen receptor repertoires of vertebrates, irrespective of body size. Hence, minifish achieve immunocompetence via a few thousand lymphocytes organized in robust scale-free networks, thereby ensuring immune reactivity even when cells are lost or clone sizes fluctuate during immune responses.

scholarly journals Epidemic spreading in lattice-embedded scale-free networks

2007 ◽  
Vol 377 (1) ◽  
pp. 125-130 ◽  
Author(s):  
Xin-Jian Xu ◽  
Zhi-Xi Wu ◽  
Guanrong Chen
Keyword(s):  
Epidemic Spreading ◽  
Scale Free ◽  
Scale Free Networks
Sign in / Sign up

Export Citation Format

Share Document