Introduction to Social Networks

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

1/17

flashcard set

Earn XP

Description and Tags

Key concepts related to social networks and their characteristics.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

18 Terms

1
New cards

Social Network

A structure made up of individuals or organizations connected by one or more specific types of interdependency.

2
New cards

Vertices

The individual nodes in a graph representing people or entities.

3
New cards

Edges

Connections between the vertices in a graph, denoting relationships.

4
New cards

Triadic Closure

The principle that if two nodes in a network have a common connection, they are likely to become connected themselves.

5
New cards

Clustering Coefficient

A measure of the degree to which nodes in a graph tend to cluster together.

6
New cards

Homophily

The tendency of individuals to associate and bond with similar others.

7
New cards

Local Bridge

An edge (or connection) between two nodes that does not belong to a triangle, indicating a weak tie.

8
New cards

Betweenness Centrality

A measure of how often a node acts as a bridge along the shortest path between two other nodes.

9
New cards

Embeddedness

The degree to which a relationship is reinforced by the network of ties within which it is embedded.

10
New cards

Weak Ties

Connections between individuals who are not closely related but provide bridges to other social networks.

11
New cards

Strong Ties

Close relationships between individuals characterized by high levels of interaction.

12
New cards

Edge Betweenness

The number of shortest paths that pass through a particular edge, used to identify important connections.

13
New cards

Community Structure

The organization of nodes into groups that interact more with each other than with nodes outside the group.

14
New cards

Degree Distribution

The distribution of the degrees of nodes in a network, offering insight into the network's structure.

15
New cards

Graph Density

The ratio of the number of edges to the total number of possible edges in a graph.

16
New cards

Diameter of a Graph

The greatest distance between any pair of vertices in the graph, indicating the longest shortest path.

17
New cards

Connected Component

A subset of a graph in which any two vertices are connected to each other by paths and which is connected to no additional vertices.

18
New cards