arXiv subjects

Louis J. Dubé

Publications and source records attributed to Louis J. Dubé.

At least 19 recordsLinked to original sources

arXiv2021

Social confinement and mesoscopic localization of epidemics on networks

Recommendations around epidemics tend to focus on individual behaviors, with much less efforts attempting to guide event cancellations and other collective behaviors since most models lack the higher-order structure necessary to describe large gatherings. Through a higher-order description of contagions on networks, we model the impact of a blanket cancellation of events larger than a critical size and find that epidemics can suddenly collapse when interventions operate over groups of individuals rather than at the level of individuals. We relate this phenomenon to the onset of mesoscopic localization, where contagions concentrate around dominant groups.

physics.soc-ph↗

arXiv2020

Master equation analysis of mesoscopic localization in contagion dynamics on higher-order networks

Simple models of infectious diseases tend to assume random mixing of individuals, but real interactions are not random pairwise encounters: they occur within various types of gatherings such as workplaces, households, schools, and concerts, best described by a higher-order network structure. We model contagions on higher-order networks using group-based approximate master equations, in which we track all states and interactions within a group of nodes and assume a mean-field coupling between them. Using the Susceptible-Infected-Susceptible dynamics, our approach reveals the existence of a mesoscopic localization regime, where a disease can concentrate and self-sustain only around large groups in the network overall organization. In this regime, the phase transition is smeared, characterized by an inhomogeneous activation of the groups. At the mesoscopic level, we observe that the distribution of infected nodes within groups of a same size can be very dispersed, even bimodal. When considering heterogeneous networks, both at the level of nodes and groups, we characterize analytically the region associated with mesoscopic localization in the structural parameter space. We put in perspective this phenomenon with eigenvector localization and discuss how a focus on higher-order structures is needed to discern the more subtle localization at the mesoscopic level. Finally, we discuss how mesoscopic localization affects the response to structural interventions and how this framework could provide important insights for a broad range of dynamics.

physics.soc-ph↗

arXiv2020

Threefold way to the dimension reduction of dynamics on networks: an application to synchronization

Several complex systems can be modeled as large networks in which the state of the nodes continuously evolves through interactions among neighboring nodes, forming a high-dimensional nonlinear dynamical system. One of the main challenges of Network Science consists in predicting the impact of network topology and dynamics on the evolution of the states and, especially, on the emergence of collective phenomena, such as synchronization. We address this problem by proposing a Dynamics Approximate Reduction Technique (DART) that maps high-dimensional (complete) dynamics unto low-dimensional (reduced) dynamics while preserving the most salient features, both topological and dynamical, of the original system. DART generalizes recent approaches for dimension reduction by allowing the treatment of complex-valued dynamical variables, heterogeneities in the intrinsic properties of the nodes as well as modular networks with strongly interacting communities. Most importantly, we identify three major reduction procedures whose relative accuracy depends on whether the evolution of the states is mainly determined by the intrinsic dynamics, the degree sequence, or the adjacency matrix. We use phase synchronization of oscillator networks as a benchmark for our threefold method. We successfully predict the synchronization curves for three phase dynamics (Winfree, Kuramoto, theta) on the stochastic block model. Moreover, we obtain the bifurcations of the Kuramoto-Sakaguchi model on the mean stochastic block model with asymmetric blocks and we show numerically the existence of periphery chimera state on the two-star graph. This allows us to highlight the critical role played by the asymmetry of community sizes on the existence of chimera states. Finally, we systematically recover well-known analytical results on explosive synchronization by using DART for the Kuramoto-Sakaguchi model on the star graph.

nlin.AO↗

arXiv2019

Delayed-rate equations model for femtosecond laser-induced breakdown in dielectrics

Experimental and theoretical studies of laser-induced breakdown in dielectrics provide conflicting conclusions about the possibility to trigger ionization avalanche on the sub-picosecond time scale and the relative importance of carrier-impact ionization over field ionization. On the one hand, current models based on single ionization-rate equations do not account for the gradual heating of the charge carriers which, for short laser pulses, might not be sufficient to start an avalanche. On the other hand, models based on multiple rate equations that track the carriers kinetics rely on several free parameters, which limits the physical insight that we can gain from them. In this paper, we develop a model that overcomes these issues by tracking both the plasma density and carriers' mean kinetic energy as a function of time, forming a set of delayed rate equations that we use to match the laser-induced damage threshold of several dielectric materials. In particular, we show that this simplified model reproduces the predictions from the multiple rate equations, with a limited number of free parameters determined unambiguously by fitting experimental data. A side benefit of the delayed rate equations model is its computational efficiency, opening the possibility for large-scale, three-dimensional modelling of laser-induced breakdown of transparent media.

