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

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

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2003
Agata Fronczak Piotr Fronczak Janusz A Hołyst

We applied a mean-field approach to study clustering coefficients in Barabási-Albert (BA) networks. We found that the local clustering in BA networks depends on the node degree. Analytic results have been compared to extensive numerical simulations finding a very good agreement for nodes with low degrees. Clustering coefficient of a whole network calculated from our approach perfectly fits nume...

Journal: :تحقیقات کاربردی خاک 0
ایمان صالح دانشگاه علوم کشاورزی و منابع طبیعی ساری عطااله کاویان دانشگاه علوم کشاورزی و منابع طبیعی ساری زینب جعفریان دانشگاه علوم کشاورزی و منابع طبیعی ساری رضا احمدی دانشگاه علوم کشاورزی و منابع طبیعی ساری

infiltration plays an important role in surface and subsurface hydrology and it is a key factor in the rainfall and runoff equations. the use of new approaches that have no limitations of common theoretical and empirical methods to determine infiltration relationships, will minimize the necessity of time consuming and costly experiments to determine permeability values and will make it possible...

Journal: :crop breeding journal 2012
r. karimizadeh m. mohammadi n. sabaghnia t. hosseinpour m. k. shafazadeh

the objective of this investigation was to evaluate the magnitude of g × e interaction effects on durum wheat grain yield and to identify superior genotypes adapted to the test environments. twenty improved durum wheat genotypes were tested in five locations over three growing seasons. combined anova indicated that the effect of year (y) was significant and that of the location (l) was not, but...

2016
Gergely Zahoránszky-Köhalmi Cristian Bologa Oleg Ursu Tudor I. Oprea

BACKGROUND Complex network theory based methods and the emergence of "Big Data" have reshaped the terrain of investigating structure-activity relationships of molecules. This change gave rise to new methods which need to face an important challenge, namely: how to restructure a large molecular dataset into a network that best serves the purpose of the subsequent analyses. With special focus on ...

2006
T. Chalumeau L. da F. Costa O. Laligant F. Meriaudeau

This article describes a new method and approch of texture characterization. Using complex network representation of an image, classical and derived (hierarchical) measurements, we presente how to have good performance in texture classification. Image is represented by a complex networks : one pixel as a node. Node degree and clustering coefficient, using with traditionnal and extended hierarch...

2008
Habiba Yintao Yu Tanya Y. Berger-Wolf Jared Saia

Social interactions are conduits for various processes spreading through a population, from rumors and opinions to behaviors and diseases. In the context of the spread of a disease or undesirable behavior, it is important to identify blockers: individuals that are most effective in stopping or slowing down the spread of a process through the population. This problem has so far resisted systemat...

2005
Dragan TASIĆ Miodrag STOJANOVIĆ

Two approaches to calculating distribution energy losses are developed in this paper. The first one is based on the fuzzy load flow, and the other one uses fuzzy clustering technique. The attention at the first approach is devoted to forming the fuzzy numbers that represent loads. Data accessible from the measurements in corresponding substations are considered in this process. Using formed fuz...

2012
SİBEL YALÇIN

In this paper, the class of harmonic functions f = h+ ḡ with positive real part and normalized by f(ζ) = 1, (|ζ| < 1) is studied, where h and g are analytic in U = {z : |z| < 1}. Some properties of this class are searched. Sharp coefficient relations are given for functions in this class. On the other hand, the author make use of Alexander integral transforms of certain analytic functions (whic...

Journal: :SIAM Journal of Applied Mathematics 2015
Ernesto Estrada Francesca Arrigo

We propose a communication-driven mechanism for predicting triadic closure in complex networks. It is mathematically formulated on the basis of communicability distance functions that account for the “goodness” of communication between nodes in the network. We study 25 real-world networks and show that the proposed method predicts correctly 20% of triadic closures in these networks, in contrast...

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

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