• Publications
  • Influence
Uncovering the overlapping community structure of complex networks in nature and society
After defining a set of new characteristic quantities for the statistics of communities, this work applies an efficient technique for exploring overlapping communities on a large scale and finds that overlaps are significant, and the distributions introduced reveal universal features of networks.
Simulating dynamical features of escape panic
A model of pedestrian behaviour is used to investigate the mechanisms of panic and jamming by uncoordinated motion in crowds, and an optimal strategy for escape from a smoke-filled room is found, involving a mixture of individualistic behaviour and collective ‘herding’ instinct.
CFinder: locating cliques and overlapping modules in biological networks
It is shown that in gene (protein) association networks CFinder can be used to predict the function(s) of a single protein and to discover novel modules, and CFinder is also very efficient for locating the cliques of large sparse graphs.
Fractal Growth Phenomena
Foreword, B. Mandelbrot introduction fractal geometry fractal measures methods for determining fractal dimensions local growth models diffusion-limited growth growing self-affine surfaces
Quantifying social group evolution
The focus is on networks capturing the collaboration between scientists and the calls between mobile phone users, and it is found that large groups persist for longer if they are capable of dynamically altering their membership, suggesting that an ability to change the group composition results in better adaptability.
Simulation of pedestrian crowds in normal and evacuation situations
Starting with a short review of the available literature in the field of pedestrian and evacuation research, an overview is given over the observed collective phenomena in pedestrian crowds. This
Hierarchical group dynamics in pigeon flocks
The results suggest that hierarchical organization of group flight may be more efficient than an egalitarian one, at least for those flock sizes that permit regular pairwise interactions among group members, during which leader–follower relationships are consistently manifested.
Clique percolation in random networks.
Why clique percolation is a novel and efficient approach to the identification of overlapping communities in large real networks is discussed.
Spectra of "real-world" graphs: beyond the semicircle law.
Methods to determine the eigenvalues of networks comparable in size to real systems are developed, obtaining several surprising results on the spectra of adjacency matrices corresponding to models of real-world graphs.