نتایج جستجو برای: clustering coefficient

تعداد نتایج: 268773  

Background: Since tumors located in thorax region of body mainly move due to respiration, in the modern radiotherapy, there have been many attempts such as; external markers, strain gage and spirometer represent for monitoring patients’ breathing signal. With the advent of fluoroscopy technique, indirect methods were proposed as an alternative approach to extract patients’ breathing signals...

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2005
M Angeles Serrano Marián Boguñá

We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the clustering coefficient for each class of nodes of degree k are fixed ad hoc and a priori. The algorithm generates corresponding topologies by applying first a closure...

2008
Peng Zhang Jinliang Wang Xiaojia Li Zengru Di Ying Fan

Many real-world networks display a natural bipartite structure. It is necessary and important to study the bipartite networks by using the bipartite structure of the data. Here we propose a modification of the clustering coefficient given by the fraction of cycles with size four in bipartite networks. Then we compare the two definitions in a special graph, and the results show that the modifica...

Journal: :Internet Mathematics 2014
Elisabetta Candellero Nikolaos Fountoulakis

Clustering is a fundamental property of complex networks and it is the mathematical expression of a ubiquitous phenomenon that arises in various types of self-organized networks such as biological networks, computer networks or social networks. In this paper, we consider what is called the global clustering coefficient of random graphs on the hyperbolic plane. This model of random graphs was pr...

2008
Norihito Toyota

We have proposed two new dynamic networks where two node are swapped each other, and showed that the both networks behave as a small world like in the average path length but can not make any effective discussions on the clustering coefficient because of the topological invariant properties of the networks. In this article we introduce a new index, ”hamming coefficient” or ”multiplicity”, that ...

2018
Naoki Masuda Michiko Sakaki Takahiro Ezaki Takamitsu Watanabe

Graph theory is a useful tool for deciphering structural and functional networks of the brain on various spatial and temporal scales. The clustering coefficient quantifies the abundance of connected triangles in a network and is a major descriptive statistics of networks. For example, it finds an application in the assessment of small-worldness of brain networks, which is affected by attentiona...

Journal: :CoRR 2015
Ernesto Estrada Michele Benzi

Core-satellite graphs (sometimes referred to as generalized friendship graphs) are an interesting class of graphs that generalize many well known types of graphs. In this paper we show that two popular clustering measures, the average Watts-Strogatz clustering coefficient and the transitivity index, diverge when the graph size increases. We also show that these graphs are disassortative. In add...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید