Related papers: Assessing the structural heterogeneity of supercoo…
We show that a simple community detection algorithm originated from stochastic blockmodel literature achieves consistency, and even optimality, for a broad and flexible class of sparse latent space models. The class of models includes…
Force chains form heterogeneous physical structures that can constrain the mechanical stability and acoustic transmission of granular media. However, despite their relevance for predicting bulk properties of materials, there is no agreement…
In a system of many similar self-propelled entities such as flocks of birds, fish school, cells and molecules, the interactions with neighbors can lead to a "coherent state", meaning the formation of visually compelling aggregation patterns…
Our recent paper [Grauwin et al. Sci. Rep. 7 (2017)] demonstrates that community and hierarchical structure of the networks of human interactions largely determines the least and should be taken into account while modeling them. In the…
Complex data in social and natural sciences find effective representation through networks, wherein quantitative and categorical information can be associated with nodes and connecting edges. The internal structure of networks can be…
Glassy systems are disordered systems characterized by extremely slow dynamics. Examples are supercooled liquids, whose dynamics slow down under cooling. The specific pattern of slowing-down depends on the material considered. This…
We report that the local Debye-Waller factor in a simulated 2D glass-forming mixture exhibits significant spatial heterogeneities and that these short time fluctuations provide an excellent predictor of the spatial distribution of the long…
The relationship of friends in social networks can be strong or weak. Some research works have shown that a close relationship between friends conducts good community structure. Based on this result, we propose an effective method in…
We describe techniques for the robust detection of community structure in some classes of time-dependent networks. Specifically, we consider the use of statistical null models for facilitating the principled identification of structural…
We use machine learning methods on local structure to identify flow defects - or regions susceptible to rearrangement - in jammed and glassy systems. We apply this method successfully to two disparate systems: a two dimensional experimental…
We study stochastic particle systems made up of heterogeneous units. We introduce a general framework suitable to analytically study this kind of systems and apply it to two particular models of interest in economy and epidemiology. We show…
How to estimate heterogeneity, e.g. the effect of some variable differing across observations, is a key question in political science. Methods for doing so make simplifying assumptions about the underlying nature of the heterogeneity to…
We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (Newman and Leicht 2007…
Many complex systems in nature and society can be described in terms of networks capturing the intricate web of connections among the units they are made of. A key question is how to interpret the global organization of such networks as the…
We combine computer simulations and analytical theory to investigate the glassy dynamics in dense assemblies of athermal particles evolving under the sole influence of self-propulsion. The simulations reveal that when the persistence time…
Community detection is a key tool for analyzing the structure of large networks. Standard methods, such as modularity optimization, focus on identifying densely connected groups but often overlook natural local separations in the graph. In…
Communities are clusters of nodes with a higher than average density of internal connections. Their detection is of great relevance to better understand the structure and hierarchies present in a network. Modularity has become a standard…
Community detection is a well established method for studying the meso scale structure of social networks. Applying a community detection algorithm results in a division of a network into communities that is often used to inspect and reason…
The community structure of a complex network can be determined by finding the partitioning of its nodes that maximizes modularity. Many of the proposed algorithms for doing this work by recursively bisecting the network. We show that this…
Contagion processes have been proven to fundamentally depend on the structural properties of the interaction networks conveying them. Many real networked systems are characterized by clustered substructures representing either collections…