Related papers: Small-world of communities: communication and corr…

Given a network and a partition in communities, we consider the issues "how communities influence each other" and "when two given communities do communicate". Specifically, we address these questions in the context of small-world networks,…

We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…

We introduce an intuitive model that describes both the emergence of community structure and the evolution of the internal structure of communities in growing social networks. The model comprises two complementary mechanisms: One mechanism…

Recent progress in the large scale mapping of social networks is opening new quantitative windows into the structure of human societies. These networks are largely the result of how we access and utilize information. Here I show that a…

Most existing approaches for community detection require complete information of the graph in a specific scale, which is impractical for many social networks. We propose a novel algorithm that does not embrace the universal approach but…

We investigate several geometric models of network which simultaneously have some nice global properties, that the small diameter property, the small-community phenomenon, which is defined to capture the common experience that (almost)…

Community structure is essential for social communications, where individuals belonging to the same community are much more actively interacting and communicating with each other than those in different communities within the human society.…

The ability of groups to make accurate collective decisions depends on a complex interplay of various factors, such as prior information, biases, social influence, and the structure of the interaction network. Here, we investigate a spin…

Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network,…

We consider the problem of selecting a minimum size subset of nodes in a network, that allows to activate all the nodes of the network. We present a fast and simple algorithm that, in real-life networks, produces solutions that outperform…

We present a user of model interaction based on the physics of kinetic exchange, and extend it to individuals placed in a grid with local interaction. We show with numerical analysis and partial analytical results that the critical symmetry…

Interactions in natural communities can be highly heterogeneous, with any given species interacting appreciably with only some of the others, a situation commonly represented by sparse interaction networks. We study the consequences of…

Starting from a general \textit{ansatz}, we show how community detection can be interpreted as finding the ground state of an infinite range spin glass. Our approach applies to weighted and directed networks alike. It contains the…

We study the problem of testing for community structure in networks using relations between the observed frequencies of small subgraphs. We propose a simple test for the existence of communities based only on the frequencies of three-node…

A fast community detection algorithm based on a q-state Potts model is presented. Communities in networks (groups of densely interconnected nodes that are only loosely connected to the rest of the network) are found to coincide with the…

Detecting and characterizing community structure plays a crucial role in the study of networked systems. However, there is still a lack of understanding of how community structure affects the systems' resilience and stability. Here, we…

The concept of communicability is introduced for complex socio-economic networks. The communicability function expresses how an impact propagates from one place to another in the network. This function is used to define unambiguously the…

The small-world phenomenon is found in many self-organising systems. Systems configured in small-world networks spread information more easily than in random or regular lattice-type networks. Whilst it is a known fact that small-world…

Community structure exists in many real-world networks and has been reported being related to several functional properties of the networks. The conventional approach was partitioning nodes into communities, while some recent studies start…

We consider the problem of detecting a tight community in a sparse random network. This is formalized as testing for the existence of a dense random subgraph in a random graph. Under the null hypothesis, the graph is a realization of an…