Flight MH370 Community Structure

International Journal of Web Based Communities, 2013

Proceedings of The National Academy of Sciences, 2002

A number of recent studies have focused on the statistical properties of networked systems such as social networks and the World-Wide Web. Researchers have concentrated particularly on a few properties which seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this paper, we highlight another property which is found in many networks, the property of community structure, in which network nodes are joined together in tightly-knit groups between which there are only looser connections. We propose a new method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer generated and real-world graphs whose community structure is already known, and find that it detects this known structure with high sensitivity and reliability. We also apply the method to two networks whose community structure is not well-known-a collaboration network and a food web-and find that it detects significant and informative community divisions in both cases.

Expert Systems with Applications, 2018

Based on an expert systems approach, the issue of community detection can be conceptualized as a clustering model for networks. Building upon this further, community structure can be measured through a clustering coefficient, which is generated from the number of existing triangles around the nodes over the number of triangles that can be hypothetically constructed. This paper provides a new definition of the clustering coefficient for weighted networks under a generalized definition of triangles. Specifically, a novel concept of triangles is introduced, based on the assumption that, should the aggregate weight of two arcs be strong enough, a link between the uncommon nodes can be induced. Beyond the intuitive meaning of such generalized triangles in the social context, we also explore the usefulness of them for gaining insights into the topological structure of the underlying network. Empirical experiments on the standard networks of 500 commercial US airports and on the nervous system of the Caenorhabditis elegans support the theoretical framework and allow a comparison between our proposal and the standard definition of clustering coefficient.

Journal of Physics: Conference Series, 2020

Individuals connected to realistic networks exhibit collective behavior. In order to characterize this phenomenon and explore the correlation between collective behaviors and locally interacting elements, we use statistical methods and visualization software as a combined approach to understand the behavior of the network for a given behavior of the agents that we use to recreate our network. The aim of this work is to identify the communities as hierarchical structures trying to find them between a giant component and a small-world network. By analyzing the data and describing how these networks fall in community structure, we aim to obtain new tools and methodology which will help us to describe how networks grow and fall apart in smaller structures, which have similar features with the large network, but different dynamics.

Physical Review E, 2003

We propose a procedure for analyzing and characterizing complex networks. We apply this to the social network as constructed from email communications within a medium sized university with about 1700 employees. Email networks provide an accurate and nonintrusive description of the flow of information within human organizations. Our results reveal the self-organization of the network into a state where the distribution of community sizes is self-similar. This suggests that a universal mechanism, responsible for emergence of scaling in other self-organized complex systems, as, for instance, river networks, could also be the underlying driving force in the formation and evolution of social networks.

SSRN Electronic Journal

Regarding complex networks, one of the most relevant problems is to understand and to explore community structure. In particular it is important to define the network organization and the functions associated to the different network partitions. In this context, the idea is to consider some new approaches based on interval data in order to represent the different relevant network components as communities. The method is also useful to represent the network community structure, especially the network hierarchical structure. The application of the methodologies is based on the Italian interlocking directorship network.

2009

We investigate a functional definition of community structure in complex networks. In particular, we consider networks whose function is enhanced by the ability to synchronize and/or by resilience to node failures. Previous work has shown that the largest eigenvalue of the network's adjacency matrix provides insight into both synchronization and percolation processes. Thus, for networks whose goal is to perform

The European Physical Journal B-Condensed Matter and Complex Systems, 2004

We present an empirical study of different social networks obtained from digital repositories. Our analysis reveals the community structure and provides a useful visualising technique. We investigate the scaling properties of the community size distribution, and find that all the networks exhibit power law scaling in the community size distributions with exponent either-0.5 or-1. Finally we find that the networks' community structure is topologically self-similar using the Horton-Strahler index.

Physica A: Statistical Mechanics and its Applications, 2006

The issue of partitioning a network into communities has attracted a great deal of attention recently. Most authors seem to equate this issue with the one of finding the maximum value of the modularity, as defined by Newman. Since the problem formulated this way is believed to be NP-hard, most effort has gone into the construction of search algorithms, and less to the question of other measures of community structures, similarities between various partitionings and the validation with respect to external information. Here we concentrate on a class of computer generated networks and on three well-studied real networks which constitute a bench-mark for network studies; the karate club, the US college football teams and a gene network of yeast. We utilize some standard ways of clustering data (originally not designed for finding community structures in networks) and show that these classical methods sometimes outperform the newer ones. We discuss various measures of the strength of the modular structure, and show by examples features and drawbacks. Further, we compare different partitions by applying some graph-theoretic concepts of distance, which indicate that one of the quality measures of the degree of modularity corresponds quite well with the distance from the true partition. Finally, we introduce a way to validate the partitionings with respect to external data when the nodes are classified but the network structure is unknown. This is here possible since we know everything of the computer generated networks, as well as the historical answer to how the karate club and the football teams are partitioned in reality. The partitioning of the gene network is validated by use of the Gene Ontology database, where we show that a community in general corresponds to a biological process.

2012

Abstract: One of the main organizing principles in real-world social, information and technological networks is that of network communities, where sets of nodes organize into densely linked clusters. Even though detection of such communities is of great interest, understanding the structure communities in large networks remains relatively limited. Due to unavailability of labeled ground-truth data it is practically impossible to evaluate and compare different models and notions of communities on a large scale.