Pour savoir comment effectuer et gérer un dépôt de document, consultez le « Guide abrégé – Dépôt de documents » sur le site Web de la Bibliothèque. Pour toute question, écrivez à corpus@ulaval.ca.
 

Personne :
Dubé, Louis J.

En cours de chargement...
Photo de profil

Adresse électronique

Date de naissance

Projets de recherche

Structures organisationnelles

Fonction

Nom de famille

Dubé

Prénom

Louis J.

Affiliation

Université Laval. Département de physique, de génie physique et d'optique

ISNI

ORCID

Identifiant Canadiana

ncf11850600

person.page.name

Résultats de recherche

Voici les éléments 1 - 10 sur 19
  • PublicationAccès libre
    Percolation on random networks with arbitrary k-core structure
    (American Physical Society through the American Institute of Physics, 2013-12-30) Young, Jean-Gabriel; Hébert-Dufresne, Laurent; Allard, Antoine; Dubé, Louis J.
    The k-core decomposition of a network has thus far mainly served as a powerful tool for the empirical study of complex networks. We now propose its explicit integration in a theoretical model. We introduce a hard-core random network (HRN) model that generates maximally random networks with arbitrary degree distribution and arbitrary k-core structure. We then solve exactly the bond percolation problem on the HRN model and produce fast and precise analytical estimates for the corresponding real networks. Extensive comparison with real databases reveals that our approach performs better than existing models, while requiring less input information.
  • PublicationAccès libre
    Finite-size analysis of the detectability limit of the stochastic block model
    (American Physical Society, 2017-06-19) Young, Jean-Gabriel; Hébert-Dufresne, Laurent; Laurence, Edward; Dubé, Louis J.; Desrosiers, Patrick
    It has been shown in recent years that the stochastic block model is sometimes undetectable in the sparse limit, i.e., that no algorithm can identify a partition correlated with the partition used to generate an instance, if the instance is sparse enough and infinitely large. In this contribution, we treat the finite case explicitly, using arguments drawn from information theory and statistics. We give a necessary condition for finite-size detectability in the general SBM. We then distinguish the concept of average detectability from the concept of instance-by-instance detectability and give explicit formulas for both definitions. Using these formulas, we prove that there exist large equivalence classes of parameters, where widely different network ensembles are equally detectable with respect to our definitions of detectability. In an extensive case study, we investigate the finite-size detectability of a simplified variant of the SBM, which encompasses a number of important models as special cases. These models include the symmetric SBM, the planted coloring model, and more exotic SBMs not previously studied. We conclude with three appendices, where we study the interplay of noise and detectability, establish a connection between our information-theoretic approach and random matrix theory, and provide proofs of some of the more technical results.
  • PublicationAccès libre
    Geometric evolution of complex networks with degree correlations
    (American Physical Society, 2018-03-19) Allard, Antoine; St-Onge, Guillaume; Laurence, Edward; Dubé, Louis J.; Murphy, Charles
    We present a general class of geometric network growth mechanisms by homogeneous attachment in which the links created at a given time t are distributed homogeneously between a new node and the existing nodes selected uniformly. This is achieved by creating links between nodes uniformly distributed in a homogeneous metric space according to a Fermi-Dirac connection probability with inverse temperature β and general time-dependent chemical potential μ(t). The chemical potential limits the spatial extent of newly created links. Using a hidden variable framework, we obtain an analytical expression for the degree sequence and show that μ(t) can be fixed to yield any given degree distributions, including a scale-free degree distribution. Additionally, we find that depending on the order in which nodes appear in the network—its history—the degree-degree correlations can be tuned to be assortative or disassortative. The effect of the geometry on the structure is investigated through the average clustering coefficient ⟨c⟩. In the thermodynamic limit, we identify a phase transition between a random regime where ⟨c⟩→ 0 when β<βc and a geometric regime where ⟨c⟩ > 0 when β>βc.
  • PublicationAccès libre
    Time evolution of epidemic disease on finite and infinite networks
    (American Physical Society through the American Institute of Physics, 2009-02-02) Noël, Pierre-André; Davoud, Bahman; Dubé, Louis J.; Brunham, Robert C.; Pourbohloul, Babak
    Mathematical models of infectious diseases, which are in principle analytically tractable, use two general approaches. The first approach, generally known as compartmental modeling, addresses the time evolution of disease propagation at the expense of simplifying the pattern of transmission. The second approach uses network theory to incorporate detailed information pertaining to the underlying contact structure among individuals while disregarding the progression of time during outbreaks. So far, the only alternative that enables the integration of both aspects of disease propagation simultaneously while preserving the variety of outcomes has been to abandon the analytical approach and rely on computer simulations. We offer an analytical framework, that incorporates both the complexity of contact network structure and the time progression of disease spread. Furthermore, we demonstrate that this framework is equally effective on finite- and “infinite”-size networks. This formalism can be equally applied to similar percolation phenomena on networks in other areas of science and technology.
  • PublicationAccès libre
    Global efficiency of local immunization on complex networks
    (Nature Publishing Group, 2013-07-10) Young, Jean-Gabriel; Hébert-Dufresne, Laurent; Allard, Antoine; Dubé, Louis J.
    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 viruses circulating on the Internet. With the advent of large databases and efficient analysis algorithms, these processes can be better predicted and controlled. In this study, we use different characteristics of network organization to identify the influential spreaders in 17 empirical networks of diverse nature using 2 epidemic models. We find that a judicious choice of local measures, based either on the network's connectivity at a microscopic scale or on its community structure at a mesoscopic scale, compares favorably to global measures, such as betweenness centrality, in terms of efficiency, practicality and robustness. We also develop an analytical framework that highlights a transition in the characteristic scale of different epidemic regimes. This allows to decide which local measure should govern immunization in a given scenario.
  • PublicationAccès libre
    Phase transition of the susceptible-infected-susceptible dynamics on time-varying configuration model networks
    (American Physical Society, 2018-02-12) Young, Jean-Gabriel; St-Onge, Guillaume; Laurence, Edward; Dubé, Louis J.; Murphy, Charles
    We present a degree-based theoretical framework to study the susceptible-infected-susceptible (SIS) dynamics on time-varying (rewired) configuration model networks. Using this framework on a given degree distribution, we provide a detailed analysis of the stationary state using the rewiring rate to explore the whole range of the time variation of the structure relative to that of the SIS process. This analysis is suitable for the characterization of the phase transition and leads to three main contributions: (1) We obtain a self-consistent expression for the absorbing-state threshold, able to capture both collective and hub activation. (2) We recover the predictions of a number of existing approaches as limiting cases of our analysis, providing thereby a unifying point of view for the SIS dynamics on random networks. (3) We obtain bounds for the critical exponents of a number of quantities in the stationary state. This allows us to reinterpret the concept of hub-dominated phase transition. Within our framework, it appears as a heterogeneous critical phenomenon: observables for different degree classes have a different scaling with the infection rate. This phenomenon is followed by the successive activation of the degree classes beyond the epidemic threshold.
  • PublicationAccès libre
    Constrained growth of complex scale-independent systems
    (American Physical Society, 2016-03-03) Young, Jean-Gabriel; Hébert-Dufresne, Laurent; Allard, Antoine; Dubé, Louis J.
    Scale independence is a ubiquitous feature of complex systems that implies a highly skewed distribution of resources with no characteristic scale. Research has long focused on why systems as varied as protein networks, evolution, and stock actions all feature scale independence. Assuming that they simply do, we focus here on describing how this behavior emerges, in contrast to more idealized models usually considered. We arrive at the conjecture that a minimal model to explain the growth toward scale independence involves only two coupled dynamical features: the first is the well-known preferential attachment principle, and the second is a general form of delayed temporal scaling. While the first is sufficient, the second is present in all studied data and appears to maximize the speed of convergence to true scale independence. The delay in this temporal scaling acts as a coupling between population growth and individual activity. Together, these two dynamical properties appear to pave a precise evolution path, such that even an instantaneous snapshot of a distribution is enough to reconstruct the past of the system and predict its future. We validate our approach and confirm its usefulness in diverse spheres of human activities, ranging from scientific and artistic productivity to sexual relations and online traffic.
  • PublicationRestreint
    Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm
    (Elsevier, 2019-02-19) Young, Jean-Gabriel; Hébert-Dufresne, Laurent; St-Onge, Guillaume; Dubé, Louis J.
    Efficient stochastic simulation algorithms are of paramount importance to the study of spreading phenomena on complex networks. Using insights and analytical results from network science, we discuss how the structure of contacts affects the efficiency of current algorithms. We show that algorithms believed to require O(log N) or even O(1) operations per update – where N is the number of nodes – display instead a polynomial scaling for networks that are either dense or sparse and heterogeneous. This significantly affects the required computation time for simulations on large networks. To circumvent the issue, we propose a node-based method combined with a composition and rejection algorithm, a sampling scheme that has an average-case complexity of O[log(log N)] per update for general networks. This systematic approach is first set-up for Markovian dynamics, but can also be adapted to a number of non-Markovian processes and can enhance considerably the study of a wide range of dynamics on networks.
  • PublicationAccès libre
    Propagation dynamics on networks featuring complex topologies
    (American Physical Society through the American Institute of Physics, 2010-09-27) Hébert-Dufresne, Laurent; Allard, Antoine; Noël, Pierre-André; Dubé, Louis J.; Marceau, Vincent.
    Analytical description of propagation phenomena on random networks has flourished in recent years, yet more complex systems have mainly been studied through numerical means. In this paper, a mean-field description is used to coherently couple the dynamics of the network elements (such as nodes, vertices, individuals, etc.) on the one hand and their recurrent topological patterns (such as subgraphs, groups, etc.) on the other hand. In a susceptible-infectious-susceptible (SIS) model of epidemic spread on social networks with community structure, this approach yields a set of ordinary differential equations for the time evolution of the system, as well as analytical solutions for the epidemic threshold and equilibria. The results obtained are in good agreement with numerical simulations and reproduce the behavior of random networks in the appropriate limits which highlights the influence of topology on the processes. Finally, it is demonstrated that our model predicts higher epidemic thresholds for clustered structures than for equivalent random topologies in the case of networks with zero degree correlation.
  • PublicationAccès libre
    Structural preferential attachment : stochastic process for the growth of scale-free, modular, and self-similar systems
    (American Physical Society, 2012-02-13) Hébert-Dufresne, Laurent; Allard, Antoine; Noël, Pierre-André; Dubé, Louis J.; Marceau, Vincent.
    Many complex systems have been shown to share universal properties of organization, such as scale independence, modularity, and self-similarity. We borrow tools from statistical physics in order to study structural preferential attachment (SPA), a recently proposed growth principle for the emergence of the aforementioned properties. We study the corresponding stochastic process in terms of its time evolution, its asymptotic behavior, and the scaling properties of its statistical steady state. Moreover, approximations are introduced to facilitate the modeling of real systems, mainly complex networks, using SPA. Finally, we investigate a particular behavior observed in the stochastic process, the peloton dynamics, and show how it predicts some features of real growing systems using prose samples as an example.