Developers
DevelopersGuides
  • Introducing Bond
    • Introduction
    • Why we build Bond?
    • Roles In Bond Ecosystem
    • Decentralised Relations/Social Graph
    • Architecture
    • Bond Reward Model
      • Leech Principle
      • Barrel Principle
  • Main Concepts
    • Bond Profile
      • Identity
      • Relationships
      • Content
      • Creator Economy
    • Connection
      • Connection NFTs
    • Bond Social Graph
    • Centralities
      • In/Out Degree Centrality
      • Betweenness Centrality
      • Closeness Centrality
      • PageRank Centrality
    • Reward Models
    • Reward Contracts
    • Off-chain Oracles
    • Gasless Mode
    • Cross Chain Messaging and Pay Gas with Bond Token
  • Bond API
    • Introduction
    • API Urls
    • Getting started with GraphQL
    • Authentication
      • Login
      • Refresh JWT
    • Profile
      • Create Profile
      • SetProfileMetadata
    • Connect
      • Connect a profile
      • Disconnect
  • Smart Contracts
    • BondHub
    • MerkelDistributor
    • TokenDeployer
    • SingleStakePoolDeployer
    • LzTokenDeployer
    • LzSingleStakePoolDeployer
  • Bond SDK
    • Bond JS SDK
      • Authenticate
      • Create Profile
      • Connect
  • Bond Nodes
    • Hardware Requirements
    • Set up and Deploy
    • Node Config (TOML)
    • Secrets Config (TOML)
    • Role-Based Access Control (RBAC)
  • References
    • Deployed Contracts
    • Github
Powered by GitBook
On this page
  1. Main Concepts
  2. Centralities

In/Out Degree Centrality

In social network analysis, In/Out Degree centrality is a widely used measure to quantify the importance and influence of a node in a network. The degree of a node refers to the number of connections (i.e., edges) that the node has. The In/Out Degree centrality is defined as the sum of the in-degree and out-degree of a node, which represents the number of incoming and outgoing connections that the node has, respectively.

Mathematically, the In/Out Degree centrality of a node i can be calculated as:

InDegree(v)=∑u∈VWu,vInDegree(v)=\sum_{\substack {u \in V}}W_{u,v}InDegree(v)=u∈V​∑​Wu,v​
OutDegree(v)=∑u∈VWu,vOutDegree(v)=\sum_{\substack {u \in V}}W_{u,v}OutDegree(v)=u∈V​∑​Wu,v​

where In Degree(v) represents the in-degree of node v, which is the number of edges that connect to node v. Similarly, Out Degree(w) represents the out-degree of node , which is the number of edges that originate from node Out Degree (w). Wu, is the weight between nodes u and v, which is typically 1 and represents the presence of an edge between the two nodes.

In Bond's social network, In Degree centrality can be used to measure a user's influence and popularity in the social network. Nodes with high In Degree centrality are usually key players in the social network because they receive widespread attention and influence from others, and may be important information disseminators. Out Degree centrality can be used to measure a user's level of interaction and contribution in the social network. Nodes with high Out Degree centrality are usually active participants in social network activities, posting a large amount of information and content, or engaging in frequent communication and interaction with other users.

In summary, In/Out Degree centrality in Bond's social network analysis can help us understand users' influence, popularity, level of participation, and contribution in the social network, thereby optimising the design and operation of the social network, and improving user experience and social effectiveness.

PreviousCentralitiesNextBetweenness Centrality

Last updated 1 year ago