SearcharxivSearch

arXiv subjects

Thomas Mountford

Publications and source records attributed to Thomas Mountford.

At least 19 recordsLinked to original sources

Extension of results on generalized P\'olya's urns for polynomially self-repelling walks

This is a technical note which extends the results of Kosygina, Mountford and Peterson (Ann. Probab., 51(5):1684-1728, 2023, Section 4) about generalized P\'olya's urns from a specific weight function $w(n) = (n+1)^{-\alpha}$ to a general family of weight functions satisfying $(w(n))^{-1}=n^{\alpha}\left(1+2Bn^{-1}+O\left(n^{-2}\right)\right)$ as $n \to \infty$. The latter was considered by T\'oth (Ann. Probab., 24(3):1324-1367, 1996) as a part of his study of polynomially self-repelling walks. This extension will be used in forthcoming developments concerning scaling limits of these walks and related processes.

math.PR

The extinction of the contact process in a one-dimensional random environment with long-range interactions

We study the contact process on the long-range percolation cluster on $\mathbb{Z}$ where each edge $\langle i,j \rangle$ is open with probability $|i-j|^{-s}$ for $s> 2$. Using a renormalization procedure we apply Peierls-type argument to prove that the contact process dies out if the transmission rate is smaller than a critical threshold. Our methods involve the control of crossing probabilities for percolation on randomly-stretched lattices as in https://doi.org/10.1214/22-AAP1887.

math.PR

Limit theorems for the trajectory of the self-repelling random walk with directed edges

The self-repelling random walk with directed edges was introduced by Tóth and Vető in 2008 as a nearest-neighbor random walk on $\mathbb{Z}$ that is non-Markovian: at each step, the probability to cross a directed edge depends on the number of previous crossings of this directed edge. Tóth and Vető found this walk to have a very peculiar behavior, and conjectured that, denoting the walk by $(X_m)_{m\in\mathbb{N}}$, for any $t \geq 0$ the quantity $\frac{1}{\sqrt{N}}X_{\lfloor Nt \rfloor}$ converges in distribution to a non-trivial limit when $N$ tends to $+\infty$, but the process $(\frac{1}{\sqrt{N}}X_{\lfloor Nt \rfloor})_{t \geq 0}$ does not converge in distribution. In this paper, we prove not only that $(\frac{1}{\sqrt{N}}X_{\lfloor Nt \rfloor})_{t \geq 0}$ admits no limit in distribution in the standard Skorohod topology, but more importantly that the trajectories of the random walk still satisfy another limit theorem, of a new kind. Indeed, we show that for $n$ suitably smaller than $N$ and $T_N$ in a large family of stopping times, the process $(\frac{1}{n}(X_{T_N+tn^{3/2}}-X_{T_N}))_{t \geq 0}$ admits a non-trivial limit in distribution. The proof partly relies on combinations of reflected and absorbed Brownian motions which may be interesting in their own right.

math.PR

Convergence and non-convergence of scaled self-interacting random walks to Brownian motion perturbed at extrema

We use generalized Ray-Knight theorems introduced by Bálint Tóth in 1996 together with techniques developed for excited random walks as main tools for establishing positive and negative results concerning convergence of some classes of diffusively scaled self-interacting random walks (SIRWs) to Brownian motions perturbed at extrema (BMPE). Tóth's work studied two classes of SIRWs: asymptotically free and polynomially self-repelling walks. For both classes Toth has shown, in particular, that the distribution function of a scaled SIRW observed at independent geometric times converges to that of a BMPE indicated by the generalized Ray-Knight theorem for this SIRW. The question of weak convergence of one-dimensional distributions of scaled SIRW remained open. In this paper, on the one hand, we prove a full functional limit theorem for a large class of asymptotically free SIRWs which includes asymptotically free walks considered in Tóth's paper. On the other hand, we show that rescaled polynomially self-repelling SIRWs do not converge to the BMPE predicted by the corresponding generalized Ray-Knight theorems and, hence, do not converge to any BMPE.

