Sciweavers

5 search results - page 1 / 1
» Extended Clustering Coefficients of Small-World Networks
Sort
View
ICCS
2007
Springer
13 years 8 months ago
Extended Clustering Coefficients of Small-World 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 conn...
Wenjun Xiao, Yong Qin, Behrooz Parhami
CMOT
2004
141views more  CMOT 2004»
13 years 4 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
BMCBI
2006
84views more  BMCBI 2006»
13 years 4 months ago
Inferring topology from clustering coefficients in protein-protein interaction networks
Background: Although protein-protein interaction networks determined with high-throughput methods are incomplete, they are commonly used to infer the topology of the complete inte...
Caroline C. Friedel, Ralf Zimmer
IM
2008
13 years 4 months ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman
CGF
2010
121views more  CGF 2010»
13 years 4 months ago
GraphDice: A System for Exploring Multivariate Social Networks
Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these net...
Anastasia Bezerianos, Fanny Chevalier, Pierre Drag...