GitHub

Original file line numberDiff line numberDiff line change

@@ -18,6 +18,7 @@ kernelspec:

1818

</div>

1919

```

2020
21+

(ar1_processes)=

2122

# AR1 Processes

2223
2324

```{admonition} Migrated lecture

@@ -29,10 +30,6 @@ This lecture has moved from our [Intermediate Quantitative Economics with Python

2930

```{index} single: Autoregressive processes

3031

```

3132
32-

```{contents} Contents

33-

:depth: 2

34-

```

35-
3633

## Overview

3734
3835

In this lecture we are going to study a very simple class of stochastic

Original file line numberDiff line numberDiff line change

@@ -16,10 +16,6 @@ kernelspec:

1616

```{index} single: The Perron-Frobenius Theorem

1717

```

1818
19-

```{contents} Contents

20-

:depth: 2

21-

```

22-
2319

In addition to what's in Anaconda, this lecture will need the following libraries:

2420
2521

```{code-cell} ipython3

Original file line numberDiff line numberDiff line change

@@ -14,10 +14,6 @@ kernelspec:

1414

(heavy_tail)=

1515

# Heavy-Tailed Distributions

1616
17-

```{contents} Contents

18-

:depth: 2

19-

```

20-
2117

In addition to what's in Anaconda, this lecture will need the following libraries:

2218
2319

```{code-cell} ipython3

Original file line numberDiff line numberDiff line change

@@ -17,10 +17,6 @@ kernelspec:

1717

```{index} single: Markov Chains: Basic Concepts and Stationarity

1818

```

1919
20-

```{contents} Contents

21-

:depth: 2

22-

```

23-
2420

In addition to what's in Anaconda, this lecture will need the following libraries:

2521
2622

```{code-cell} ipython3

Original file line numberDiff line numberDiff line change

@@ -16,11 +16,6 @@ kernelspec:

1616

```{index} single: Markov Chains: Irreducibility and Ergodicity

1717

```

1818
19-

```{contents} Contents

20-

:depth: 2

21-

```

22-
23-
2419

In addition to what's in Anaconda, this lecture will need the following libraries:

2520
2621

```{code-cell} ipython3

Original file line numberDiff line numberDiff line change

@@ -17,10 +17,6 @@ kernelspec:

1717

```{index} single: Distributions and Probabilities

1818

```

1919
20-

```{contents} Contents

21-

:depth: 2

22-

```

23-
2420

## Outline

2521
2622

In this lecture we give a quick introduction to data and probability distributions using Python.

Original file line numberDiff line numberDiff line change

@@ -17,11 +17,8 @@ kernelspec:

1717

</div>

1818

```

1919
20-

# {index}`Dynamics in One Dimension <single: Dynamics in One Dimension>`

21-
22-

```{contents} Contents

23-

:depth: 2

24-

```

20+

(scalar_dynam)=

21+

# Dynamics in One Dimension

2522
2623

## Overview

2724
Original file line numberDiff line numberDiff line change

@@ -28,10 +28,6 @@ kernelspec:

2828

```{index} single: Models; Schelling's Segregation Model

2929

```

3030
31-

```{contents} Contents

32-

:depth: 2

33-

```

34-
3531

## Outline

3632
3733

In 1969, Thomas C. Schelling developed a simple but striking model of racial

Original file line numberDiff line numberDiff line change

@@ -23,10 +23,6 @@ kernelspec:

2323

```{index} single: Dynamic Programming; Shortest Paths

2424

```

2525
26-

```{contents} Contents

27-

:depth: 2

28-

```

29-
3026

## Overview

3127
3228

The shortest path problem is a [classic problem](https://en.wikipedia.org/wiki/Shortest_path) in mathematics and computer science with applications in

Original file line numberDiff line numberDiff line change

@@ -14,10 +14,6 @@ kernelspec:

1414

(supply_demand_heterogeneity)=

1515

# Market Equilibrium with Heterogeneity

1616
17-

```{contents} Contents

18-

:depth: 2

19-

```

20-
2117

## Overview

2218
2319

In the {doc}`previous lecture

Read the original on github.com ↗