default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Gabriel Young
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Nicholas W. Landry
, Jean-Gabriel Young, Nicole Eikmeier:
The simpliciality of higher-order networks. EPJ Data Sci. 13(1): 17 (2024)- [i25]Nicholas W. Landry, William Thompson, Laurent Hébert-Dufresne, Jean-Gabriel Young:
Complex contagions can outperform simple contagions for network reconstruction with dense networks or saturated dynamics. CoRR abs/2405.00129 (2024) - [i24]Simon Lizotte, Jean-Gabriel Young, Antoine Allard:
Symmetry-driven embedding of networks in hyperbolic space. CoRR abs/2406.10711 (2024) - 2023
- [j5]Joshua Garland, Keyan Ghazi-Zahedi, Jean-Gabriel Young, Laurent Hébert-Dufresne, Mirta Galesic:
Correction: Impact and dynamics of hate and counter speech online. EPJ Data Sci. 12(1): 27 (2023) - [i23]Alice Patania, Antoine Allard, Jean-Gabriel Young:
Exact and rapid linear clustering of networks with dynamic programming. CoRR abs/2301.10403 (2023) - 2022
- [j4]Joshua Garland, Keyan Ghazi-Zahedi, Jean-Gabriel Young, Laurent Hébert-Dufresne, Mirta Galesic:
Impact and dynamics of hate and counter speech online. EPJ Data Sci. 11(1): 3 (2022) - [c4]Kirtus G. Leyba, Joshua J. Daymude, Jean-Gabriel Young, M. E. J. Newman, Jennifer Rexford, Stephanie Forrest:
Cutting Through the Noise to Infer Autonomous System Topology. INFOCOM 2022: 1609-1618 - [c3]Melanie Warrick, Samuel F. Rosenblatt, Jean-Gabriel Young, Amanda Casari, Laurent Hébert-Dufresne, James P. Bagrow:
The OCEAN mailing list data set: Network analysis spanning mailing lists and code repositories. MSR 2022: 338-342 - [i22]Kirtus G. Leyba, Joshua J. Daymude, Jean-Gabriel Young, M. E. J. Newman, Jennifer Rexford, Stephanie Forrest:
Cutting Through the Noise to Infer Autonomous System Topology. CoRR abs/2201.07328 (2022) - [i21]Melanie Warrick, Samuel F. Rosenblatt, Jean-Gabriel Young, Amanda Casari, Laurent Hébert-Dufresne, James P. Bagrow:
The OCEAN mailing list data set: Network analysis spanning mailing lists and code repositories. CoRR abs/2204.00603 (2022) - [i20]Laurent Hébert-Dufresne, Jean-Gabriel Young, Alexander Daniels, Antoine Allard:
Network Onion Divergence: Network representation and comparison using nested configuration models with fixed connectivity, correlation and centrality patterns. CoRR abs/2204.08444 (2022) - [i19]Simon Lizotte, Jean-Gabriel Young, Antoine Allard:
Hypergraph reconstruction from noisy pairwise observations. CoRR abs/2208.06503 (2022) - [i18]Alec Kirkley, Alexis Rojas, Martin Rosvall, Jean-Gabriel Young:
Compressing network populations with modal networks reveals structural diversity. CoRR abs/2209.13827 (2022) - 2021
- [j3]Jean-Gabriel Young, George T. Cantwell, M. E. J. Newman:
Bayesian inference of network structure from unreliable data. J. Complex Networks 8(6) (2021) - [j2]Amanda Casari, Katie McLaughlin, Milo Z. Trujillo, Jean-Gabriel Young, James P. Bagrow, Laurent Hébert-Dufresne:
Open source ecosystems need equitable credit across contributions. Nat. Comput. Sci. 1(1): 2 (2021) - [c2]Jean-Gabriel Young, Amanda Casari, Katie McLaughlin, Milo Z. Trujillo, Laurent Hébert-Dufresne, James P. Bagrow:
Which contributions count? Analysis of attribution in open source. MSR 2021: 242-253 - [i17]Jean-Gabriel Young, Amanda Casari, Katie McLaughlin, Milo Z. Trujillo, Laurent Hébert-Dufresne, James P. Bagrow:
Which contributions count? Analysis of attribution in open source. CoRR abs/2103.11007 (2021) - [i16]Jean-Gabriel Young, Alec Kirkley, M. E. J. Newman:
Clustering of heterogeneous populations of networks. CoRR abs/2107.07489 (2021) - [i15]Caterina De Bacco, Martina Contisciani, Jonathan Cardoso-Silva, Hadiseh Safdari, Diego Baptista, Tracy M. Sweet, Jean-Gabriel Young, Jeremy M. Koster, Cody T. Ross, Richard McElreath, Daniel Redhead, Eleanor A. Power:
Latent Network Models to Account for Noisy, Multiply-Reported Social Network Data. CoRR abs/2112.11396 (2021) - 2020
- [c1]Joshua Garland, Keyan Ghazi-Zahedi, Jean-Gabriel Young, Laurent Hébert-Dufresne, Mirta Galesic:
Countering hate on social media: Large scale classification of hate and counter speech. WOAH 2020: 102-112 - [i14]Ryan J. Gallagher, Jean-Gabriel Young, Brooke Foucault Welles:
A Clarified Typology of Core-Periphery Structure in Networks. CoRR abs/2005.10191 (2020) - [i13]Federico Battiston, Giulia Cencetti, Iacopo Iacopini, Vito Latora, Maxime Lucas, Alice Patania, Jean-Gabriel Young, Giovanni Petri:
Networks beyond pairwise interactions: structure and dynamics. CoRR abs/2006.01764 (2020) - [i12]Joshua Garland, Keyan Ghazi-Zahedi, Jean-Gabriel Young, Laurent Hébert-Dufresne, Mirta Galesic:
Countering hate on social media: Large scale classification of hate and counter speech. CoRR abs/2006.01974 (2020) - [i11]Jean-Gabriel Young, George T. Cantwell, M. E. J. Newman:
Robust Bayesian inference of network structure from unreliable data. CoRR abs/2008.03334 (2020) - [i10]Jean-Gabriel Young, Giovanni Petri, Tiago P. Peixoto:
Hypergraph reconstruction from network data. CoRR abs/2008.04948 (2020) - [i9]Joshua Garland, Keyan Ghazi-Zahedi, Jean-Gabriel Young, Laurent Hébert-Dufresne, Mirta Galesic:
Impact and dynamics of hate and counter speech online. CoRR abs/2009.08392 (2020)
2010 – 2019
- 2019
- [j1]Guillaume St-Onge, Jean-Gabriel Young, Laurent Hébert-Dufresne, Louis J. Dubé:
Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm. Comput. Phys. Commun. 240: 30-37 (2019) - [i8]M. E. J. Newman, George T. Cantwell, Jean-Gabriel Young:
Improved mutual information measure for classification and community detection. CoRR abs/1907.12581 (2019) - [i7]George T. Cantwell, Guillaume St-Onge, Jean-Gabriel Young:
Recovering the past states of growing trees. CoRR abs/1910.04788 (2019) - 2018
- [i6]Guillaume St-Onge, Jean-Gabriel Young, Laurent Hébert-Dufresne, Louis J. Dubé:
Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm. CoRR abs/1808.05859 (2018) - 2017
- [i5]Jean-Gabriel Young, Patrick Desrosiers, Laurent Hébert-Dufresne, Edward Laurence, Louis J. Dubé:
Finite size analysis of the detectability limit of the stochastic block model. CoRR abs/1701.00062 (2017) - 2016
- [i4]Jean-Gabriel Young, Laurent Hébert-Dufresne, Antoine Allard, Louis J. Dubé:
A preferential attachment approach to community structure and the structure of communities. CoRR abs/1603.05566 (2016) - 2013
- [i3]Laurent Hébert-Dufresne, Antoine Allard, Jean-Gabriel Young, Louis J. Dubé:
Random networks with arbitrary k-core structure. CoRR abs/1308.6537 (2013) - [i2]Laurent Hébert-Dufresne, Edward Laurence, Antoine Allard, Jean-Gabriel Young, Louis J. Dubé:
Complex networks are an emerging property of hierarchical preferential attachment. CoRR abs/1312.0171 (2013) - 2012
- [i1]Jean-Gabriel Young, Antoine Allard, Laurent Hébert-Dufresne, Louis J. Dubé:
Unveiling Hidden Communities Through Cascading Detection on Network Structures. CoRR abs/1211.1364 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
