IDEAS home Printed from https://ideas.repec.org/a/bla/jamist/v64y2013i12p2507-2512.html
   My bibliography  Save this article

Statistical common author networks

Author

Listed:
  • Francisco G. Serpa
  • Adam M. Graves
  • Artjay Javier

Abstract

A new method for visualizing the relatedness of scientific areas has been developed that is based on measuring the overlap of researchers between areas. It is found that closely related areas have a high propensity to share a larger number of common authors. A method for comparing areas of vastly different sizes and to handle name homonymy is constructed, allowing for the robust deployment of this method on real data sets. A statistical analysis of the probability distributions of the common author overlap that accounts for noise is carried out along with the production of network maps with weighted links proportional to the overlap strength. This is demonstrated on 2 case studies, complexity science and neutrino physics, where the level of relatedness of areas within each area is expected to vary greatly. It is found that the results returned by this method closely match the intuitive expectation that the broad, multidisciplinary area of complexity science possesses areas that are weakly related to each other, whereas the much narrower area of neutrino physics shows very strongly related areas.

Suggested Citation

  • Francisco G. Serpa & Adam M. Graves & Artjay Javier, 2013. "Statistical common author networks," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 64(12), pages 2507-2512, December.
    • Handle: RePEc:bla:jamist:v:64:y:2013:i:12:p:2507-2512
    DOI: 10.1002/asi.22956
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.22956
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.22956?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamist:v:64:y:2013:i:12:p:2507-2512. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.