activity
20002020
most citedAdaptive networks: coevolution of disease and topology

215 citations · 1.2k across the 37 of their papers we have counts for

collaborators
Showing 2012Show all

6 papers · 1 filter

physics.soc-ph2012

On the constrained growth of complex critical systems

Laurent Hébert-Dufresne, Antoine Allard, Louis J. Dubé

Critical, or scale independent, systems are so ubiquitous, that gaining theoretical insights on their nature and properties has many direct repercussions in social and natural scie…

physics.soc-ph2012★ 6 cited

A shadowing problem in the detection of overlapping communities: lifting the resolution limit through a cascading procedure

Jean-Gabriel Young, Antoine Allard, Laurent Hébert-Dufresne +1

Community detection is the process of assigning nodes and links in significant communities (e.g. clusters, function modules) and its development has led to a better understanding o…

physics.soc-ph2012★ 111 cited

Global efficiency of local immunization on complex networks

Laurent Hébert-Dufresne, Antoine Allard, Jean-Gabriel Young +1

Epidemics occur in all shapes and forms: infections propagating in our sparse sexual networks, rumours and diseases spreading through our much denser social interactions, or viruse…

physics.optics2012★ 24 cited

Beam shaping using genetically optimized two-dimensional photonic crystals

Denis Gagnon, Joey Dumont, Louis J. Dubé

We propose the use of two-dimensional photonic crystals with engineered defects for the generation of an arbitrary-profile beam from a focused input beam. The cylindrical harmonics…

cond-mat.stat-mech2012★ 29 cited

Bond percolation on a class of correlated and clustered random graphs

Antoine Allard, Laurent Hébert-Dufresne, Pierre-André Noël +2

We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configurati…

cond-mat.stat-mech2012★ 8 cited

Exact solution of bond percolation on small arbitrary graphs

Antoine Allard, Laurent Hébert-Dufresne, Pierre-André Noël +2

We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate h…