Search Results

I am trying to understand this survey article by Le Gall on Brownian geometry, especially the statement of Theorem 1. The basic statement of the theorem is $$(m_n,d_n) \to (m_{\infty}, d_{\infty})$$ …

Take a random configuration of $n$ non-overlapping discs of radius $r$ in the unit square $[0,1]^2$. (You could think of this as taking $n$ points uniform randomly in $[r,1-r]^2$ and then restricting …

The following random construction is simple enough that I am guessing it must have been studied. Fix $d \ge 3$, and let $n > d$. For each of the $n$ vertices, pick exactly $d$ other vertices to conne …

Let $G(n,p)$ denote the Erdős–Rényi model of random graph. For a given function $p = p(n)$ we say that $G \in G(n,p)$ asymptotically almost surely has property $\mathcal{P}$ if $$\mbox{Pr}[G \mbox{ …

A standard measure on trees on $n$ vertices is the Uniform Spanning Tree (UST) on the complete graph. This is the measure where every tree has equal probability, $1 / n^{n-2}$ by Cayley's formula. H …

We make a random geometric graph $X(n;r)$ as follows. Choose $n$ points uniformly, independently, in the unit square $[0,1]^2$, for vertices, and then connect a pair of vertices $\{ p,q \}$ by an edge …

It seems that many, if not almost all, of the properties studied in graph theory are monotone. (Property means it is invariant under permutation of vertices, and monotone means that the property is e …

Let $G(n,p)$ denote the Erdős–Rényi random graph, where $n$ is the number of nodes and $p$ is the probability for each edge. I'm interested in precisely what range of $p$ the random graph has at least …

For a lattice in $\mathbb{R}^2$, if we include each edge independently with probability $p$ (i.e. bond percolation), it is well known that there is a critical probability $0 < p_c < 1$ depending on th …

A polyomino is formed by joining finitely many unit squares edge to edge. It may be regarded as a finite subset of the regular square tiling with a connected interior. In particular, for us, polyomino …

It is well-known that if $\omega=\omega(n)$ is any function such that $\omega \to \infty$ as $n \to \infty$, and if $p \ge (\log{n}+\omega) / n$ then the Erdős–Rényi random graph $G(n,p)$ is asymptoti …