Communities as cliques
High-diversity assemblages are very common in nature, and yet the factors allowing for the maintenance of biodiversity remain obscure. The competitive exclusion principle and May's complexity-diversity puzzle both suggest that a community can support only a small number of species, turning the spotlight at the dynamics of local patches or islands, where stable and uninvadable (SU) subsets of species play a crucial role. Here we map the community SUs question to the geometric problem of finding maximal cliques of the corresponding graph. We solve for the number of SUs as a function of the species richness in the regional pool, $N$, showing that this growth is subexponential, contrary to long-standing wisdom. We show that symmetric systems relax rapidly to an SU, where the system stays until a regime shift takes place. In asymmetric systems the relaxation time grows much faster with $N$, suggesting an excitable dynamics under noise.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversitySimilar Papers 제목 키워드 기반
Clique percolation method: memory efficient almost exact communities
Automatic detection of relevant groups of nodes in large real-world graphs, i.e. community detection, has applications in many fields and has received a lot of attention in the last twenty years. The most popular method …
Community DetectionDetecting Local Community Structures in Social Networks Using Concept Interestingness
One key challenge in Social Network Analysis is to design an efficient and accurate community detection procedure as a means to discover intrinsic structures and extract relevant information. In this paper, we introduce …
Community DetectionNovel Machine Learning Algorithms for Centrality and Cliques Detection in Youtube Social Networks
The goal of this research project is to analyze the dynamics of social networks using machine learning techniques to locate maximal cliques and to find clusters for the purpose of identifying a target demographic. Unsupe…
BIG-bench Machine LearningClusteringRecommendation SystemsNumerical Study of Interaction Network Structures in Competitive Ecosystems
We present a numerical analysis of local community assembly through weak migration from a regional species pool. At equilibrium, the local community consists of a subset ("clique") of species from the regional community.…
LSCPM: communities in massive real-world Link Streams by Clique Percolation Method
Community detection is a popular approach to understand the organization of interactions in static networks. For that purpose, the Clique Percolation Method (CPM), which involves the percolation of k-cliques, is a well-s…
Community Detection