math.PR

Construction and convergence results for stable webs

We introduce a new metric for collections of aged paths and a robust set of criteria for compactness for a set of collection of aged paths in the topology corresponding to this metric. We show that the distribution of stable webs ($1< α\leq 2$) made up of collections of stable paths is tight in this topology. We then show the weak convergence of appropriately normalized systems of coalescing random walks in the domain of attraction of stable laws for $1 < α\leq 2$ under this metric to the corresponding stable web. We obtain some path results in the brownian case.

math.PR

Critical scaling for an anisotropic percolation system on $\mathbb{Z}^2$

In this article, we consider an anisotropic finite-range bond percolation model on $\mathbb{Z}^2$. On each horizontal layer $\{(x,i): x \in \mathbb{Z}\}$ we have edges $\langle(x, i),(y, i)\rangle$ for $1 \leq |x - y| \leq N$. There are also vertical edges connecting two nearest neighbor vertices on distinct layers $\langle(x, i), (x, i+1)\rangle$ for $x, i \in\mathbb{Z}$. On this graph we consider the following anisotropic independent percolation model: horizontal edges are open with probability $1/(2N)$, while vertical edges are open with probability $ε$ to be suitably tuned as $N$ grows to infinity. The main result tells that if $ε=κN^{-2/5}$, we see a phase transition in $κ$: positive and finite constants $C_1, C_2$ exist so that there is no percolation if $κ< C_1$ while percolation occurs for $κ> C_2$. The question is motivated by a result on the analogous layered ferromagnetic Ising model at mean field critical temperature [J. Stat. Phys. (2015), 161, 91-123] where the authors showed the existence of multiple Gibbs measures for a fixed value of the vertical interaction and conjectured a change of behavior in $κ$ when the vertical interaction suitably vanishes as $κγ^b$, where $1/γ$ is the range of the horizontal interaction. For the product percolation model we have a value of $b$ that differs from what was conjectured in that paper. The proof relies on the analysis of the scaling limit of the critical branching random walk that dominates the growth process restricted to each horizontal layer and a careful analysis of the true horizontal growth process. This is inspired by works on the long range contact process [Probab. Th. Rel. Fields (1995), 102, 519-545]. A renormalization scheme is used for the percolative regime.

math.PR

Convergence of random walks with Markovian cookie stacks to Brownian motion perturbed at extrema

We consider one-dimensional excited random walks (ERWs) with i.i.d. markovian cookie stacks in the non-boundary recurrent regime. We prove that under diffusive scaling such an ERW converges in the standard Skorokhod topology to a multiple of Brownian motion perturbed at its extrema (BMPE). All parameters of the limiting process are given explicitly in terms of those of the cookie markov chain at a single site. While our results extend the results of Dolgopyat and Kosygina (2012, ERWs with boundedly many cookies per site) and Kosygina and Peterson (2016, ERWs with periodic cookie stacks), the approach taken is very different and involves coarse graining of both the ERW and the random environment changed by the walk. Through a careful analysis of the environment left by the walk after each ``mesoscopic'' step, we are able to construct a coupling of the ERW at this ``mesoscopic'' scale with a suitable discretization of the limiting BMPE. The analysis is based on generalized Ray-Knight theorems for the directed edge local times of the ERW stopped at certain stopping times and evolving in both the original random cookie environment and (which is much more challenging) in the environment created by the walk after each ``mesoscopic'' step.

math.PR

Zero-range process in random environment

We survey our recent articles dealing with one dimensional attractive zero range processes moving under site disorder. We suppose that the underlying random walks are biased to the right and so hyperbolic scaling is expected. Under the conditions of our model the process admits a maximal invariant measure. The initial focus of the project was to find conditions on the initial law to entail convergence in distribution to this maximal distribution, when it has a finite density. Somewhat surprisingly, necessary and sufficient conditions were found. In this part hydrody-namic results were employed chiefly as a tool to show distributional convergence but subsequently we developed a theory for hydrodynamic limits treating profiles possessing densities that did not admit corresponding equilibria. Finally we derived strong local equilibrium results.

math.PR

Many greedy cleaners in a Poisson environment

We introduce a new ``greedy cleaning'' model where a star-like state space (containing N half-lines connected by the origin) is covered by a homogeneous Poisson process of ``dust particles'', and N^α cleaners/workers proceed with cleaning in a ``greedy'' manner: each worker chooses the closest particle next. Assuming α\in (0,1), we analyse the asymptotic behaviour of the workers, as N\to\infty. We show that eventually all of them escape to infinity and that the way how do they do it depends on the value of α.

math.PR

Flooding and Diameter in General Weighted Random Graphs

We study in this paper, the first passage percolation on a random graph model, the configuration model. We first introduce, the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two vertices in the graph, and the flooding time, which represents the time (weighted length) needed to reach all the vertices in the graph starting from a uniformly chosen vertex. Our result consists of describing the asymptotic behavior of the diameter and the flooding time, as the number of vertices n tends to infinity, in the case where the weight distribution G has an exponential tail behavior, and proving that this category of distributions is the largest possible for which the asymptotic behavior holds.

math.PR

A Construction of the Stable Web

We provide a process on the space of coalescing cadlag stable paths and show convergence in the appropriate topology for coalescing stable random walks on the integer lattice.

math.PR

The asymmetric multitype contact process

In the multitype contact process, vertices of a graph can be empty or occupied by a type 1 or a type 2 individual; an individual of type $i$ dies with rate 1 and sends a descendant to a neighboring empty site with rate $λ_i$. We study this process on $\Z^d$ with $λ_1 > λ_2$ and $λ_1$ larger than the critical value of the (one-type) contact process. We prove that, if there is at least one type 1 individual in the initial configuration, then type 1 has a positive probability of never going extinct. Conditionally on this event, type 1 takes over a ball of radius growing linearly in time. We also completely characterize the set of stationary distributions of the process and prove that the process started from any initial configuration converges to a convex combination of distributions in this set.

math.PR

Power law condition for stability of Poisson hail

We consider the Poisson hail model introduced by Baccelli and Foss. We give a power law condition for the tails (spatial and temporal) of the distribution of jobs to ensure stability as the rate parameter $λ$ tends to zero. We then show that in a weak sense it is optimal.

math.PR

Exponential convergence for the Fredrikson-Andersen one spin facilitated model

We prove exponential convergence to equilibrium for the Fredrikson-Andersen one spin facilitated model on bounded degree graphs satisfying a subexponential, but larger than polynomial, growth condition. This was a classical conjecture related to non-attractive spin systems. Our proof rely on coupling techniques based on Harris graphical construction for interacting particle systems.

math.PR

Functional central limit theorem for the interface of the multitype contact process

We study the interface of the multitype contact process on $\mathbb{Z}$. In this process, each site of $\mathbb{Z}$ is either empty or occupied by an individual of one of two species. Each individual dies with rate 1 and attempts to give birth with rate $2 R λ$; the position for the possible new individual is chosen uniformly at random within distance $R$ of the parent, and the birth is suppressed if this position is already occupied. We consider the process started from the configuration in which all sites to the left of the origin are occupied by one of the species and all sites to the right of the origin by the other species, and study the evolution of the region of interface between the two species. We prove that, under diffusive scaling, the position of the interface converges to Brownian motion.

math.PR

Random walks generated by equilibrium contact processes

We consider dynamic random walks where the nearest neighbour jump rates are determined by an underlying supercritical contact process in equilibrium. This has previously been studied by den Hollander and dos Santos and den Hollander, dos Santos, Sidoravicius. We show the CLT for such a random walk, valid for all supercritical infection rates for the contact process environment.

math.PR