Lecture 8 Flashcards

1
Q

Collective influence of a node is determined by _________ ____ _________

A

Measuring its degrees

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Identifying influencer nodes is good when wanting to _________(explanation)

A

Percolate the network into fragments

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Major nodes can be major ________

A

Targets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Define a center’s dominant sphere of influence

A

Hinterlands

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Delineate a center’s area of influence

A

Field

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Both the _______ and ________ of competition influence the shapes of hinterlands and fields.

A

Presence and location

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

A flow of freight or passengers or the physical infrastructure of a road or railroad

A

Linkages

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Largest linkages are called ________ or _________

A

Trunklines or main streets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Small linkages are called ________ or _______

A

Arterials or feeders

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

The largest and most important ________ are called _________ and serve as entry and exit points for a region

A

Nodes

Gateways

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A ________ differentiates between center sizes, regional dominance, and inter-city relationships

A

Hierarchy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Most important linkages are between _______ ________

A

Dominant centers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

The largest centers in the hierarchy _________ smaller cities and there are linkages of _________ magnitude between centers

A

Dominate

Varying

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Determine the structural stability, dynamic behavior, robustness, and error and attack tolerance of real networks.

A

Hubs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

They stand as proof of the highly important organizing principles that govern network evolution

A

Hubs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Value is known

A

Tangible costs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Tangle cost

Example?

A

Cannot be valued

Peace of mind

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

International free clearance

A

US custom border in other countries

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Backup plan B; you’re not vulnerable to the point where you have only one solution

A

Redundancy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Spread the risk to some other agency

A

Mitigation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

A budget is available for both ______ and ______ options

A

Preparedness and recovery

22
Q

GAO

A

Government organized think tank that gets paid to check things out

23
Q

Draw Goodovitch’s air transport network development model

A

Drawing

24
Q

Draw TMG’s idealized state model

A

Drawing

25
Q

Draw Poisson Model

A

Drawing

26
Q

Draw O’Connor’s Intl. air transportation development model

A

Drawing

27
Q

Draw Gavish Star, Multi-drop, Hub and Multi-drops, and Hub-spoke networks for computers

A

Draw

28
Q

O’Kelly Internet Model

Single-hub/
Penetration lines to regional hubs/
Development of global hub-spoke system/
Emergence of regional hub and spoke system
Reliable network systems with hub dispersion

A

Drawing

29
Q

Pick any pair of nodes at random and link them together

A

Poisson

30
Q

There are many nodes with few links and few nodes with many links

A

Scale-free network; Power Law

31
Q

The ________ _________ rule - new links are more likely to attach to nodes that already have many links.

What networks use this?

A

Preferential attachment

Scale-free

32
Q

The average of nodes is useful in ________ networks but not ________ networks

A

Random

Scale-free

33
Q

Has no strict power law and is not random

A

Small world network

34
Q

A high degree of clustering (neighborhoods), mini-hubs instead of a single dominant hub

A

Small world network

35
Q

Small number of hops between all nodes

A

Small world network

36
Q

Shortest links replace longer links; least amount of hops

A

Organizing principle

37
Q

What network uses ‘organizing principle’?

A

Small world networks

38
Q

Any node can be reached from any other node in a finite number of hops

A

Small world network

39
Q

Network that has no hubs

A

Random

40
Q

Network that has power hubs

A

Scale-free

41
Q

Networks whose failures start small, propagate until all nodes are affected by a fault

A

Cascade networks

42
Q

Networks where an epidemic will die out if the spreading rate is less than some threshold. Otherwise the epidemic will persist

A

Random cascade network

43
Q

Epidemics will not spread throughout a _________ network if the hubs are sufficiently protected

A

Scale-free cascade

44
Q

Fault-tolerance

A

Ability to be resilient

45
Q

Fault tolerance increases according to the degree of ________ provided to a node

A

Protection

46
Q

_______ networks have more fault-tolerance

A

Scale-free

47
Q

Fault tolerance increases, in a cascade network as (3 ways):

A

The degree of protected node increases

The network scale-free-ness increases

The infection rate decreases

48
Q

Exhibit oscillating or reverberating faults, that the infection or fault starts, spreads, and then dies off, starts again spreads, etc., repeatedly

Example?

A

SIS (Susceptible-Infected-Susceptible)

Internet

49
Q

Networks effects

A

Cascading effects would grow as you attach more nodes

50
Q

Cascading effects would grow as you attach more nodes

A

Network effects