default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge T. Cantwell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i14]Erik Hormann, Renaud Lambiotte, George T. Cantwell:
An approximation for return time distributions of random walks on sparse networks. CoRR abs/2405.20166 (2024)- 2023
- [i13]George T. Cantwell, Alec Kirkley, Filippo Radicchi:
Heterogeneous message passing for heterogeneous networks. CoRR abs/2305.02294 (2023) - 2022
- [i12]George T. Cantwell:
Approximate sampling and estimation of partition functions using neural networks. CoRR abs/2209.10423 (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]George T. Cantwell, Alec Kirkley, M. E. J. Newman:
The friendship paradox in real and model networks. J. Complex Networks 9(2) (2021) - [i11]George T. Cantwell, Cristopher Moore:
Belief propagation for permutations, rankings, and partial orders. CoRR abs/2110.00513 (2021) - 2020
- [i10]Jean-Gabriel Young, George T. Cantwell, M. E. J. Newman:
Robust Bayesian inference of network structure from unreliable data. CoRR abs/2008.03334 (2020) - [i9]Alec Kirkley, George T. Cantwell, M. E. J. Newman:
Message passing for probabilistic models on networks with loops. CoRR abs/2009.12246 (2020) - [i8]George T. Cantwell, Alec Kirkley, M. E. J. Newman:
The friendship paradox in real and model networks. CoRR abs/2012.03991 (2020)
2010 – 2019
- 2019
- [i7]George T. Cantwell, Yanchen Liu, Benjamin F. Maier, Alice C. Schwarze, Carlos A. Serván, Jordan Snyder, Guillaume St-Onge:
Thresholding normally distributed data creates complex networks. CoRR abs/1902.08278 (2019) - [i6]George T. Cantwell, M. E. J. Newman:
Message passing on networks with loops. CoRR abs/1907.08252 (2019) - [i5]M. E. J. Newman, George T. Cantwell, Jean-Gabriel Young:
Improved mutual information measure for classification and community detection. CoRR abs/1907.12581 (2019) - [i4]George T. Cantwell, Guillaume St-Onge, Jean-Gabriel Young:
Recovering the past states of growing trees. CoRR abs/1910.04788 (2019) - 2018
- [i3]Alec Kirkley, George T. Cantwell, M. E. J. Newman:
Balance in signed networks. CoRR abs/1809.05140 (2018) - [i2]George T. Cantwell, M. E. J. Newman:
Mixing patterns and individual differences in networks. CoRR abs/1810.01432 (2018) - 2017
- [j1]George T. Cantwell, Maximilian Riesenhuber, Jessica L. Roeder, F. Gregory Ashby:
Perceptual category learning and visual processing: An exercise in computational cognitive neuroscience. Neural Networks 89: 31-38 (2017) - [i1]Maria A. Riolo, George T. Cantwell, Gesine Reinert, Mark E. J. Newman:
Efficient method for estimating the number of communities in a network. CoRR abs/1706.02324 (2017)
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-06-25 20:59 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:
