SearcharxivSearch

arXiv subjects

Stephen B. Connor

Publications and source records attributed to Stephen B. Connor.

13 recordsLinked to original sources

Optimal Coupling of Jumpy Brownian Motion on the Circle

Consider a Brownian motion on the circumference of the unit circle, which jumps to the opposite point of the circumference at incident times of an independent Poisson process of rate $λ$. We examine the problem of coupling two copies of this `jumpy Brownian motion' started from different locations, so as to optimise certain functions of the coupling time. We describe two intuitive co-adapted couplings (`Mirror' and `Synchronous') which differ only when the two processes are directly opposite one another, and show that the question of which strategy is best depends upon the jump rate $λ$ in a non-trivial way. More precisely, we use the theory of stochastic control to show that there exists a critical value $λ^\star = 0.083\dots$ such that the Mirror coupling minimises the mean coupling time within the class of all co-adapted couplings when $λ<λ^\star$, but for $λ\ge λ^\star$ the Synchronous coupling uniquely maximises the Laplace transform $\mathbb{E}[e^{-γT}]$ of all coupling times $T$ within this class. We also provide an explicit description of a (non co-adapted) maximal coupling for any jump rate in the case that the two jumpy Brownian motions begin at antipodal points of the circle.

math.PR

Integrals of incomplete beta functions, with applications to order statistics, random walks and string enumeration

We study the probability that one beta-distributed random variable exceeds the maximum of two others, allowing all three to have general parameters. This amounts to studying Euler transforms of products of two incomplete beta functions. We provide a closed form for the general problem in terms of Kampé de Fériet functions and a variety of simpler closed forms in special cases. The results are applied to derive the moments of the maximum of two independent beta-distributed random variables and to find inner products of incomplete beta functions. Restricted to positive integer parameters, our results are applied to determine an expected exit time for a conditioned random walk and also to a combinatorial problem of enumerating strings comprised of three different letters, subject to constraints.

math.CA

Cutoff for a One-sided Transposition Shuffle

We introduce a new type of card shuffle called one-sided transpositions. At each step a card is chosen uniformly from the pack and then transposed with another card chosen uniformly from below it. This defines a random walk on the symmetric group generated by a distribution which is non-constant on the conjugacy class of transpositions. Nevertheless, we provide an explicit formula for all eigenvalues of the shuffle by demonstrating a useful correspondence between eigenvalues and standard Young tableaux. This allows us to prove the existence of a total-variation cutoff for the one-sided transposition shuffle at time $n\log n$. We also study a weighted generalisation of the shuffle which, in particular, allows us to recover the well known mixing time of the classical random transposition shuffle.

math.PR

Omnithermal Perfect Simulation for Multi-server Queues

A number of perfect simulation algorithms for multi-server First Come First Served queues have recently been developed. Those of Connor and Kendall (2015) and Blanchet, Pei, and Sigman (2015) use dominated Coupling from the Past (domCFTP) to sample from the equilibrium distribution of the Kiefer-Wolfowitz workload vector for stable M/G/c and GI/GI/c queues respectively, using Random Assignment queues as dominating processes. In this note we answer a question posed by Connor and Kendall (2015), by demonstrating how these algorithms may be modified in order to carry out domCFTP simultaneously for a range of values of c (the number of servers).

math.PR

Mixing times for exclusion processes on hypergraphs

We introduce a natural extension of the exclusion process to hypergraphs and prove an upper bound for its mixing time. In particular we show the existence of a constant $C$ such that for any connected, regular hypergraph $G$ within some natural class, the $\varepsilon$-mixing time of the exclusion process on $G$ with any feasible number of particles can be upper-bounded by $CT_{\text{EX}(2,G)}\log(|V|/\varepsilon)$, where $|V|$ is the number of vertices in $G$ and $T_{\text{EX}(2,G)}$ is the 1/4-mixing time of the corresponding exclusion process with just two particles. Moreover we show this is optimal in the sense that there exist hypergraphs in the same class for which $T_{\mathrm{EX}(2,G)}$ and the mixing time of just one particle are not comparable. The proofs involve an adaptation of the chameleon process, a technical tool invented by Morris and developed by Oliveira for studying the exclusion process on a graph.

math.PR

Mixing Time and Cutoff for a Random Walk on the Ring of Integers mod $n$

We analyse a random walk on the ring of integers mod $n$, which at each time point can make an additive `step' or a multiplicative `jump'. When the probability of making a jump tends to zero as an appropriate power of $n$ we prove the existence of a total variation pre-cutoff for this walk. In addition, we show that the process obtained by subsampling our walk at jump times exhibits a true cutoff, with mixing time dependent on whether the step distribution has zero mean.

math.PR

Perfect Simulation of $M/G/c$ Queues

In this paper we describe a perfect simulation algorithm for the stable $M/G/c$ queue. Sigman (2011: Exact Simulation of the Stationary Distribution of the FIFO M/G/c Queue. Journal of Applied Probability, 48A, 209--213) showed how to build a dominated CFTP algorithm for perfect simulation of the super-stable $M/G/c$ queue operating under First Come First Served discipline, with dominating process provided by the corresponding $M/G/1$ queue (using Wolff's sample path monotonicity, which applies when service durations are coupled in order of initiation of service), and exploiting the fact that the workload process for the $M/G/1$ queue remains the same under different queueing disciplines, in particular under the Processor Sharing discipline, for which a dynamic reversibility property holds. We generalize Sigman's construction to the stable case by comparing the $M/G/c$ queue to a copy run under Random Assignment. This allows us to produce a naive perfect simulation algorithm based on running the dominating process back to the time it first empties. We also construct a more efficient algorithm that uses sandwiching by lower and upper processes constructed as coupled $M/G/c$ queues started respectively from the empty state and the state of the $M/G/c$ queue under Random Assignment. A careful analysis shows that appropriate ordering relationships can still be maintained, so long as service durations continue to be coupled in order of initiation of service. We summarize statistical checks of simulation output, and demonstrate that the mean run-time is finite so long as the second moment of the service duration distribution is finite.

math.PR

Optimal co-adapted coupling for a random walk on the hyper-complete-graph

The problem of constructing an optimal co-adapted coupling for a pair of symmetric random walks on $Z_2^d$ was considered by Connor and Jacka (2008), and the existence of a coupling which is stochastically fastest in the class of all such co-adapted couplings was demonstrated. In this paper we show how to generalise this construction to an optimal co-adapted coupling for the continuous-time symmetric random walk on $K_n^d$, where $K_n$ is the complete graph with $n$ vertices. Moreover, we show that although this coupling is not maximal for any $n$ (i.e. it does not achieve equality in the coupling inequality), it does tend to a maximal coupling as $n\to\infty$.

math.PR

Separation and coupling cutoffs for tuples of independent Markov processes

We consider an $n$-tuple of independent ergodic Markov processes, each of which converges (in the sense of separation distance) at an exponential rate, and obtain a necessary and sufficient condition for the $n$-tuple to exhibit a separation cutoff. We also provide general bounds on the (asymmetric) window size of the cutoff, and indicate links to classical extreme value theory.

math.PR

State-dependent Foster-Lyapunov criteria for subgeometric convergence of Markov chains

We consider a form of state-dependent drift condition for a general Markov chain, whereby the chain subsampled at some deterministic time satisfies a geometric Foster-Lyapunov condition. We present sufficient criteria for such a drift condition to exist, and use these to partially answer a question posed by Connor & Kendall (2007) concerning the existence of so-called 'tame' Markov chains. Furthermore, we show that our 'subsampled drift condition' implies the existence of finite moments for the return time to a small set.

math.PR

Perfect simulation for a class of positive recurrent Markov chains

This paper generalizes the work of Kendall [Electron. Comm. Probab. 9 (2004) 140--151], which showed that perfect simulation, in the form of dominated coupling from the past, is always possible (although not necessarily practical) for geometrically ergodic Markov chains. Here, we consider the more general situation of positive recurrent chains and explore when it is possible to produce such a simulation algorithm for these chains. We introduce a class of chains which we name tame, for which we show that perfect simulation is possible.

math.PR