Innovation Networks (Value Shop) Flashcards
What are networks/graphs?
- A graph consists of a collection of objects, called
vertices, connected by links, called edges. - In social networks (e.g., economic) vertices and edges are commonly referred to as actors and relationships.
- Actors (e.g., firms) and their relationships (e.g.,
alliances) can share various characteristics.
What are neighbors in graph theory?
Two vertices (firms) are considered neighbors if they are connected by an edge (alliance).
What is a degree in graph theory?
Degree (centrality) of a vertex (firm) is the number of
neighbors.
What is a path in graph theory?
A sequence of vertices (firms) where each consecutive pair in the sequences is connected by an edge (alliance) is called a path.
What is length in graph theory?
Length of a path is the number of edges (alliances) in the sequence of vertices (firms).
What is distance in graph theory?
Distance between two vertices (firms) in a graph is the length of the shortest path between them.
When is a graph connected?
A graph is connected if there is a path between every pair of vertices.
What is diameter in graph theory?
The diameter of a (connected) graph is the average
distance between pairs of vertices.
What is a bridge in graph theory?
An edge is defined as a bridge if deleting the edge causes the neighboring vertices to lie in two different components.
What does real networks look like?
“Heavy-tailed” distribution.
A few of the firms have the most connections, in other words a few vertices has the biggest degree.
