Results 1 - 20 of 204 for All Library Resources
Sorted by:
Sorted by:
RelevanceOr hit Enter to replace sort method
- Relevance
- Date-newest
- Date-oldest
- Popularity
- Author
- Title
Refined by:
Database:
Cambridge Wholly Gold Open Access Journals
subject:
Social Sciences - Other Topics
subject:
Sociology
subject:
Social Sciences - Other Topics
subject:
Sociology
| Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
|---|---|---|---|
| 1 |
Material Type: Article
|
|
Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkersNetwork science (Cambridge University Press), 2015-09, Vol.3 (3), p.326-347 [Peer Reviewed Journal]Copyright © Cambridge University Press 2015 ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2015.10Full text available |
| 2 |
Material Type: Article
|
|
NetworKit: A tool suite for large-scale complex network analysisNetwork science (Cambridge University Press), 2016-12, Vol.4 (4), p.508-530 [Peer Reviewed Journal]Copyright © Cambridge University Press 2016 ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2016.20Full text available |
| 3 |
Material Type: Article
|
|
Modeling higher order adaptivity of a network by multilevel network reificationNetwork science (Cambridge University Press), 2020-07, Vol.8 (S1), p.S110-S144 [Peer Reviewed Journal]Cambridge University Press 2020 ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2019.56Full text available |
| 4 |
Material Type: Article
|
|
Clustering attributed graphs: Models, measures and methodsNetwork science (Cambridge University Press), 2015-09, Vol.3 (3), p.408-444 [Peer Reviewed Journal]Copyright © Cambridge University Press 2015 ;Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2015.9Full text available |
| 5 |
Material Type: Article
|
|
Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structureNetwork science (Cambridge University Press), 2021-06, Vol.9 (2), p.153-178 [Peer Reviewed Journal]The Author(s), 2021. Published by Cambridge University Press ;The Author(s), 2021. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2020.45Full text available |
| 6 |
Material Type: Article
|
|
Connectivity-preserving distributed algorithms for removing links in directed networksNetwork science (Cambridge University Press), 2022-09, Vol.10 (3), p.215-233 [Peer Reviewed Journal]The Author(s), 2022. Published by Cambridge University Press ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2022.25Full text available |
| 7 |
Material Type: Article
|
|
Random networks grown by fusing edges via urnsNetwork science (Cambridge University Press), 2022-12, Vol.10 (4), p.347-360 [Peer Reviewed Journal]The Author(s), 2022. Published by Cambridge University Press ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2022.30Full text available |
| 8 |
Material Type: Article
|
|
Properties of latent variable network modelsNetwork science (Cambridge University Press), 2016-12, Vol.4 (4), p.407-432 [Peer Reviewed Journal]Copyright © Cambridge University Press 2016 ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2016.23Full text available |
| 9 |
Material Type: Article
|
|
A local perspective on community structure in multilayer networksNetwork science (Cambridge University Press), 2017-06, Vol.5 (2), p.144-163 [Peer Reviewed Journal]Copyright © Cambridge University Press 2017 ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2016.22Full text available |
| 10 |
Material Type: Article
|
|
Measuring directed triadic closure with closure coefficientsNetwork science (Cambridge University Press), 2020-12, Vol.8 (4), p.551-573 [Peer Reviewed Journal]The Author(s), 2020. Published by Cambridge University Press ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2020.20Full text available |
| 11 |
Material Type: Article
|
|
A hierarchical latent space network model for mediationNetwork science (Cambridge University Press), 2022-06, Vol.10 (2), p.113-130 [Peer Reviewed Journal]The Author(s), 2022. Published by Cambridge University Press ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2022.12Full text available |
| 12 |
Material Type: Article
|
|
Measuring reciprocity: Double sampling, concordance, and network constructionNetwork science (Cambridge University Press), 2021-12, Vol.9 (4), p.387-402 [Peer Reviewed Journal]The Author(s), 2021. Published by Cambridge University Press ;The Author(s), 2021. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2021.18Full text available |
| 13 |
Material Type: Article
|
|
Preferential attachment hypergraph with high modularityNetwork science (Cambridge University Press), 2022-12, Vol.10 (4), p.400-429 [Peer Reviewed Journal]The Author(s), 2023. Published by Cambridge University Press ;The Author(s), 2023. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2022.35Full text available |
| 14 |
Material Type: Article
|
|
Spectral rankingNetwork science (Cambridge University Press), 2016-12, Vol.4 (4), p.433-445 [Peer Reviewed Journal]Copyright © Cambridge University Press 2016 ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2016.21Full text available |
| 15 |
Material Type: Article
|
|
Techniques for blocking the propagation of two simultaneous contagions over networks using a graph dynamical systems frameworkNetwork science (Cambridge University Press), 2022-09, Vol.10 (3), p.234-260 [Peer Reviewed Journal]The Author(s), 2022. Published by Cambridge University Press ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2022.18Full text available |
| 16 |
Material Type: Article
|
|
Consensus embedding for multiple networks: Computation and applicationsNetwork science (Cambridge University Press), 2022-06, Vol.10 (2), p.190-206 [Peer Reviewed Journal]The Author(s), 2022. Published by Cambridge University Press ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2022.17Full text available |
| 17 |
Material Type: Article
|
|
Generating weighted and thresholded gene coexpression networks using signed distance correlationNetwork science (Cambridge University Press), 2022-06, Vol.10 (2), p.131-145 [Peer Reviewed Journal]The Author(s), 2022. Published by Cambridge University Press ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2022.13 ;PMID: 36217370Full text available |
| 18 |
Material Type: Article
|
|
Uncovering the structure and temporal dynamics of information propagationNetwork science (Cambridge University Press), 2014-04, Vol.2 (1), p.26-65 [Peer Reviewed Journal]Copyright © Cambridge University Press 2014 ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2014.3Full text available |
| 19 |
Material Type: Article
|
|
Multidimensional homophily in friendship networksNetwork science (Cambridge University Press), 2014-08, Vol.2 (2), p.189-212 [Peer Reviewed Journal]Copyright © Cambridge University Press 2014 ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2014.17 ;PMID: 25525503Full text available |
| 20 |
Material Type: Article
|
|
Efficiently generating geometric inhomogeneous and hyperbolic random graphsNetwork science (Cambridge University Press), 2022-12, Vol.10 (4), p.361-380 [Peer Reviewed Journal]The Author(s), 2022. Published by Cambridge University Press ;The Author(s), 2022. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;ISSN: 2050-1242 ;EISSN: 2050-1250 ;DOI: 10.1017/nws.2022.32Full text available |
Results 1 - 20 of 204 for All Library Resources
Sorted by:
Sorted by:
RelevanceOr hit Enter to replace sort method
- Relevance
- Date-newest
- Date-oldest
- Popularity
- Author
- Title
Personalize your results
Refine Search Results
Expand My Results
Refine My Results
Creation Date
- Before 2015 (17)
- 2015 To 2016 (48)
- 2017 To 2018 (48)
- 2019 To 2021 (67)
- After 2021 (25)
-
More options
Subject
- Social Networks (79)
- Graphs (29)
- Clustering (28)
- Communication (27)
- Algorithms (25)
- Social Psychology (23)
- Sociology And Political Science (21)
- Original Article (20)
- Computer Science (19)
- Network Analysis (17)
- Friendship (14)
- Mathematics (13)
- Network Centrality (12)
- Influence (12)
-
More options
|
||||
 |
INSPIRE LIBRARY - TON DUC THANG UNIVERSITY |  |
(84-028) 37 755 057 | Feedback |
| 19 Nguyen Huu Tho St. Dist.7, HCM |  |
thuvien@tdtu.edu.vn | ||