Searcharxiv⌕ Search

arXiv subjects

James T. Murphy III

Publications and source records attributed to James T. Murphy III.

3 recordsLinked to original sources

Exact Coupling of Random Walks on Polish Groups

Exact coupling of random walks is studied. Conditions for admitting a successful exact coupling are given that are necessary and in the Abelian case also sufficient. In the Abelian case, it is shown that a random walk $S$ with step-length distribution $μ$ started at $0$ admits a successful exact coupling with a version $S^x$ started at $x$ if and only if there is $n\geq 1$ with $μ^{n} \wedge μ^{n}(x+\cdot) \neq 0$. Moreover, when a successful exact coupling exists, the total variation distance between $S_n$ and $S^x_n$ is determined to be $O(n^{-1/2})$ if $x$ has infinite order, or $O(ρ^n)$ for some $ρ\in (0,1)$ if $x$ has finite order. In particular, this paper solves a problem posed by H. Thorisson on successful exact coupling of random walks on $\mathbb{R}$. It is also noted that the set of such $x$ for which a successful exact coupling can be constructed is a Borel measurable group. Lastly, the weaker notion of possible exact coupling and its relationship to successful exact coupling are studied.

math.PR↗

Doeblin Trees

This paper is centered on the random graph generated by a Doeblin-type coupling of discrete time processes on a countable state space whereby when two paths meet, they merge. This random graph is studied through a novel subgraph, called a bridge graph, generated by paths started in a fixed state at any time. The bridge graph is made into a unimodular network by marking it and selecting a root in a specified fashion. The unimodularity of this network is leveraged to discern global properties of the larger Doeblin graph. Bi-recurrence, i.e., recurrence both forwards and backwards in time, is introduced and shown to be a key property in uniquely distinguishing paths in the Doeblin graph, and also a decisive property for Markov chains indexed by $\mathbb{Z}$. Properties related to simulating the bridge graph are also studied.

math.PR↗

Point-shifts of Point Processes on Topological Groups

This paper focuses on flow-adapted point-shifts of point processes on topological groups, which map points of a point process to other points of the point process in a translation invariant way. Foliations and connected components generated by point-shifts are studied, and the cardinality classification of connected components, previously known on Euclidean space, is generalized to unimodular groups. An explicit counterexample is also given on a non-unimodular group. Isomodularity of a point-shift is defined and identified as a key component in generalizations of Mecke's invariance theorem in the unimodular and non-unimodular cases. Isomodularity is also the deciding factor of when the reciprocal and reverse of a point-map corresponding to a bijective point-shift are equal in distribution. Next, sufficient conditions for separating points of a point process are given. Finally, connections between point-shifts of point processes and vertex-shifts of unimodular networks are given that allude to a deeper connection between the theories.

math.PR↗