Social Networks Class 11

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/11

flashcard set

Earn XP

Description and Tags

study for final; main concepts: (cohesive subgroups, components, cliques, n-cliques, k-cores, partitioning & community detection, hierarchial cluster analysis

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

12 Terms

1
New cards

What is a cohesive subgroup?

A group of people who interact more with each other than with people outside the group. These groups are also called communities, clusters, or modules.

2
New cards

What are the two questions we ask when identifying cohesive subgroups?

How connected are members within the group? How different are they from outsiders?

3
New cards

What is a component?

A subgroup where everyone can reach everyone else through direct or indirect ties, and there are no outside links.

4
New cards

What is a clique?

A maximal complete subgraph where every member is directly connected to every other member. Must have 3 nodes.

5
New cards

What does "maximal" mean in a clique?

You can’t add any more nodes without losing full mutual connections

6
New cards

What are the limitations of cliques?

Fragile, if one tie breaks, it completely falls apart.

7
New cards

What is an n-clique?

All members are connected within n steps instead of directly.

8
New cards

What is a 2-clique?

A group where every node can reach others within 2 steps.

9
New cards

What is a k-core?

A group where each member has at least k ties to others within the group. Helps detect dense core groups.

10
New cards

What is partitioning in network analysis?

You define the group size/# before hand. Dividing a network into a specified number of groups based on certain algorithms.

11
New cards

What is community detection?

a method used to find groups (communities) in a network without being told what the groups are ahead of time.

12
New cards

What is hierarchical clustering?

A bottom-up method where nodes are merged into bigger clusters based on their similarity or distance.