# Selected problems in probability theory

@inproceedings{Grimmett2022SelectedPI, title={Selected problems in probability theory}, author={Geoffrey R. Grimmett}, year={2022} }

. This celebratory article contains a personal and idiosyncratic selection of a few open problems in discrete probability theory. These include certain well known questions concerning Lorentz scatterers and self-avoiding walks, and also some problems of percolation-type. The author hopes the reader will ﬁnd some-thing to leaven winter evenings, and perhaps even a project for the longer term.

## Figures from this paper

## References

SHOWING 1-10 OF 40 REFERENCES

A correlation inequality for connection events in percolation

- Philosophy
- 1999

It is well-known in percolation theory (and intuitively plausible) that two events of the form ``there is an open path from $s$ to $a$" are positively correlated. We prove the (not intuitively…

Self-Avoiding Walks

- Physics
- 1991

The study of self-avoiding walks arose in chemical physics as a model for long polymer chains. Roughly speaking, a polymer is composed of a large number of monomers which can form together randomly…

Towards a theory of negative dependence

- Mathematics
- 2000

The FKG theorem says that the positive lattice condition, an easily checkable hypothesis which holds for many natural families of events, implies positive association, a very useful property. Thus…

Percolation ?

- Mathematics
- 1982

572 NOTICES OF THE AMS VOLUME 53, NUMBER 5 Percolation is a simple probabilistic model which exhibits a phase transition (as we explain below). The simplest version takes place on Z2, which we view…

The Random-Cluster Model

- Mathematics
- 2006

The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in…

Lectures on self-avoiding walks

- Physics
- 2010

These lecture notes provide a rapid introduction to a number of rigorous results on self-avoiding walks, with emphasis on the critical behaviour. Following an introductory overview of the central…

Self-Avoiding Walks and Connective Constants

- MathematicsSpringer Proceedings in Mathematics & Statistics
- 2019

The connective constant \(\mu (G)\) of a quasi-transitive graph G is the asymptotic growth rate of the number of self-avoiding walks (SAWs) on G from a given starting vertex. We survey several…

On the Manhattan pinball problem

- Mathematics
- 2020

We consider the periodic Manhattan lattice with alternating orientations going north-south and east-west. Place obstructions on vertices independently with probability $0 \frac{1}{2}-\varepsilon$…

Non-coincidence of quenched and annealed connective constants on the supercritical planar percolation cluster

- Mathematics
- 2012

In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical percolation cluster on $$\mathbb{Z }^d$$Zd. More precisely, we count $$Z_N$$ZN, the number of…

Infinite paths in randomly oriented lattices

- MathematicsRandom Struct. Algorithms
- 2001

A property of self-duality is exploited to show that, when a+b=1, the process is, in a sense to be made precise, either critical or supercritical, but not subcritical.