Results 1  10
of
2,777
The Clustering Coefficient and the
 Diameter of Smallworld Networks, Acta Mathematica Sinca, English Series,2013,29(1):199208
"... Measured and numerically partitioned phytoplankton spectral absorption ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Measured and numerically partitioned phytoplankton spectral absorption
Approximating clustering coefficient and transitivity
 Journal of Graph Algorithms and Applications
, 2005
"... Since its introduction in the year 1998 by Watts and Strogatz, the clustering coefficient has become a frequently used tool for analyzing graphs. In 2002 the transitivity was proposed by Newman, Watts and Strogatz as an alternative to the clustering coefficient. As many networks considered in comple ..."
Abstract

Cited by 50 (1 self)
 Add to MetaCart
Since its introduction in the year 1998 by Watts and Strogatz, the clustering coefficient has become a frequently used tool for analyzing graphs. In 2002 the transitivity was proposed by Newman, Watts and Strogatz as an alternative to the clustering coefficient. As many networks considered
Clustering coefficient for weighted networks
, 2006
"... The clustering coefficient has been used successfully to summarise important features of unweighted, undirected networks across a wide range of applications. Recently, a number of authors have extended this concept to the case of networks with nonnegatively weighted edges. After reviewing various a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The clustering coefficient has been used successfully to summarise important features of unweighted, undirected networks across a wide range of applications. Recently, a number of authors have extended this concept to the case of networks with nonnegatively weighted edges. After reviewing various
EXTENDED CLUSTERING COEFFICIENTS:GENERALIZATION OF CLUSTERING COEFFICIENTS IN SMALLWORLD NETWORKS ∗
"... The clustering coefficient C of a network, which is a measure of direct connectivity between neighbors of the various nodes, ranges from 0 (for no connectivity) to 1 (for full connectivity). We define extended clustering coefficients C(h) of a smallworld network based on nodes that are at distance ..."
Abstract
 Add to MetaCart
The clustering coefficient C of a network, which is a measure of direct connectivity between neighbors of the various nodes, ranges from 0 (for no connectivity) to 1 (for full connectivity). We define extended clustering coefficients C(h) of a smallworld network based on nodes that are at distance
On Learning Cluster Coefficient of Private Networks
"... Abstract—Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as clustering coefficient or modularity often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum) on tabula ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract—Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as clustering coefficient or modularity often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum
Computing Clustering Coefficients in Data Streams
"... We present random sampling algorithms that with probability at least 1 − δ compute a (1 ± ǫ)approximation of the clustering coefficient, the transitivity coefficient, and of the number of bipartite cliques in a graph given as a stream of edges. Our methods can be extended to approximately count the ..."
Abstract
 Add to MetaCart
We present random sampling algorithms that with probability at least 1 − δ compute a (1 ± ǫ)approximation of the clustering coefficient, the transitivity coefficient, and of the number of bipartite cliques in a graph given as a stream of edges. Our methods can be extended to approximately count
Global clustering coefficient in scalefree networks
"... Abstract. 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 realworld networks of diverse nature. There a ..."
Abstract
 Add to MetaCart
Abstract. 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 realworld networks of diverse nature
Weighted Clustering Coefficient Maximization For Air Transportation Networks
"... Abstract — In transportation networks the robustness of a network regarding nodes and links failures is a key factor for its design. At the same time, traveling passengers usually prefer the itinerary with fewer legs. The average clustering coefficient can be used to measure the robustness of a net ..."
Abstract
 Add to MetaCart
Abstract — In transportation networks the robustness of a network regarding nodes and links failures is a key factor for its design. At the same time, traveling passengers usually prefer the itinerary with fewer legs. The average clustering coefficient can be used to measure the robustness of a
On the Streaming Complexity of Computing Local Clustering Coefficients
, 2013
"... Due to a large number of applications, the problem of estimating the number of triangles in graphs revealed as a stream of edges, and the closely related problem of estimating the graph’s clustering coefficient, have received considerable attention in the last decade. Both efficient algorithms and i ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Due to a large number of applications, the problem of estimating the number of triangles in graphs revealed as a stream of edges, and the closely related problem of estimating the graph’s clustering coefficient, have received considerable attention in the last decade. Both efficient algorithms
Results 1  10
of
2,777