Skip to main content
Log in

A note on choosing traversal counts in main path analysis

  • Published:
Scientometrics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • Batagelj, V. (2003). Efficient algorithms for citation network analysis. Preprint series, University of Ljubljana, Institute of Mathematics, Physics and Mechanics, Department of Theoretical Computer Science.

  • De Nooy, W., Mrvar, A., & Batagelj, V. (2018). Exploratory social network analysis with Pajek (3rd ed.). Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Hummon, N. P., & Doreian, P. (1989). Connectivity in a citation network: The development of DNA theory. Social Networks,11(1), 39–63.

    Article  Google Scholar 

  • Liu, J. S., Lu, L. Y., & Ho, M. H.-C. (2019). A few notes on main path analysis. Scientometrics,119(1), 379–391.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to John S. Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, J.S., Lu, L.Y.Y. & Ho, M.HC. A note on choosing traversal counts in main path analysis. Scientometrics 124, 783–785 (2020). https://doi.org/10.1007/s11192-020-03469-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11192-020-03469-7

Navigation