Results 1 to 10 of about 577,453 (293)
Topology and correlations in structured scale-free networks [PDF]
, 2002 We study a recently introduced class of scale-free networks showing a high clustering coefficient and non-trivial connectivity correlations. We find that the connectivity probability distribution strongly depends on the fine details of the model.
A. Vázquez +37 more
core +4 more sources
A Name Recognition Method Based on Clustering Coefficient [PDF]
Jisuanji gongcheng, 2016 In many application fields of Chinese text analysis, name recognition is a widespread fundamental issue. Although there are several kinds of name recognition methods, they are mainly based on corpus statistics and language rules.
ZENG Jianping,LIU Hua
doaj +1 more source
The clustering coefficient of a scale-free random graph [PDF]
, 2008 We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant.
Eggemann, N, Noble, S D
core +2 more sources
Applying weighted network measures to microarray distance matrices
, 2008 In recent work we presented a new approach to the analysis of weighted networks, by providing a straightforward generalization of any network measure defined on unweighted networks.
+6 more
core +1 more source
Corrected Overlap Weight and Clustering Coefficient [PDF]
, 2019 The paper is a detailed and extended version of the talk presented at the CMStatistics (ERCIM) 2015 ...
openaire +2 more sources
Special identity subgraph in genetic code [PDF]
Network Biology, 2022 The genetic code is a series of codons that stores genetic information about protein molecule formation. The identity graph of a group G is a graph in which the vertex set is the set of all elements of the group and two vertices in G are adjacent if a.b =
Birinchi Kumar Boruah, Tazid Ali
doaj
Properties of highly clustered networks
, 2003 We propose and solve exactly a model of a network that has both a tunable degree distribution and a tunable clustering coefficient. Among other things, our results indicate that increased clustering leads to a decrease in the size of the giant component ...
A. Vázquez +28 more
core +1 more source
Global Clustering Coefficient in Scale-Free Networks [PDF]
, 2014 In this paper, we analyze the behavior of the global clustering coefficient in scale free graphs. We are especially interested in the case of degree distribution with an infinite variance, since such degree distribution is usually observed in real-world networks of diverse nature.
Prokhorenkova, Liudmila Ostroumova +1 more
openaire +2 more sources
Internet complex network separation degree analysis based on hops
Tongxin xuebao, 2005 At the first the infection of the same separation degree to different network’s transmission was discussed, then the infection of different separation degree to same network’s transmission was discussed by giving an example of small world network ...
SU Wei-ji, ZHAO Hai, XU Ye, ZHANG Wen-bo
doaj
New Journal of Physics, 2023 Identifying key spreaders in a network is one of the fundamental problems in the field of complex network research, and accurately identifying influential propagators in a network holds significant practical implications.
Hao Wang +5 more
doaj +1 more source