61 citations · 72 across the 4 of their papers we have counts for
4 papers
Compressing bipartite graphs with a dual reordering scheme
Maximilien Danisch, Ioannis Panagiotas, Lionel Tabourier
In order to manage massive graphs in practice, it is often necessary to resort to graph compression, which aims at reducing the memory used when storing and processing the graph. E…
Clique percolation method: memory efficient almost exact communities
Alexis Baudin, Maximilien Danisch, Sergey Kirgizov +2
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 las…
Calculation of the Voronoi boundary for lens-shaped particles and spherocylinders
Louis Portal, Maximilien Danisch, Adrian Baule +2
We have recently developed a mean-field theory to estimate the packing fraction of non-spherical particles [A. Baule et al., Nature Commun. (2013)]. The central quantity in this fr…
Model of random packings of different size balls
Maximilien Danisch, Yuliang Jin, Hernan A. Makse
We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between…