Searcharxiv⌕ Search

arXiv subjects

Mark Holmes

Publications and source records attributed to Mark Holmes.

At least 37 records · Page 2Linked to original sources
arXiv2018

On the range of lattice models in high dimensions - extended version

In this paper we investigate the scaling limit of the range (the set of visited vertices) for a class of critical lattice models, starting from a single initial particle at the origin. We give conditions on the random sets and an associated "ancestral relation" under which, conditional on longterm survival, the rescaled ranges converge weakly to the range of super-Brownian motion as random sets. These hypotheses also give precise asymptotics for the limiting behaviour of exiting a large ball, that is for the extrinsic one-arm probabililty. We show that these conditions are satisfied by the voter model in dimensions $d \ge 2$ and critical sufficiently spread out lattice trees in dimensions $d > 8$. The latter result also has important consequences for the behaviour of random walks on lattice trees in high dimensions. We conjecture that our conditions are also satisfied by other models (at criticality above the critical dimension) such as sufficiently spread out oriented percolation and contact processes in dimensions d > 4. This version of the paper contains details not present in the submitted version.

math.PR↗
arXiv2016

Conditions for ballisticity and invariance principle for random walk in non-elliptic random environment

We study the asymptotic behaviour of random walks in i.i.d. non-elliptic random environments on $\mathbb{Z}^d$. Standard conditions (and proofs) for ballisticity and the central limit theorem require ellipticity. We use oriented percolation and martingale arguments to give non-trivial local conditions for ballisticity and an annealed invariance principle in the non-elliptic setting.

math.PR↗
arXiv2016

Notes on oriented percolation

These notes fill in results about oriented percolation that are required for the paper [3] ("Forward clusters for degenerate random environments"). Since these are essentially modifications of results found in other sources (but adapted to the model we particularly need), there is no intention to publish these.

math.PR↗
arXiv2014

The voter model chordal interface in two dimensions

Consider the voter model on a box of side length $L$ (in the triangular lattice) with boundary votes fixed forever as type 0 or type 1 on two different halves of the boundary. Motivated by analogous questions in percolation, we study several geometric objects at stationarity, as $L\rightarrow \infty$. One is the interface between the (large -- i.e., boundary connected) 0-cluster and 1-cluster. Another is the set of large "coalescing classes" determined by the coalescing walk process dual to the voter model.

math.PR↗
arXiv2014

Strongly reinforced Pólya urns with graph-based competition

We introduce a class of reinforcement models where, at each time step $t$, one first chooses a random subset $A_t$ of colours (independent of the past) from $n$ colours of balls, and then chooses a colour $i$ from this subset with probability proportional to the number of balls of colour $i$ in the urn raised to the power $α>1$. We consider stability of equilibria for such models and establish the existence of phase transitions in a number of examples, including when the colours are the edges of a graph, a context which is a toy model for the formation and reinforcement of neural connections.

math.PR↗
arXiv2013

Forward clusters for degenerate random environments

We consider connectivity properties and asymptotic slopes for certain random directed graphs on $Z^2$ in which the set of points $C_o$ that the origin connects to is always infinite. We obtain conditions under which the complement of $C_o$ has no infinite connected component. Applying these results to one of the most interesting such models leads to an improved lower bound for the critical occupation probability for oriented site percolation on the triangular lattice in 2 dimensions.

math.PR↗
arXiv2012

Tree models for difference and change detection in a complex environment

A new family of tree models is proposed, which we call "differential trees." A differential tree model is constructed from multiple data sets and aims to detect distributional differences between them. The new methodology differs from the existing difference and change detection techniques in its nonparametric nature, model construction from multiple data sets, and applicability to high-dimensional data. Through a detailed study of an arson case in New Zealand, where an individual is known to have been laying vegetation fires within a certain time period, we illustrate how these models can help detect changes in the frequencies of event occurrences and uncover unusual clusters of events in a complex environment.

stat.ME↗
arXiv2012

Nonparametric tests for change-point detection à la Gombay and Horváth

The nonparametric test for change-point detection proposed by Gombay and Horváth is revisited and extended in the broader setting of empirical process theory. The resulting testing procedure for potentially multivariate observations is based on a sequential generalization of the functional multiplier central limit theorem and on modifications of Gombay and Horváth's seminal approach that appears to improve the finite-sample behavior of the tests. A large number of candidate test statistics based on processes indexed by lower-left orthants and half-spaces are considered and their performance is studied through extensive Monte Carlo experiments involving univariate, bivariate and trivariate data sets. Finally, practical recommendations are provided and the tests are illustrated on trivariate hydrological data.

stat.ME↗
arXiv2012

Model of the Human Sleep Wake System

A model and analysis of the human sleep/wake system is presented. The model is derived using the known neuronal groups, and their various projections, involved with sleep and wake. Inherent in the derivation is the existence of a slow time scale associated with homeostatic regulation, and a faster time scale associated with the dynamics within the sleep phase. A significant feature of the model is that it does not contain a periodic forcing term, common in other models, reflecting the fact that sleep/wake is not dependent upon a diurnal stimulus. Once derived, the model is analyzed using a linearized stability analysis. We then use experimental data from normal sleep-wake systems and orexin knockout systems to verify the physiological validity of the equations.

math.DS↗
arXiv2012

A combinatorial result with applications to self-interacting random walks

We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting random walk couplings, these allow us to reprove some known transience and recurrence results for some simple models. We also obtain new results for one-dimensional multi-excited random walks and for random walks in random environments in all dimensions.

math.PR↗
arXiv2012

Degenerate random environments

We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider. In such models, one of the quantities most often studied is the (random) set of vertices that can be reached from the origin by following a connected path. More generally, for the models we consider, multiple different types of connectivity are of interest, including: the set of vertices that can be reached from the origin; the set of vertices from which the origin can be reached; the intersection of the two. As with percolation models, many of the models we consider admit, or are expected to admit phase transitions. Among the main results of the paper is a proof of the existence of phase transitions for some two-dimensional models that are non-monotone in their underlying parameter, and an improved bound on the critical value for oriented site percolation on the triangular lattice. The connectivity of the random directed graphs provides a foundation for understanding the asymptotic properties of random walks in these random environments, which we study in a second paper.

math.PR↗
arXiv2012

Random walks in degenerate random environments

We study the asymptotic behaviour of random walks in i.i.d. random environments on $\Z^d$. The environments need not be elliptic, so some steps may not be available to the random walker. We prove a monotonicity result for the velocity (when it exists) for any 2-valued environment, and show that this does not hold for 3-valued environments without additional assumptions. We give a proof of directional transience and the existence of positive speeds under strong, but non-trivial conditions on the distribution of the environment. Our results include generalisations (to the non-elliptic setting) of 0-1 laws for directional transience, and in 2-dimensions the existence of a deterministic limiting velocity.

math.PR↗
arXiv2012

A monotonicity property for random walk in a partially random environment

We prove a law of large numbers for random walks in certain kinds of i.i.d. random environments in Z^d that is an extension of a result of Bolthausen, Sznitman and Zeitouni (2003). We use this result, along with the lace expansion for self-interacting random walks, to prove a monotonicity result for the first coordinate of the speed of the random walk under some strong assumptions on the distribution of the environment.

math.PR↗
arXiv2011

The survival probability and r-point functions in high dimensions

In this paper we investigate the survival probability, θ_n, in high-dimensional statistical physical models, where θ_n denotes the probability that the model survives up to time n. We prove that if the r-point functions scale to those of the canonical measure of super-Brownian motion, and if a certain self-repellence condition is satisfied, then nθ_n\ra 2/(AV), where A is the asymptotic expected number of particles alive at time n, and V is the vertex factor of the model. Our results apply to spread-out lattice trees above 8 dimensions, spread-out oriented percolation above 4+1 dimensions, and the spread-out contact process above 4+1 dimensions. In the case of oriented percolation, this reproves a result by the first author, den Hollander and Slade (that was proved using heavy lace expansion arguments), at the cost of losing explicit error estimates. We further derive several consequences of our result involving the scaling limit of the number of particles alive at time proportional to n. Our proofs are based on simple weak convergence arguments.

math.PR↗
arXiv2010

An expansion for self-interacting random walks

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the true (weakly) self-avoiding walk, loop-erased random walk, and annealed random walk in random environment. In this paper we show that the expansion gives rise to useful formulae for the speed and variance of the random walk, when these quantities are known to exist. The results and formulae of this paper have been used elsewhere by the authors to prove monotonicity properties for the speed (in high dimensions) of excited random walk and related models, and certain models of random walk in random environment. We also derive a law of large numbers and central limit theorem (with explicit error terms) directly from this expansion, under strong assumptions on the expansion coefficients. The assumptions are shown to be satisfied by excited random walk in high dimensions with small excitation parameter, a model of reinforced random walk with underlying drift and small reinforcement parameter, and certain models of random walk in random environment under strong ellipticity conditions. This is the extended version of the paper, where we provide all proofs.

math.PR↗
arXiv2009

Excited against the tide: A random walk with competing drifts

We study a random walk that has a drift $\fracβ{d}$ to the right when located at a previously unvisited vertex and a drift $\fracμ{d}$ to the left otherwise. We prove that in high dimensions, for every $μ$, the drift to the right is a strictly increasing and continuous function of $β$, and that there is precisely one value $β_0(μ,d)$ for which the resulting speed is zero.

math.PR↗