physics.comp-ph↗

arXiv2019

Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm

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 $\mathcal{O}(\log N)$ or even $\mathcal{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 $\mathcal{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.

physics.soc-ph↗

arXiv2018

Universality of the stochastic block model

Mesoscopic pattern extraction (MPE) is the problem of finding a partition of the nodes of a complex network that maximizes some objective function. Many well-known network inference problems fall in this category, including, for instance, community detection, core-periphery identification, and imperfect graph coloring. In this paper, we show that the most popular algorithms designed to solve MPE problems can in fact be understood as special cases of the maximum likelihood formulation of the stochastic block model (SBM), or one of its direct generalizations. These equivalence relations show that the SBM is nearly universal with respect to MPE problems.

physics.soc-ph↗

arXiv2018

Femtosecond Self-Reconfiguration of Laser-Induced Plasma Patterns in Dielectrics

Laser-induced modification of transparent solids by intense femtosecond laser pulses allows fast integration of nanophotonic and nanofluidic devices with controlled optical properties. So far, the local and dynamic nature of the interactions between plasma and light needed to correctly explain nanograting fabrication on dielectric surfaces has been missing in the theoretical models. With our numerical approach, we show that a self-consistent dynamic treatment of the plasma formation and its interaction with light triggers an ultrafast reconfiguration of the periodic plasma patterns on a field-cycle time scale. Within this framework, a simple stability analysis of the local interactions explains how the laser-induced plasma patterns change their orientation with respect to the incident light polarization, when a certain energy density threshold is reached. Moreover, the reconfigured sub-wavelength plasma structures grow into the bulk of the sample and agree with the experimental findings of self-organized volume nanogratings. Mode coupling of the incident and transversally scattered light with the periodic plasma structures is sufficient to initiate the growth and the self-organization of the characteristic pattern with a periodicity of a half-wavelength in the medium.

physics.optics↗

arXiv2018

Phase transition of the susceptible-infected-susceptible dynamics on time-varying configuration model networks

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, we provide a detailed analysis of the stationary state that covers, for a given structure, every dynamic regimes easily tuned by the rewiring rate. This analysis is suitable for the characterization of the phase transition and leads to three main contributions. (i) We obtain a self-consistent expression for the absorbing-state threshold, able to capture both collective and hub activation. (ii) 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. (iii) We 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 leads to the successive activation of the degree classes beyond the epidemic threshold.

physics.soc-ph↗

arXiv2018

Exact analytical solution of irreversible binary dynamics on networks

In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, built around a breath-first search procedure. This algorithm solves the equations as efficiently as possible, in exponential time.

physics.soc-ph↗

arXiv2017

Geometric evolution of complex networks

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 exising 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 $\textit{history}$---the degree-degree correlation can be tuned to be assortative or disassortative. The effect of the geometry on the structure is investigated through the average clustering coefficient $\langle c \rangle$. In the thermodynamic limit, we identify a phase transition between a random regime where $\langle c \rangle \rightarrow 0$ when $β< β_\mathrm{c}$ and a geometric regime where $\langle c \rangle > 0$ when $β> β_\mathrm{c}$.

physics.soc-ph↗

arXiv2017

Finite size analysis of the detectability limit of the stochastic block model

It has been shown in recent years that the stochastic block model (SBM) 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.

physics.soc-ph↗

arXiv2017

Susceptible-infected-susceptible dynamics on the rewired configuration model

We investigate the susceptible-infected-susceptible dynamics on configuration model networks. In an effort for the unification of current approaches, we consider a network whose edges are constantly being rearranged, with a tunable rewiring rate $ω$. We perform a detailed stationary state analysis of the process, leading to a closed form expression of the absorbing-state threshold for an arbitrary rewiring rate. In both extreme regimes (annealed and quasi-static), we recover and further improve the results of current approaches, as well as providing a natural interpolation for the intermediate regimes. For any finite $ω$, our analysis predicts a vanishing threshold when the maximal degree $k_\mathrm{max} \to \infty$, a generalization of the result obtained with quenched mean-field theory for static networks.

physics.soc-ph↗

arXiv2016

Growing networks of overlapping communities with internal structure

We introduce an intuitive model that describes both the emergence of community structure and the evolution of the internal structure of communities in growing social networks. The model comprises two complementary mechanisms: One mechanism accounts for the evolution of the internal link structure of a single community, and the second mechanism coordinates the growth of multiple overlapping communities. The first mechanism is based on the assumption that each node establishes links with its neighbors and introduces new nodes to the community at different rates. We demonstrate that this simple mechanism gives rise to an effective maximal degree within communities. This observation is related to the anthropological theory known as Dunbar's number, i.e., the empirical observation of a maximal number of ties which an average individual can sustain within its social groups. The second mechanism is based on a recently proposed generalization of preferential attachment to community structure, appropriately called structural preferential attachment (SPA). The combination of these two mechanisms into a single model (SPA+) allows us to reproduce a number of the global statistics of real networks: The distribution of community sizes, of node memberships and of degrees. The SPA+ model also predicts (a) three qualitative regimes for the degree distribution within overlapping communities and (b) strong correlations between the number of communities to which a node belongs and its number of connections within each community. We present empirical evidence that support our findings in real complex networks.

physics.soc-ph↗

arXiv2016

On the constrained growth of complex scale-independent systems

Scale independence is a ubiquitous feature of complex systems which 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 behaviour emerges, in contrast to more idealized models usually considered. We arrive at the conjecture that a minimal model to explain the growth towards 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 on diverse spheres of human activities ranging from scientific and artistic productivity, to sexual relations and online traffic.

physics.soc-ph↗

arXiv2015

Complex networks as an emerging property of hierarchical preferential attachment

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of complex systems can be modeled as an organization of many embedded levels (potentially infinite in number), all of them following the same universal growth principle known as preferential attachment. We give examples of such hierarchy in real systems, for instance in the pyramid of production entities of the film industry. More importantly, we show how real complex networks can be interpreted as a projection of our model, from which their scale independence, their clustering, their hierarchy, their fractality and their navigability naturally emerge. Our results suggest that complex networks, viewed as growing systems, can be quite simple, and that the apparent complexity of their structure is largely a reflection of their unobserved hierarchical nature.

physics.soc-ph↗

arXiv2015

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

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 of complex networks. When applied to sizable networks, we argue that most detection algorithms correctly identify prominent communities, but fail to do so across multiple scales. As a result, a significant fraction of the network is left uncharted. We show that this problem stems from larger or denser communities overshadowing smaller or sparser ones, and that this effect accounts for most of the undetected communities and unassigned links. We propose a generic cascading approach to community detection that circumvents the problem. Using real and artificial network datasets with three widely used community detection algorithms, we show how a simple cascading procedure allows for the detection of the missing communities. This work highlights a new detection limit of community structure, and we hope that our approach can inspire better community detection algorithms.

physics.soc-ph↗

arXiv2015

Lorenz-Mie theory for 2D scattering and resonance calculations

This PhD tutorial is concerned with a description of the two-dimensional generalized Lorenz-Mie theory (2D-GLMT), a well-established numerical method used to compute the interaction of light with arrays of cylindrical scatterers. This theory is based on the method of separation of variables and the application of an addition theorem for cylindrical functions. The purpose of this tutorial is to assemble the practical tools necessary to implement the 2D-GLMT method for the computation of scattering by passive scatterers or of resonances in optically active media. The first part contains a derivation of the vector and scalar Helmholtz equations for 2D geometries, starting from Maxwell's equations. Optically active media are included in 2D-GLMT using a recent stationary formulation of the Maxwell-Bloch equations called steady-state ab initio laser theory (SALT), which introduces new classes of solutions useful for resonance computations. Following these preliminaries, a detailed description of 2D-GLMT is presented. The emphasis is placed on the derivation of beam-shape coefficients for scattering computations, as well as the computation of resonant modes using a combination of 2D-GLMT and SALT. The final section contains several numerical examples illustrating the full potential of 2D-GLMT for scattering and resonance computations. These examples, drawn from the literature, include the design of integrated polarization filters and the computation of optical modes of photonic crystal cavities and random lasers.

physics.optics↗

arXiv2015

General and exact approach to percolation on random graphs

We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative equations that solve the exact distribution of the size and composition of components in finite size quenched or random multitype graphs. (ii) We define a very general random graph ensemble that encompasses most of the models published to this day, and also that permits to model structural properties not yet included in a theoretical framework. Site and bond percolation on this ensemble is solved exactly in the infinite size limit using probability generating functions [i.e., the percolation threshold, the size and the composition of the giant (extensive) and small components]. Several examples and applications are also provided. (iii) Our approach can be adapted to model interdependent graphs---whose most striking feature is the emergence of an extensive component via a discontinuous phase transition---in an equally general fashion. We show how a graph can successively undergo a continuous then a discontinuous phase transition, and preliminary results suggest that clustering increases the amplitude of the discontinuity at the transition.

cond-mat.stat-mech↗