scholarly journals K-truss decomposition for Scale-Free Graphs at Scale in Distributed Memory

Author(s):  
Roger Pearce ◽  
Geoffrey Sanders
IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 59833-59842 ◽  
Author(s):  
Wenchao Jiang ◽  
Yinhu Zhai ◽  
Zhigang Zhuang ◽  
Paul Martin ◽  
Zhiming Zhao ◽  
...  

2006 ◽  
Vol 53 (3) ◽  
pp. 381-385 ◽  
Author(s):  
G. Acosta ◽  
M. Graña ◽  
J. P. Pinasco

2006 ◽  
Vol 371 (2) ◽  
pp. 870-876 ◽  
Author(s):  
S. Martin ◽  
R.D. Carr ◽  
J.-L. Faulon

2010 ◽  
Vol 38 (4) ◽  
pp. 396-421 ◽  
Author(s):  
Colin Cooper ◽  
Paweł Prałat
Keyword(s):  

PLoS ONE ◽  
2020 ◽  
Vol 15 (11) ◽  
pp. e0240100
Author(s):  
Khalid Bakhshaliyev ◽  
Mehmet Hadi Gunes

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.


Author(s):  
Graziano Vernizzi ◽  
Henri Orland

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.


2013 ◽  
Vol 87 (2) ◽  
Author(s):  
F. Flegel ◽  
I. M. Sokolov
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document