SearcharxivSearch

arXiv subjects

Edward Crane

Publications and source records attributed to Edward Crane.

At least 19 recordsLinked to original sources

Coupling Markov chains with a common image chain

Consider time-homogeneous discrete-time Markov chains $X$, $Y$, and $Z$ on countable state spaces, considered as stochastic processes with specified initial distributions. Suppose for maps $f$ and $g$ that $(f(X_t))_{t \ge 0}$ and $(g(Y_t))_{t \ge 0}$ are both equal in law to $Z$. We prove that $X$ and $Y$ can be coupled so that $(X_t, Y_t)_{t \ge 0}$ is a homogeneous Markov chain with $f(X_t) = g(Y_t)$ for all $t \ge 0$. Without the assumption that $Z$ is Markov, no such Markov coupling exists in general, even an inhomogeneous one. Moreover, we give an explicit construction of such a coupling, with the additional property that $X$ and $Y$ are conditionally independent given the entire trajectory $(f(X_t))_{t \ge 0}$. Under the further assumption that $X$ and $Y$ are stationary, we construct a coupling having the above properties that is also stationary. In this case, conditional independence holds for the corresponding two-sided chains indexed by $\mathbb{Z}$ (but not necessarily for the one-sided versions). We prove further properties of our couplings in special cases where $f$ or $g$ satisfies the strong lumping condition (also known as Dynkin's condition) or the exact lumping condition (also known as the Pitman-Rogers condition). When $f$ is a strong lumping and $g$ is an exact lumping, we show that our coupling coincides with an intertwining of Markov chains as constructed by Diaconis and Fill.

math.PR

The fastest way through a traffic light

We give a rigorous solution of an optimisation problem of minimizing the expected delay caused by encountering a red traffic light on a road journey. The problem incorporates simple constraints on maximum speed, acceleration and braking rates, and depends on the assumed distribution of the remaining time until the traffic light will turn green, after it is first noticed. We assume that this distribution has a bounded and non-increasing density, which is natural since this holds for the law of the excess time in any stationary renewal process. In two special cases, where this distribution is either Uniform or Exponential, we give a complete characterisation of all possible combinations of phases of maximum acceleration, maximum speed, maximum braking, following an Euler--Lagrange curve, and standing stationary at the traffic light, which can make up an optimal solution. The key technique is to write the problem in terms of a two-dimensional pressure integral, so that the problem becomes analogous to filling a tank with a given quantity of liquid.

math.OC

Recurrence, transience and anti-concentration of Rademacher random walks

The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by Bhattacharya and Volkov in 2023 of the transience or recurrence of one-dimensional Rademacher random walks. In particular, we show that if the sequence of step sizes is bounded, the walk is weakly recurrent, meaning that it returns infinitely often to a random finite interval, while if the step sizes tend to infinity arbitrarily slowly, the walk may be transient. On the other hand, using a construction with integer step sizes, we show that the step sizes may grow arbitrarily fast and still give a weakly recurrent random walk. We also show, using a construction with non-integer step sizes, that the same conclusion holds even if we restrict to strictly increasing step sizes. However, we prove that if $a_n = n^{\alpha + o(1)}$ for some $\alpha > 1/2$, then the walk is transient. We show that the bound on $\alpha$ is tight by giving an example where $a_n = \Theta(n^{1/2})$ and the walk is weakly recurrent.

math.PR

Weak lumping of left-invariant random walks on left cosets of finite groups

Let $G$ be a finite group and let $H$ be a subgroup of $G$. The left-invariant random walk driven by a probability measure $w$ on $G$ is the Markov chain in which from any state $x \in G$, the probability of stepping to $xg \in G$ is $w(g)$. The initial state is chosen randomly according to a given distribution. The walk is said to lump weakly on left cosets if the induced process on $G/H$ is a time-homogeneous Markov chain. We characterise all the initial distributions and weights $w$ such that the walk is irreducible and lumps weakly on left cosets, and determine all the possible transition matrices of the induced Markov chain. In the case where $H$ is abelian we refine our main results to give a necessary and sufficient condition for weak lumping by an explicit system of linear equations on $w$, organized by the double cosets $HxH$. As an application we consider shuffles of a deck of $n$ cards such that repeated observations of the top card form a Markov chain. Such shuffles include the random-to-top shuffle, and also, when the deck is started in a uniform random order, the top-to-random shuffle. We give a further family of examples in which our full theory of weak lumping is needed to verify that the top card sequence is Markov.

math.PR

Gaussian consensus processes and their Lyapunov exponents

We introduce a simple dynamic model of opinion formation, in which a finite population of individuals hold vector-valued opinions. At each time step, each individual's opinion moves towards the mean opinion but is then perturbed independently by a centred multivariate Gaussian random variable, with covariance proportional to the covariance matrix of the opinions of the population. We establish precise necessary and sufficient conditions on the parameters of the model, under which all opinions converge to a common limiting value. Asymptotically perfect correlation emerges between opinions on different topics. Our results are rigorous and based on properties of the partial products of an i.i.d. sequence of random matrices. Each matrix is a fixed linear combination of the identity matrix and a real Ginibre matrix. We derive an analytic expression for the maximal Lyapunov exponent of this product sequence. We also analyze a continuous-time analogue of our model.

math.PR

The limit point in the Jante's law process has an absolutely continuous distribution

We study a stochastic model of consensus formation, introduced in 2015 by Grinfeld, Volkov and Wade, who called it a multidimensional randomized Keynesian beauty contest. The model was generalized by Kennerberg and Volkov, who called their generalization the Jante's law process. We consider a version of the model where the space of possible opinions is a convex body $\mathcal{B}$ in $\mathbb{R}^d$. $N$ individuals in a population each hold a (multidimensional) opinion in $\mathcal{B}$. Repeatedly, the individual whose opinion is furthest from the center of mass of the $N$ current opinions chooses a new opinion, sampled uniformly at random from $\mathcal{B}$. Kennerberg and Volkov showed that the set of opinions that are not furthest from the center of mass converges to a random limit point. We show that the distribution of the limit opinion is continuous, thus proving the conjecture made after Proposition 3.2 in Grinfeld et al.

math.PR

Age evolution in the mean field forest fire model via multitype branching processes

We study the distribution of ages in the mean field forest fire model introduced by Ráth and Tóth. This model is an evolving random graph whose dynamics combine Erdős-Rényi edge-addition with a Poisson rain of lightning strikes. All edges in a connected component are deleted when any of its vertices is struck by lightning. We consider the asymptotic regime of lightning rates for which the model displays self-organized criticality. The age of a vertex increases at unit rate, but it is reset to zero at each burning time. We show that the empirical age distribution converges as a process to a deterministic solution of an autonomous measure-valued differential equation. The main technique is to observe that, conditioned on the vertex ages, the graph is an inhomogeneous random graph in the sense of Bollobás, Janson and Riordan. We then study the evolution of the ages via the multitype Galton--Watson trees that arise as the limit in law of the component of an identified vertex at any fixed time. These trees are critical from the gelation time onwards.

math.PR

Well-posedness of the mean field forest fire age evolution equation

We prove the well-posedness of a differential equation that describes the evolution of the large-system limit of the empirical age measure in the mean field forest fire model of Ráth and Tóth (arXiv:0808.2116). This forest fire model is a random graph process on $n$ vertices, whose dynamics combine the Erdős-Rényi dynamics with a Poisson rain of lightning strikes. All edges in any connected component are deleted as soon as any of its vertices is struck by lightning. Each vertex has an age, which increases at rate $1$ but is reset to $0$ each time it burns. We consider the asymptotic lightning regime in which the model displays self-organized criticality. Crane, Ráth and Yeo (arXiv:1811.07981) take the initial state to be an inhomogeneous random graph whose edge probabilities depend on the ages of the vertices. They show that as $n \to \infty$ the empirical age distribution converges as a process to the solution of a deterministic autonomous differential equation. It is a nonlinear age-dependent population dynamics model whose age-specific mortality modulus involves the leading eigenfunction of the branching operator of an associated multitype branching process. The differential equation displays self-organized criticality in the sense that the leading eigenvalue of the branching operator is held at $1$ without this being imposed as a boundary condition.

math.AP

Functional Large Deviations for Cox Processes and $Cox/G/\infty$ Queues, with a Biological Application

We consider an infinite-server queue into which customers arrive according to a Cox process and have independent service times with a general distribution. We prove a functional large deviations principle for the equilibrium queue length process. The model is motivated by a linear feed-forward gene regulatory network, in which the rate of protein synthesis is modulated by the number of RNA molecules present in a cell. The system can be modelled as a tandem of infinite-server queues, in which the number of customers present in a queue modulates the arrival rate into the next queue in the tandem. We establish large deviation principles for this queueing system in the asymptotic regime in which the arrival process is sped up, while the service process is not scaled.

math.PR

Steady state clusters and the Rath-Toth mean field forest fire model

We introduce a random finite rooted tree $\mathcal{C}$, the steady state cluster, characterized by a recursive description: $\mathcal{C}$ is a singleton with probability $1/2$ and otherwise is obtained by joining by an edge the roots of two independent trees $\mathcal{C}'$ and $\mathcal{C}''$, each having the law of $\mathcal{C}$, then re-rooting the resulting tree at a uniform random vertex. We construct a stationary regenerative stochastic process $\mathcal{C}(t)$, the steady state cluster growth process. It is characterized by a simple fixed-point property. Its stationary distribution is the law of the steady state cluster $\mathcal{C}$. We conjecture that $\mathcal{C}(t)$ is the local limit of the evolution of the cluster of a tagged vertex in the stationary state of the mean field forest fire model of Ráth and Tóth. We describe its explosions in terms of a Lévy subordinator, using a state-dependent time change. The steady state cluster is also a multitype Galton-Watson tree with a continuum of types. The steady state cluster conditioned on its size is a random weighted spanning tree of the complete graph equipped random edge weights with a simple explicit joint distribution. The time-reversal of the steady state cluster growth process is realised as the component of a `uniform' vertex in a logging process of a critical multitype Galton-Watson tree conditioned to be infinite. We construct a stationary forest fire model on the infinite rooted tree $\mathbb{Z}^*$ with the property that the evolution of the cluster of the root is a version of the steady state cluster growth process. This model is similar in spirit to Aldous' frozen percolation model on the rooted infinite binary tree. We conjecture that it is the local weak limit of the stationary Ráth-Tóth model.

math.PR

Diffusion and superdiffusion in lattice models of colliding particles with stored momentum

We introduce two discrete models of a collection of colliding particles with stored momentum and study the asymptotic growth of the mean-square displacement of an active particle. We prove that the models are superdiffusive in one dimension (with power law correction) and diffusive in three and higher dimensions. In two dimensions we demonstrate superdiffusivity (with logarithmic correction) for certain anisotropic initial conditions.

math.PR

Circle Packings with Generalized Branching

Attempts to build a discrete theory for rational maps on the sphere via circle packing have foundered on discretization effects in locating branch points. The authors remove this impediment by introducing generalized branch points. A generalized branch point need no longer be attached to an individual circle, but with the help of chaperones and other devices, can be positioned anywhere that the geometry requires. The effects will be illustrated in images and videos as we use generalized branching to fix flaws in discrete Ahlfors and Weierstrasse functions.

math.GT

Cluster growth in the dynamical Erdős-Rényi process with forest fires

We investigate the growth of clusters within the forest fire model of Ráth and Tóth [22]. The model is a continuous-time Markov process, similar to the dynamical Erdős-Rényi random graph but with the addition of so-called fires. A vertex may catch fire at any moment and, when it does so, causes all edges within its connected cluster to burn, meaning that they instantaneously disappear. Each burned edge may later reappear. We give a precise description of the process $C_t$ of the size of the cluster of a tagged vertex, in the limit as the number of vertices in the model tends to infinity. We show that $C_t$ is an explosive branching process with a time-inhomogeneous offspring distribution and instantaneous return to $1$ on each explosion. Additionally, we show that the characteristic curves used to analyse the Smoluchowski-type coagulation equations associated to the model have a probabilistic interpretation in terms of the process $C_t$.

math.PR

Intrinsic circle domains

Using quasiconformal mappings, we prove that any Riemann surface of finite connectivity and finite genus is conformally equivalent to an intrinsic circle domain U in a compact Riemann surface S. This means that each connected component B of S \ U is either a point or a closed geometric disc with respect to the complete constant curvature conformal metric of the Riemann surface (U union B). Moreover the pair (U,S) is unique up to conformal isomorphisms. We give a generalization to countably infinite connectivity. Finally we show how one can compute numerical approximations to intrinsic circle domains using circle packings and conformal welding.

math.CV

The simple harmonic urn

We study a generalized Pólya urn model with two types of ball. If the drawn ball is red, it is replaced together with a black ball, but if the drawn ball is black it is replaced and a red ball is thrown out of the urn. When only black balls remain, the roles of the colors are swapped and the process restarts. We prove that the resulting Markov chain is transient but that if we throw out a ball every time the colors swap, the process is recurrent. We show that the embedded process obtained by observing the number of balls in the urn at the swapping times has a scaling limit that is essentially the square of a Bessel diffusion. We consider an oriented percolation model naturally associated with the urn process, and obtain detailed information about its structure, showing that the open subgraph is an infinite tree with a single end. We also study a natural continuous-time embedding of the urn process that demonstrates the relation to the simple harmonic oscillator; in this setting, our transience result addresses an open problem in the recurrence theory of two-dimensional linear birth and death processes due to Kesten and Hutton. We obtain results on the area swept out by the process. We make use of connections between the urn process and birth--death processes, a uniform renewal process, the Eulerian numbers, and Lamperti's problem on processes with asymptotically small drifts; we prove some new results on some of these classical objects that may be of independent interest. For instance, we give sharp new asymptotics for the first two moments of the counting function of the uniform renewal process. Finally, we discuss some related models of independent interest, including a "Poisson earthquakes" Markov chain on the homeomorphisms of the plane.

math.PR

Rigidity of configurations of balls and points in the $N$-sphere

We answer two questions of Beardon and Minda that arose from their study of the conformal symmetries of circular regions in the complex plane. We show that a configuration of closed balls in the $N$-sphere is determined up to Möbius transformations by the signed inversive distances between pairs of its elements, except when the boundaries of the balls have a point in common, and that a configuration of points in the $N$-sphere is determined by the absolute cross-ratios of 4-tuples of its elements. The proofs use the hyperboloid model of hyperbolic $(N+1)$-space.

math.MG

Conical limit sets and continued fractions

Inspired by questions of convergence in continued fraction theory, Erdős, Piranian and Thron studied the possible sets of divergence for arbitrary sequences of Möbius maps acting on the Riemann sphere, $S^2$. By identifying $S^2$ with the boundary of three-dimensional hyperbolic space, $H^3$, we show that these sets of divergence are precisely the sets that arise as conical limit sets of subsets of $H^3$. Using hyperbolic geometry, we give simple geometric proofs of the theorems of Erdős, Piranian and Thron that generalise to arbitrary dimensions. New results are also obtained about the class of conical limit sets, for example, that it is closed under locally quasisymmetric homeomorphisms. Applications are given to continued fractions.

math.DS

A note on the Hayman-Wu theorem

The Hayman-Wu theorem states that the preimage of a line or circle L under a conformal mapping from the unit disc to a simply-connected domain U has total Euclidean length bounded by an absolute constant. The best possible constant is known to lie in the interval [pi^2, 4 pi), thanks to work of Øyma and Rohde. Earlier, Brown Flinn showed that the total length is at most pi^2 in the special case in which U contains L. Let r be the anti-Möbius map that fixes L pointwise. In this note we extend the sharp bound pi^2 to the case where each connected component of the intersection of U with r(U) is bounded by one arc of U and its image under r. We also strengthen the bounds slightly by replacing Euclidean length with the strictly larger spherical length restricted to the unit disc.

math.CV