Probability

In Bernoulli bond percolation, we delete or retain each edge of a graph independently at random with some retention parameter p and study the geometry of the connected components (clusters) of the resulting subgraph. For lattices of dimension d>1, percolation has a phase transition, with a infinite cluster emerging at a critical probability pc(d). It is believed that critical percolation at and near the critical probability exhibits rich, fractal-like geometry that is expected to be approximately independent of the choice of lattice but highly dependent on the dimension d. In particular, various qualitative distinctions are expected between the low dimensional case d<6, the high-dimensional case d>6, and the critical case d=6, but this remains poorly understood particularly in dimensions d=3,4,5,6.

In this course, I will give an overview of of what is known about critical percolation, focussing on the non-planar models and including a detailed treatment of recent advances in long-range and hierarchical models for which various aspects of intermediate-dimensional critical phenomena can now be understood rigorously.

No prior knowledge of percolation will be assumed.

• Lecture 1
• Lecture 2
• Lecture 3
• Lecture 4
• Lecture 5
• Lecture 6
• Lecture 7
• Lecture 8
• Lecture 9
• Lecture 10
• Lecture 11
• Lecture 12
• Lecture 13
• Lecture 14
• Lecture 15
• Lecture 16

The heat kernel is the fundamental solution to a parabolic partial differential equation. From a probabilistic perspective, the heat kernel is the transition probability density of a stochastic process. Harnack inequalities and functional inequalities such as Poincare and Sobolev inequalities provide tools to understand the relationship between the behavior of the heat kernel and the geometry of the underlying space. An important feature of the approach using functional inequalities is its robustness under perturbations.

The study of the heat kernel and its estimates has produced fruitful interactions between the fields of Analysis, Geometry, and Probability. One of the goals of this course is to illustrate these interactions of heat kernel estimates with functional inequalities, boundary trace processes, quasisymmetric maps, circle packings, the time change of Markov processes, Doob's h-transform, and estimates of harmonic measure or exit distribution.

The setting for this course is a symmetric Markov process which is equivalentlydescribed using a Dirichlet form. This course will contain an introduction to the theory of Dirichlet forms. This theory will be used to construct and analyze Markov processes. This course will survey both classical results and recent progress in our understanding of heat kernel estimates and Harnack inequalities.

• Lecture 1
• Lecture 2
• Lecture 3
• Lecture 4
• Lecture 5
• Lecture 6
• Lecture 7
• Lecture 8
• Lecture 9
• Lecture 10
• Lecture 11
• Lecture 12
• Lecture 13
• Lecture 14
• Lecture 15
• Lecture 16

The heat kernel is the fundamental solution to a parabolic partial differential equation. From a probabilistic perspective, the heat kernel is the transition probability density of a stochastic process. Harnack inequalities and functional inequalities such as Poincare and Sobolev inequalities provide tools to understand the relationship between the behavior of the heat kernel and the geometry of the underlying space. An important feature of the approach using functional inequalities is its robustness under perturbations.

The study of the heat kernel and its estimates has produced fruitful interactions between the fields of Analysis, Geometry, and Probability. One of the goals of this course is to illustrate these interactions of heat kernel estimates with functional inequalities, boundary trace processes, quasisymmetric maps, circle packings, the time change of Markov processes, Doob's h-transform, and estimates of harmonic measure or exit distribution.

The setting for this course is a symmetric Markov process which is equivalentlydescribed using a Dirichlet form. This course will contain an introduction to the theory of Dirichlet forms. This theory will be used to construct and analyze Markov processes. This course will survey both classical results and recent progress in our understanding of heat kernel estimates and Harnack inequalities.

• Lecture 1
• Lecture 2
• Lecture 3
• Lecture 4
• Lecture 5
• Lecture 6
• Lecture 7
• Lecture 8
• Lecture 9
• Lecture 10
• Lecture 11
• Lecture 12
• Lecture 13
• Lecture 14
• Lecture 15
• Lecture 16

This course will focus on two well-studied models of modern probability: simple symmetric and branching random walks in ℤd. The focus will be on the study of their trace in the regime that this is a small subset of the ambient space.
We will start by reviewing some useful classical (and not) facts about simple random walks. We will introduce the notion of capacity and give many alternative forms for it. Then we will relate it to the covering problem of a domain by a simple random walk. We will review Lawler’s work on non-intersection probabilities and focus on the critical dimension $d=4$. With these tools at hand we will study the tails of the intersection of two infinite random walk ranges in dimensions d≥5.

A branching random walk (or tree indexed random walk) in ℤd is a non-Markovian process whose time index is a random tree. The random tree is either a critical Galton Watson tree or a critical Galton Watson tree conditioned to survive. Each edge of the tree is assigned an independent simple random walk in ℤd increment and the location of every vertex is given by summing all the increments along the geodesic from the root to that vertex. When $d\geq 5$, the branching random walk is transient and we will mainly focus on this regime. We will introduce the notion of branching capacity and show how it appears naturally as a suitably rescaled limit of hitting probabilities of sets. We will then use it to study covering problems analogously to the random walk case.

Consider a population that undergoes asexual and homogeneous reproduction over time, originating from a single individual and eventually ceasing to exist after producing a total of n individuals. What is the order of magnitude of the maximum number of children of an individual in this population when n tends to infinity? This question is equivalent to studying the largest degree of a large Bienaymé-Galton-Watson random tree. We identify a regime where a condensation phenomenon occurs, in which the second greatest degree is negligible compared to the greatest degree. The use of the "one-big jump principle" of certain random walks is a key tool for studying this phenomenon. Finally, we discuss applications of these results to other combinatorial models.