default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark E. J. Newman
Person information
- affiliation: University of Michigan, Ann Arbor, MI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i58]Maximilian Jerdee, Alec Kirkley, M. E. J. Newman:
Mutual information and the encoding of contingency tables. CoRR abs/2405.05393 (2024)- 2023
- [j10]M. E. J. Newman:
Efficient Computation of Rankings from Pairwise Comparisons. J. Mach. Learn. Res. 24: 238:1-238:25 (2023) - [i57]Austin Polanco, M. E. J. Newman:
Hierarchical core-periphery structure in networks. CoRR abs/2301.03630 (2023) - [i56]Maximilian Jerdee, Alec Kirkley, M. E. J. Newman:
Normalized mutual information is a biased measure for classification and community detection. CoRR abs/2307.01282 (2023) - [i55]Maximilian Jerdee, M. E. J. Newman:
Luck, skill, and depth of competition in games and social hierarchies. CoRR abs/2312.04711 (2023) - 2022
- [c2]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 - [i54]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) - [i53]M. E. J. Newman:
Rankings from multimodal pairwise comparisons. CoRR abs/2206.13580 (2022) - [i52]M. E. J. Newman:
Fast computation of rankings from pairwise comparisons. CoRR abs/2207.00076 (2022) - [i51]Santo Fortunato, M. E. J. Newman:
20 years of network community detection. CoRR abs/2208.00111 (2022) - [i50]M. E. J. Newman:
Message passing methods on complex networks. CoRR abs/2211.05054 (2022) - 2021
- [j9]Jean-Gabriel Young, George T. Cantwell, M. E. J. Newman:
Bayesian inference of network structure from unreliable data. J. Complex Networks 8(6) (2021) - [j8]George T. Cantwell, Alec Kirkley, M. E. J. Newman:
The friendship paradox in real and model networks. J. Complex Networks 9(2) (2021) - [i49]Alec Kirkley, M. E. J. Newman:
Representative community divisions of networks. CoRR abs/2105.04612 (2021) - [i48]Jean-Gabriel Young, Alec Kirkley, M. E. J. Newman:
Clustering of heterogeneous populations of networks. CoRR abs/2107.07489 (2021) - 2020
- [i47]Jean-Gabriel Young, George T. Cantwell, M. E. J. Newman:
Robust Bayesian inference of network structure from unreliable data. CoRR abs/2008.03334 (2020) - [i46]Alec Kirkley, George T. Cantwell, M. E. J. Newman:
Message passing for probabilistic models on networks with loops. CoRR abs/2009.12246 (2020) - [i45]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
- [i44]M. E. J. Newman, Xiao Zhang, Raj Rao Nadakuditi:
Spectra of random networks with arbitrary degrees. CoRR abs/1901.02029 (2019) - [i43]M. E. J. Newman:
Spectra of networks containing short loops. CoRR abs/1902.04595 (2019) - [i42]Elizabeth E. Bruch, M. E. J. Newman:
Structure of online dating markets in US cities. CoRR abs/1904.01050 (2019) - [i41]George T. Cantwell, M. E. J. Newman:
Message passing on networks with loops. CoRR abs/1907.08252 (2019) - [i40]M. E. J. Newman, George T. Cantwell, Jean-Gabriel Young:
Improved mutual information measure for classification and community detection. CoRR abs/1907.12581 (2019) - [i39]Maria A. Riolo, M. E. J. Newman:
Consistency of community structure in complex networks. CoRR abs/1908.09867 (2019) - 2018
- [i38]M. E. J. Newman:
Network reconstruction and error estimation with noisy network data. CoRR abs/1803.02427 (2018) - [i37]Elizabeth E. Bruch, M. E. J. Newman:
Aspirational pursuit of mates in online dating markets. CoRR abs/1808.04840 (2018) - [i36]Alec Kirkley, George T. Cantwell, M. E. J. Newman:
Balance in signed networks. CoRR abs/1809.05140 (2018) - [i35]George T. Cantwell, M. E. J. Newman:
Mixing patterns and individual differences in networks. CoRR abs/1810.01432 (2018) - 2017
- [i34]M. E. J. Newman:
Measurement errors in network data. CoRR abs/1703.07376 (2017) - [i33]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) - 2016
- [i32]M. E. J. Newman, Gesine Reinert:
Estimating the number of communities in a network. CoRR abs/1605.02753 (2016) - [i31]M. E. J. Newman:
Community detection in networks: Modularity optimization and maximum likelihood are equivalent. CoRR abs/1606.02319 (2016) - [i30]Xiao Zhang, Cristopher Moore, M. E. J. Newman:
Random graph models for dynamic networks. CoRR abs/1607.07570 (2016) - 2015
- [i29]M. E. J. Newman, Tiago P. Peixoto:
Generalized communities in networks. CoRR abs/1505.07478 (2015) - [i28]Travis Martin, Brian Ball, Mark E. J. Newman:
Structural inference for uncertain networks. CoRR abs/1506.05490 (2015) - [i27]Mark E. J. Newman, Aaron Clauset:
Structure and inference in annotated networks. CoRR abs/1507.04001 (2015) - [i26]Xiao Zhang, Mark E. J. Newman:
Multiway spectral community detection in networks. CoRR abs/1507.05108 (2015) - [i25]Pan Zhang, Cristopher Moore, M. E. J. Newman:
Community detection in networks with unequal groups. CoRR abs/1509.00107 (2015) - 2014
- [j7]Maria A. Riolo, M. E. J. Newman:
First-principles multiway spectral partitioning of graphs. J. Complex Networks 2(2): 121-140 (2014) - [i24]Travis Martin, Xiao Zhang, M. E. J. Newman:
Localization and centrality in networks. CoRR abs/1401.5093 (2014) - [i23]Brian Karrer, Mark E. J. Newman, Lenka Zdeborová:
Percolation on sparse networks. CoRR abs/1405.0483 (2014) - [i22]M. E. J. Newman, Travis Martin:
Equitable random graphs. CoRR abs/1405.1440 (2014) - [i21]Xiao Zhang, Travis Martin, Mark E. J. Newman:
Identification of core-periphery structure in networks. CoRR abs/1409.4813 (2014) - 2013
- [j6]Brian Ball, M. E. J. Newman:
Friendship networks and social status. Netw. Sci. 1(1): 16-30 (2013) - [i20]Travis Martin, Brian Ball, Brian Karrer, M. E. J. Newman:
Coauthorship and citation in scientific publishing. CoRR abs/1304.0473 (2013) - [i19]M. E. J. Newman:
Community detection and graph partitioning. CoRR abs/1305.4974 (2013) - [i18]M. E. J. Newman:
Spectral methods for network community detection and graph partitioning. CoRR abs/1307.7729 (2013) - [i17]M. E. J. Newman:
Spectral community detection in sparse networks. CoRR abs/1308.6494 (2013) - [i16]Xiao Zhang, Raj Rao Nadakuditi, Mark E. J. Newman:
Spectra of random graphs with community structure and arbitrary degrees. CoRR abs/1310.0046 (2013) - [i15]Seth A. Marvel, Travis Martin, Charles R. Doering, David Lusseau, M. E. J. Newman:
The small-world effect is a modern phenomenon. CoRR abs/1310.2636 (2013) - [i14]M. E. J. Newman:
Prediction of highly cited papers. CoRR abs/1310.8220 (2013) - 2012
- [i13]Raj Rao Nadakuditi, M. E. J. Newman:
Graph spectra and the detectability of community structure in networks. CoRR abs/1205.1813 (2012) - [i12]Brian Ball, M. E. J. Newman:
Friendship networks and social status. CoRR abs/1205.6822 (2012) - [i11]Raj Rao Nadakuditi, M. E. J. Newman:
Spectra of random graphs with arbitrary expected degrees. CoRR abs/1208.1275 (2012) - [i10]Maria A. Riolo, M. E. J. Newman:
First-principles multiway spectral partitioning of graphs. CoRR abs/1209.5969 (2012) - 2011
- [i9]Brian Ball, Brian Karrer, M. E. J. Newman:
An efficient and principled method for detecting communities in networks. CoRR abs/1104.3590 (2011) - [i8]Brian Karrer, M. E. J. Newman:
Competing epidemics on complex networks. CoRR abs/1105.3424 (2011) - 2010
- [b2]Mark E. J. Newman:
Networks: An Introduction. Oxford University Press 2010, ISBN 978-0-19920665-0, pp. 1-740 - [i7]Brian Karrer, M. E. J. Newman:
Random graphs containing arbitrary distributions of subgraphs. CoRR abs/1005.1659 (2010) - [i6]Brian Karrer, M. E. J. Newman:
Stochastic blockmodels and community structure in networks. CoRR abs/1008.3926 (2010)
2000 – 2009
- 2009
- [j5]Aaron Clauset, Cosma Rohilla Shalizi, Mark E. J. Newman:
Power-Law Distributions in Empirical Data. SIAM Rev. 51(4): 661-703 (2009) - [i5]Gourab Ghoshal, Vinko Zlatic, Guido Caldarelli, M. E. J. Newman:
Random hypergraphs and their applications. CoRR abs/0903.0419 (2009) - 2006
- [b1]Mark E. J. Newman:
The structure and dynamics of networks. Princeton studies in complexity, Princeton University Press 2006, ISBN 9780691113579, pp. I-X, 1-582 - [c1]Aaron Clauset, Cristopher Moore, Mark E. J. Newman:
Structural Inference of Hierarchies in Networks. SNA@ICML 2006: 1-13 - [i4]Mason A. Porter, Peter J. Mucha, M. E. J. Newman, Arthur J. Friend:
Community Structure in the United States House of Representatives. CoRR abs/physics/0602033 (2006) - [i3]Aaron Clauset, Cristopher Moore, Mark E. J. Newman:
Structural Inference of Hierarchies in Networks. CoRR abs/physics/0610051 (2006) - 2005
- [j4]Michael T. Gastner, Cosma Rohilla Shalizi, Mark E. J. Newman:
Maps and Cartograms of the 2004 US Presidential Election Results. Adv. Complex Syst. 8(1): 117-123 (2005) - [j3]M. E. J. Newman:
A measure of betweenness centrality based on random walks. Soc. Networks 27(1): 39-54 (2005) - [i2]Mason A. Porter, Peter J. Mucha, M. E. J. Newman, Casey M. Warmbrand:
A network analysis of committees in the United States House of Representatives. CoRR abs/nlin/0505043 (2005) - 2004
- [i1]Justin Balthrop, Stephanie Forrest, Mark E. J. Newman, Matthew M. Williamson:
Technological networks and the spread of computer viruses. CoRR cs.NI/0407048 (2004) - 2003
- [j2]Mark E. J. Newman:
The Structure and Function of Complex Networks. SIAM Rev. 45(2): 167-256 (2003) - [j1]Mark E. J. Newman:
Ego-centered networks and the ripple effect. Soc. Networks 25(1): 83-95 (2003)
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 22:13 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:
