Searcharxiv⌕ Search

arXiv subjects

Aidan Sudbury

Publications and source records attributed to Aidan Sudbury.

6 recordsLinked to original sources

Pick-up Sticks and the Fibonacci Factorial

We present a variation of the broken stick problem in which $n$ stick lengths are sampled uniformly at random. We prove that the probability that no three sticks can form a triangle is the reciprocal of the product of the first $n$ Fibonacci numbers. Extensions to quadrilaterals and general $k$-gons are also discussed.

math.PR↗

The mixing advantage is less than 2

Corresponding to $n$ independent non-negative random variables $X_1,...,X_n$, are values $M_1,...,M_n$, where each $M_i$ is the expected value of the maximum of $n$ independent copies of $X_i$. We obtain an upper bound to the expected value of the maximum of $X_1,...,X_n$ in terms of $M_1,...,M_n$. This inequality is sharp in the sense that the quantity and its bound can be made as close to each other as we want. We also present related comparison results.

math.PR↗

The expected duration of random sequential adsorption

When gas molecules bind to a surface they may do so in such a way that the adsorption of one molecule inhibits the arrival of others. We consider random sequential adsorption in which the empty sites of a graph are irreversibly occupied in random order by a variety of types of ``particles.'' In a finite region the process terminates when no more particles can arrive. A universal asymptotic formula for the mean duration is given.

math.PR↗

Some results for poisoning in a catalytic model

We obtain new results concerning poisoning/nonpoisoning in a catalytic model which has previously been introduced and studied. We show that poisoning can occur even when the arrival rate of one gas is smaller than the sum of the arrival rates of the other gases, and that poisoning does not occur when all gases have equal arrival rates.

math.PR↗

Exact and approximate results for deposition and annihilation processes on graphs

We consider random sequential adsorption processes where the initially empty sites of a graph are irreversibly occupied, in random order, either by monomers which block neighboring sites, or by dimers. We also consider a process where initially occupied sites annihilate their neighbors at random times. We verify that these processes are well defined on infinite graphs, and derive forward equations governing joint vacancy/occupation probabilities. Using these, we derive exact formulae for occupation probabilities and pair correlations in Bethe lattices. For the blocking and annihilation processes we also prove positive correlations between sites an even distance apart, and for blocking we derive rigorous lower bounds for the site occupation probability in lattices, including a lower bound of 1/3 for Z^2. We also give normal approximation results for the number of occupied sites in a large finite graph.

math.PR↗

Absorption problems for quantum walks in one dimension

This paper treats absorption problems for the one-dimensional quantum walk determined by a 2 times 2 unitary matrix U on a state space {0,1,...,N} where N is finite or infinite by using a new path integral approach based on an orthonormal basis P, Q, R and S of the vector space of complex 2 times 2 matrices. Our method studied here is a natural extension of the approach in the classical random walk.

quant-ph↗