Jean-Gabriel Young

Dr. Jean-Gabriel Young

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2020 in Physics Reports
Verified
Journal Article
Open access
FBFederico Battiston
Federico Battiston
GCGiulia Cencetti
Giulia Cencetti
IIIacopo Iacopini
Iacopo Iacopini
VLVito Latora
Vito Latora
MLMaxime Lucas
Maxime Lucas
Giovanni PetriGiovanni Petri
Giovanni Petri

15 June 2021 in Communications Physics
Verified
Journal Article
Open access
PDF file
JYJean-Gabriel Young
Jean-Gabriel Young
Giovanni PetriGiovanni Petri
Giovanni Petri
TPTiago P. Peixoto
Tiago P. Peixoto
Networks can describe the structure of a wide variety of complex systems by specifying which pairs of entities in the system are connected. While such pairwise representations are flexible, they are not necessarily appropriate when the fundamental interactions involve more than two entities at the same time. Pairwise representations nonetheless remain ubiquitous, because higher-order interactions are often not recorded explicitly in network data. Here, we introduce a Bayesian approach to reconstruct latent higher-order interactions from ordinary pairwise network data. Our method is based on the principle of parsimony and only includes higher-order structures when there is sufficient statistical evidence for them. We demonstrate its applicability to a wide range of datasets, both synthetic and empirical.

10 July 2013 in Scientific Reports
Verified
Journal Article
Open access
PDF file
LHLaurent Hébert-Dufresne
Laurent Hébert-Dufresne
AAAntoine Allard
Antoine Allard
JYJean-Gabriel Young
Jean-Gabriel Young
LDLouis J. Dubé
Louis J. Dubé
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.

19 March 2021 in Science Advances
Verified
Journal Article
Open access
PDF file
RGRyan J. Gallagher
Ryan J. Gallagher
JYJean-Gabriel Young
Jean-Gabriel Young
BWBrooke Foucault Welles
Brooke Foucault Welles
Core-periphery structure, the arrangement of a network into a dense core and sparse periphery, is a versatile descriptor of various social, biological, and technological networks. In practice, different core-periphery algorithms are often applied interchangeably despite the fact that they can yield inconsistent descriptions of core-periphery structure. For example, two of the most widely used algorithms, the k-cores decomposition and the classic two-block model of Borgatti and Everett, extract fundamentally different structures: The latter partitions a network into a binary hub-and-spoke layout, while the former divides it into a layered hierarchy. We introduce a core-periphery typology to clarify these differences, along with Bayesian stochastic block modeling techniques to classify networks in accordance with this typology. Empirically, we find a rich diversity of core-periphery structure among networks. Through a detailed case study, we demonstrate the importance of acknowledging this diversity and situating networks within the core-periphery typology when conducting domain-specific analyses.

22 September 2017 in Physical Review E
Verified
Journal Article
Closed access
PDF file
JYJean-Gabriel Young
Jean-Gabriel Young
GPGiovanni Petri
Giovanni Petri
Francesco VaccarinoFrancesco Vaccarino
Francesco Vaccarino
APAlice Patania
Alice Patania
Simplicial complexes are now a popular alternative to networks when it comes to describing the structure of complex systems, primarily because they encode multinode interactions explicitly. With this new description comes the need for principled null models that allow for easy comparison with empirical data. We propose a natural candidate, the simplicial configuration model. The core of our contribution is an efficient and uniform Markov chain Monte Carlo sampler for this model. We demonstrate its usefulness in a short case study by investigating the topology of three real systems and their randomized counterparts (using their Betti numbers). For two out of three systems, the model allows us to reject the hypothesis that there is no organization beyond the local scale.

1 January 2020
Verified
Conference Paper
Open access
PDF file
JGJoshua Garland
Joshua Garland
KGKeyan Ghazi-Zahedi
Keyan Ghazi-Zahedi
JYJean-Gabriel Young
Jean-Gabriel Young
LHLaurent Hébert-Dufresne
Laurent Hébert-Dufresne
MGMirta Galesic
Mirta Galesic
Joshua Garland, Keyan Ghazi-Zahedi, Jean-Gabriel Young, Laurent Hébert-Dufresne, Mirta Galesic. Proceedings of the Fourth Workshop on Online Abuse and Harms. 2020.