A Swirl-shaped Deterministic Network with High Clustering Coefficient
نویسندگان
چکیده
منابع مشابه
A Clustering Coefficient Network Formation Game
Social and other networks have been shown empirically to exhibit high edge clustering—that is, the density of local neighborhoods, as measured by the clustering coefficient, is often much larger than the overall edge density of the network. In social networks, a desire for tightknit circles of friendships — the colloquial “social clique” — is often cited as the primary driver of such structure....
متن کاملNetwork clustering coefficient without degree-correlation biases.
The clustering coefficient quantifies how well connected are the neighbors of a vertex in a graph. In real networks it decreases with the vertex degree, which has been taken as a signature of the network hierarchical structure. Here we show that this signature of hierarchical structure is a consequence of degree-correlation biases in the clustering coefficient definition. We introduce a definit...
متن کاملCurvature of Indoor Sensor Network: Clustering Coefficient
We investigate the geometric properties of the communication graph in realistic low-power wireless networks. In particular, we explore the concept of the curvature of a wireless network via the clustering coefficient. Clustering coefficient analysis is a computationally simplified, semilocal approach, which nevertheless captures such a large-scale feature as congestion in the underlying network...
متن کاملEvolutionary game on networks with high clustering coefficient
Abstract This study investigates the influence of lattice structure in evolutionary games. The snowdrift games is considered in networks with high clustering coefficients, that use four different strategyupdating. Analytical conjectures using pair approximation were compared with the numerical results. Results indicate that general statements asserting that the lattice structure enhances cooper...
متن کاملDeterministic clustering with data nets
We consider the K-clustering problem with the `2 distortion measure, also known as the problem of optimal fixed-rate vector quantizer design. We provide a deterministic approximation algorithm which works for all dimensions d and which, given a data set of size n, computes in time poly(K)(d/ε)n log log n+(d/ε) a solution of distortion at most 1+ε times optimal. The key tool is construction of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2011
ISSN: 1812-5638
DOI: 10.3923/itj.2011.1994.1998