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

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

Journal: :CoRR 2012
Péter Pollner Gergely Palla Tamás Vicsek

We study the behavior of the clustering coefficient in tagged networks. The rich variety of tags associated with the nodes in the studied systems provide additional information about the entities represented by the nodes which can be important for practical applications like searching in the networks. Here we examine how the clustering coefficient changes when narrowing the network to a sub-gra...

2006
Vincenza Carchiolo Michele Malgeri Giuseppe Mangioni Vincenzo Nicosia

PROSA tries to simulate the evolution of human relationships from simple acquaintance to friendship and partnership. Our target is to obtain a self– reconfiguring P2P system which possesses some of the desirable features of social communities. We show that PROSA naturally evolves into a small–world network, with an high clustering coefficient and a relly short average path length.

Journal: :CoRR 2015
J. Liebig A. Rao

Predicting the popularity of items in rating networks is an interesting but challenging problem. This is especially so when an item has first appeared and has received very few ratings. In this paper, we propose a novel approach to predicting the future popularity of new items in rating networks, defining a new bipartite clustering coefficient to predict the popularity of movies and stories in ...

Journal: :Journal of Complex Networks 2021

Abstract The clustering coefficient has been introduced to capture the social phenomena that a friend of tends be my friend. This metric widely studied and shown great interest describe characteristics graph. But, is originally defined for graph in which links are undirected, such as friendship (Facebook) or professional (LinkedIn). For directed from source information consumer information, it ...

Journal: :CoRR 2013
Dharshana Kasthurirathna Piraveenan Mahendra Gnana Thedchanamoorthy

In this paper, we explore the relationship between the topological characteristics of a complex network and its robustness to sustained targeted attacks. Using synthesised scale-free, smallworld and random networks, we look at a number of network measures, including assortativity, modularity, average path length, clustering coefficient, rich club profiles and scale-free exponent (where applicab...

2016
Sanne C. T. Peeters Ed H. B. M. Gronenschild Therese van Amelsvoort Jim van Os Machteld Marcelis Rene Kahn Durk Wiersma Richard Bruggeman Wiepke Cahn Lieuwe de Haan Carin Meijer Inez Myin‐Germeys

BACKGROUND Previous research has shown that the human brain can be represented as a complex functional network that is characterized by specific topological properties, such as clustering coefficient, characteristic path length, and global/local efficiency. Patients with psychotic disorder may have alterations in these properties with respect to controls, indicating altered efficiency of networ...

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

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