Skip to main content
Taylor & Francis Group Logo
    Advanced Search

    Click here to search products using title name,author name and keywords.

    • Login
    • Hi, User  
      • Your Account
      • Logout
      Advanced Search

      Click here to search products using title name,author name and keywords.

      Breadcrumbs Section. Click here to navigate to respective pages.

      Chapter

      Network Sampling Algorithms and Applications
      loading

      Chapter

      Network Sampling Algorithms and Applications

      DOI link for Network Sampling Algorithms and Applications

      Network Sampling Algorithms and Applications book

      Network Sampling Algorithms and Applications

      DOI link for Network Sampling Algorithms and Applications

      Network Sampling Algorithms and Applications book

      ByMichael Drew LaMar and Rex K. Kincaid
      BookQuantitative Graph Theory

      Click here to navigate to parent product.

      Edition 1st Edition
      First Published 2014
      Imprint Chapman and Hall/CRC
      Pages 30
      eBook ISBN 9780429103261
      Share
      Share

      ABSTRACT

      Networks appear throughout the sciences, forming a common thread linking research activities in many fields, such as sociology, biology, chemistry, engineering, marketing, and mathematics. For example, they are used in ecology to represent food webs and in engineering and computer science to design high-quality Internet router connections. Depending on the application, one network structural property may be more important than another. The structural properties of networks (e.g., degree distribution, clustering coefficient, assortativity) are usually characterized in terms of invariants [8], which are functions on networks that do not depend on the labeling of the nodes. In this chapter, we focus on network invariants that are quantitative, that is, they can be characterized as network measures. Examples

      of network measures includes degree-based measures (Randic´ index, assortativity), distance-based measures (Wiener, efficiency complexity), eigenvalue-based measures (Laplacian), and entropy measures [13,14].

      T&F logoTaylor & Francis Group logo
      • Policies
        • Privacy Policy
        • Terms & Conditions
        • Cookie Policy
        • Privacy Policy
        • Terms & Conditions
        • Cookie Policy
      • Journals
        • Taylor & Francis Online
        • CogentOA
        • Taylor & Francis Online
        • CogentOA
      • Corporate
        • Taylor & Francis Group
        • Taylor & Francis Group
        • Taylor & Francis Group
        • Taylor & Francis Group
      • Help & Contact
        • Students/Researchers
        • Librarians/Institutions
        • Students/Researchers
        • Librarians/Institutions
      • Connect with us

      Connect with us

      Registered in England & Wales No. 3099067
      5 Howick Place | London | SW1P 1WG © 2022 Informa UK Limited