Scribd
Upload
27 views5 pages

Network Communities and Affiliation Networks

Uploaded by

diyaraj140
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views5 pages

Network Communities and Affiliation Networks

Uploaded by

diyaraj140
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Network communities and

Affiliation networks
1. Edge Betweenness
Edge betweenness measures the importance of an edge in a network based on
how often it appears on the shortest paths between pairs of nodes. It is commonly
used in identifying crucial edges that connect different parts of a network.
Definition: Edge betweenness of an edge is the sum of the fraction of shortest
paths between all node pairs that pass through 𝑒.

σst: Total number of shortest paths between nodes s and t.


σst(e): Number of shortest paths between sss and ttt that pass through edge e.
2. Modularity Clustering
Modularity clustering is used to detect communities within a network by maximizing a modularity
score Q, which measures the density of connections within communities compared to random
connections.

Key Points:

High modularity indicates strong community structure.

Algorithms like the Louvain or Greedy optimization are used to group nodes into communities.

Social Network Examples:

Detecting friend groups in social networks.

Identifying topic-specific communities in citation networks.


3. Affiliation Networks
Affiliation networks represent relationships between entities and groups or events.
They are typically represented as two-mode networks (bipartite graphs), with two
distinct types of nodes:

Actors/Entities (e.g., people, companies).

Affiliations (e.g., events, groups, projects).


Example:

● A network where individuals are connected to organizations they belong to.


● E.g., people attending conferences or actors appearing in movies.

Applications:

1. Understanding collaboration patterns.


2. Examining participation in events or shared memberships.
4. Bipartite Graphs
Bipartite graphs are networks with two disjoint sets of nodes, where edges
connect nodes only from one set to the other. They are widely used in modeling
affiliation networks.
Examples:
Movie graph: One set for actors, another for movies; edges represent
participation.
Social network: One set for users, another for groups; edges represent
membership.
Applications:
Recommender systems (e.g., users and items).
Collaborative filtering in social media.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy