default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaghmeh Momeni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j3]Babak Fotouhi, Naghmeh Momeni, Maria A. Riolo
, David L. Buckeridge:
Statistical methods for constructing disease comorbidity networks from longitudinal inpatient data. Appl. Netw. Sci. 3(1): 46:1-46:34 (2018)- [i10]Babak Fotouhi, Naghmeh Momeni, Benjamin Allen, Martin A. Nowak:
Conjoining uncooperative societies facilitates evolution of cooperation. CoRR abs/1805.12215 (2018) - [i9]Babak Fotouhi, Naghmeh Momeni, Benjamin Allen, Martin A. Nowak:
Evolution of Cooperation on Stochastic Block Models. CoRR abs/1807.03093 (2018) - [i8]Naghmeh Momeni, Michael G. Rabbat:
Effectiveness of Alter Sampling in Social Networks. CoRR abs/1812.03096 (2018) - 2017
- [j2]Benjamin Allen, Gabor Lippner, Yu-Ting Chen, Babak Fotouhi, Naghmeh Momeni, Shing-Tung Yau, Martin A. Nowak:
Evolutionary dynamics on any population structure. Nat. 544(7649): 227-230 (2017) - [j1]Naghmeh Momeni, Michael G. Rabbat:
Inferring Structural Characteristics of Networks With Strong and Weak Ties From Fixed-Choice Surveys. IEEE Trans. Signal Inf. Process. over Networks 3(3): 513-525 (2017) - [i7]Naghmeh Momeni, Michael G. Rabbat:
Inferring Structural Characteristics of Networks with Strong and Weak Ties from Fixed-Choice Surveys. CoRR abs/1706.07828 (2017) - 2016
- [c4]Naghmeh Momeni, Michael G. Rabbat:
Inferring network properties from fixed-choice design with strong and weak ties. SSP 2016: 1-5 - [i6]Naghmeh Momeni, Michael G. Rabbat:
Qualities and Inequalities in Online Social Networks through the Lens of the Generalized Friendship Paradox. CoRR abs/1602.03739 (2016) - 2015
- [c3]Naghmeh Momeni, Michael G. Rabbat:
Measuring the Generalized Friendship Paradox in Networks with Quality-Dependent Connectivity. CompleNet 2015: 45-55 - [c2]Babak Fotouhi, Naghmeh Momeni:
Inter-layer Degree Correlations in Heterogeneously Growing Multiplex Networks. CompleNet 2015: 159-170 - [i5]Babak Fotouhi, Naghmeh Momeni:
Multiplex Networks with Intrinsic Fitness: Modeling the Merit-Fame Interplay via Latent Layers. CoRR abs/1506.04189 (2015) - [i4]Babak Fotouhi, Naghmeh Momeni:
Growing Multiplex Networks with Arbitrary Number of Layers. CoRR abs/1506.06278 (2015) - 2014
- [c1]Babak Fotouhi, Naghmeh Momeni, Michael G. Rabbat:
Generalized Friendship Paradox: An Analytical Approach. SocInfo Workshops 2014: 339-352 - [i3]Babak Fotouhi, Naghmeh Momeni, Michael G. Rabbat:
Generalized Friendship Paradox: An Analytical Approach. CoRR abs/1410.0586 (2014) - [i2]Babak Fotouhi, Naghmeh Momeni:
Non-trivial Inter-layer Degree Correlations in Heterogeneously Growing Multiplex Networks. CoRR abs/1411.0344 (2014) - [i1]Naghmeh Momeni, Michael G. Rabbat:
Measuring the Generalized Friendship Paradox in Networks with Quality-dependent Connectivity. CoRR abs/1411.0556 (2014)
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-04-24 23:10 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:
