arXiv subjects

Alan Hammond

Publications and source records attributed to Alan Hammond.

At least 19 recordsLinked to original sources

arXiv2025

From tug-of-war to Brownian Boost: explicit ODE solutions for player-funded stochastic-differential games

Brownian Boost is a one-parameter family of stochastic differential games played on the real line in which players spend at rates of their choosing in an ongoing effort to influence the drift of a randomly diffusing point particle~$X$. One or other player is rewarded, at time infinity, according to whether~$X$ tends to plus or minus infinity. Each player's net receipt is the final reward (only for the victor) minus the player's total spend. We characterise and explicitly compute the time-homogeneous Markov-perfect Nash equilibria of Brownian Boost, finding the derivatives of the players' expected payoffs to solve a pair of coupled first-order non-linear ODE. Brownian Boost is a high-noise limit of a two-dimensional family of player-funded tug-of-war games, one of which was studied in~\cite{LostPennies}. We analyse the discrete games, finding them, and Brownian Boost, to exemplify key features studied in the economics literature of tug-of-war initiated by~\cite{HarrisVickers87}: a battlefield region where players spend heavily; stakes that decay rapidly but asymmetrically in distance to the battlefield; and an effect of discouragement that makes equilibria fragile under asymmetric perturbation of incentive. Tug-of-war has a parallel mathematical literature derived from~\cite{PSSW09}, which solved the scaled fair-coin game in a Euclidean domain via the infinity Laplacian PDE. By offering an analytic solution to Brownian Boost, a game that models strategic interaction and resource allocation, we seek to build a bridge between the two tug-of-war literatures.

math.PR↗

arXiv2024

Sharp asymptotics for finite point-to-plane connections in supercritical bond percolation in dimension at least three

We consider supercritical bond percolation in $\mathbb{Z}^d$ for $d \geq 3$. The origin lies in a finite open cluster with positive probability, and, when it does, the diameter of this cluster has an exponentially decaying tail. For each unit vector $\bf\ell$, we prove sharp asymptotics for the probability that this cluster contains a vertex $x \in \mathbb{Z}^d$ that satisfies $x \cdot \bf\ell \geq u$. For an axially aligned $\bf\ell$, we find this probability to be of the form $\kappa \exp \{ - \zeta u \}(1+ {\rm err})$ for $u \in \mathbb{N}$, where $\vert {\rm err} \vert$ is at most $C \exp \{ - c u^{1/2} \big\}$; for general $\bf\ell$, the form of the asymptotic depends on whether $\bf\ell$ satisfies a natural lattice condition. To obtain these results, we prove that renewal points in long clusters are abundant, with a renewal block length whose tail is shown to decay as fast as $C \exp \big\{ - c u^{1/2} \big\}$.

math.PR↗

arXiv2023

Directed Spatial Permutations on Asymmetric Tori

We investigate a model of random spatial permutations on two-dimensional tori, and establish that the joint distribution of large cycles is asymptotically given by the Poisson--Dirichlet distribution with parameter one. The asymmetry of the tori we consider leads to a spatial bias in the permutations, and this allows for a simple argument to deduce the existence of mesoscopic cycles. The main challenge is to leverage this mesoscopic structure to establish the existence and distribution of macroscopic cycles. We achieve this by a dynamical resampling argument in conjunction with a method developed by Schramm for the study of random transpositions on the complete graph. Our dynamical analysis implements generic heuristics for the occurrence of the Poisson--Dirichlet distribution in random spatial permutations, and hence may be of more general interest.

math.PR↗

arXiv2022

On the Trail of Lost Pennies: player-funded tug-of-war on the integers

We study random-turn resource-allocation games. In the Trail of Lost Pennies, a counter moves on $\mathbb{Z}$. At each turn, Maxine stakes $a \in [0,\infty)$ and Mina $b \in [0,\infty)$. The counter $X$ then moves adjacently, to the right with probability $\tfrac{a}{a+b}$. If $X_i \to -\infty$ in this infinte-turn game, Mina receives one unit, and Maxine zero; if $X_i \to \infty$, then these receipts are zero and $x$. Thus the net receipt to a given player is $-A+B$, where $A$ is the sum of her stakes, and $B$ is her terminal receipt. The game was inspired by unbiased tug-of-war in~[PSSW] from 2009 but in fact closely resembles the original version of tug-of-war, introduced [HarrisVickers87] in the economics literature in 1987. We show that the game has surprising features. For a natural class of strategies, Nash equilibria exist precisely when $x$ lies in $[\lambda,\lambda^{-1}]$, for a certain $\lambda \in (0,1)$. We indicate that $\lambda$ is remarkably close to one, proving that $\lambda \leq 0.999904$ and presenting clear numerical evidence that $\lambda \geq 1 - 10^{-4}$. For each $x \in [\lambda,\lambda^{-1}]$, we find countably many Nash equilibria. Each is roughly characterized by an integral {\em battlefield} index: when the counter is nearby, both players stake intensely, with rapid but asymmetric decay in stakes as it moves away. Our results advance premises [HarrisVickers87,Konrad12] for fund management and the incentive-outcome relation that plausibly hold for many player-funded stake-governed games. Alongside a companion treatment [HP22] of games with allocated budgets, we thus offer a detailed mathematical treatment of an illustrative class of tug-of-war games. We also review the separate developments of tug-of-war in economics and mathematics in the hope that mathematicians direct further attention to tug-of-war in its original resource-allocation guise.

math.PR↗

arXiv2022

Stake-governed tug-of-war and the biased infinity Laplacian

In tug-of-war, two players compete by moving a counter along edges of a graph, each winning the right to move at a given turn according to the flip of a possibly biased coin. The game ends when the counter reaches the boundary, a fixed subset of the vertices, at which point one player pays the other an amount determined by the boundary vertex. Economists and mathematicians have independently studied tug-of-war for many years, focussing respectively on resource-allocation forms of the game, in which players iteratively spend precious budgets in an effort to influence the bias of the coins that determine the turn victors; and on PDE arising in fine mesh limits of the constant-bias game in a Euclidean setting. In this article, we offer a mathematical treatment of a class of tug-of-war games with allocated budgets: each player is initially given a fixed budget which she draws on throughout the game to offer a stake at the start of each turn, and her probability of winning the turn is the ratio of her stake and the sum of the two stakes. We consider the game played on a tree, with boundary being the set of leaves, and the payment function being the indicator of a single distinguished leaf. We find the game value and the essentially unique Nash equilibrium of a leisurely version of the game, in which the move at any given turn is cancelled with constant probability after stakes have been placed. We show that the ratio of the players' remaining budgets is maintained at its initial value $\lambda$; game value is a biased infinity harmonic function; and the proportion of remaining budget that players stake at a given turn is given in terms of the spatial gradient and the $\lambda$-derivative of game value. We also indicate examples in which the solution takes a different form in the non-leisurely game.

math.PR↗

arXiv2021

Collapse and Diffusion in Harmonic Activation and Transport

For an $n$-element subset $U$ of $\mathbb{Z}^2$, select $x$ from $U$ according to harmonic measure from infinity, remove $x$ from $U$, and start a random walk from $x$. If the walk leaves from $y$ when it first enters $U$, add $y$ to $U$. Iterating this procedure constitutes the process we call Harmonic Activation and Transport (HAT). HAT exhibits a phenomenon we refer to as collapse: informally, the diameter shrinks to its logarithm over a number of steps which is comparable to this logarithm. Collapse implies the existence of the stationary distribution of HAT, where configurations are viewed up to translation, and the exponential tightness of diameter at stationarity. Additionally, collapse produces a renewal structure with which we establish that the center of mass process, properly rescaled, converges in distribution to two-dimensional Brownian motion. To characterize the phenomenon of collapse, we address fundamental questions about the extremal behavior of harmonic measure and escape probabilities. Among $n$-element subsets of $\mathbb{Z}^2$, what is the least positive value of harmonic measure? What is the probability of escape from the set to a distance of, say, $d$? Concerning the former, examples abound for which the harmonic measure is exponentially small in $n$. We prove that it can be no smaller than exponential in $n \log n$. Regarding the latter, the escape probability is at most the reciprocal of $\log d$, up to a constant factor. We prove it is always at least this much, up to an $n$-dependent factor.

math.PR↗

arXiv2021

Exceptional times when the KPZ fixed point violates Johansson's conjecture on maximizer uniqueness

In 2002, Johansson conjectured that the maximum of the Airy$_2$ process minus the parabola $x^2$ is almost surely achieved at a unique location. This result was proved a decade later by Corwin and Hammond; Moreno Flores, Quastel and Remenik; and Pimentel. Up to scaling, the Airy$_2$ process minus the parabola $x^2$ arises as the fixed time spatial marginal of the KPZ fixed point when started from narrow wedge initial data. We extend this maximizer uniqueness result to the fixed time spatial marginal of the KPZ fixed point when begun from any element of a very broad class of initial data. None of these results rules out the possibility that at random times, the KPZ fixed point spatial marginal violates maximizer uniqueness. To understand this possibility, we study the probability that the KPZ fixed point has, at a given time, two or more locations where its value is close to the maximum, obtaining quantitative upper and lower bounds in terms of the degree of closeness for a very broad class of initial data. We also compute a quantity akin to the joint density of the locations of two maximizers and the maximum value. As a consequence, the set of times of maximizer non-uniqueness almost surely has Hausdorff dimension at most two-thirds. Our analysis relies on the exact formula for the distribution function of the KPZ fixed point obtained by Matetski, Quastel and Remenik, the variational formula for the KPZ fixed point involving the Airy sheet constructed by Dauvergne, Ortmann and Vir\'ag, and the Brownian Gibbs property for the Airy$_2$ process minus the parabola $x^2$ demonstrated by Corwin and Hammond.

math.PR↗

arXiv2020

The geometry of near ground states in Gaussian polymer models

The energy and geometry of maximizing paths in integrable last passage percolation models are governed by the characteristic KPZ scaling exponents of one-third and two-thirds. When represented in scaled coordinates that respect these exponents, this random field of paths may be viewed as a complex energy landscape. We investigate the structure of valleys and connecting pathways in this landscape. The routed weight profile $\mathbb{R} \to \mathbb{R}$ associates to $x \in \mathbb{R}$ the maximum scaled energy obtainable by a path whose scaled journey from $(0,0)$ to $(0,1)$ passes through the point $(x,1/2)$. Developing tools of Brownian Gibbs analysis from [Ham16] and [CHH19], we prove an assertion of strong similarity of this profile for Brownian last passage percolation to Brownian motion of rate two on the unit-order scale. A sharp estimate on the rarity that two macroscopically different routes in the energy landscape offer energies close to the global maximum results. We prove robust assertions concerning modulus of continuity for the energy and geometry of scaled maximizing paths, that develop the results and approach of [HS20], delivering estimates valid on all scales above the microscopic. The geometry of excursions of near ground states about the maximizing path is investigated: indeed, we estimate the energetic shortfall of scaled paths forced to closely mimic the geometry of the maximizing route while remaining disjoint from it. We also provide bounds on the approximate gradient of the maximizing path, viewed as a function, ruling out sharp steep movement down to the microscopic scale. Our results find application in a companion study [GH20a] of the stability, and fragility, of last passage percolation under a dynamical perturbation.

math.PR↗

arXiv2020

Stability and chaos in dynamical last passage percolation

Many complex statistical mechanical models have intricate energy landscapes. The ground state, or lowest energy state, lies at the base of the deepest valley. In examples such as spin glasses and Gaussian polymers, there are many valleys; the abundance of near-ground states (at the base of valleys) indicates the phenomenon of chaos, under which the ground state alters profoundly when the model's disorder is slightly perturbed. In this article, we compute the critical exponent that governs the onset of chaos in a dynamic manifestation of a canonical model in the Kardar-Parisi-Zhang [KPZ] universality class, Brownian last passage percolation [LPP]. In this model in its static form, semi-discrete polymers advance through Brownian noise, their energy given by the integral of the white noise encountered along their journey. A ground state is a geodesic, of extremal energy given its endpoints. We perturb Brownian LPP by evolving the disorder under an Ornstein-Uhlenbeck flow. We prove that, for polymers of length $n$, a sharp phase transition marking the onset of chaos is witnessed at the critical time $n^{-1/3}$. Indeed, the overlap between the geodesics at times zero and $t > 0$ that travel a given distance of order $n$ will be shown to be of order $n$ when $t\ll n^{-1/3}$; and to be of smaller order when $t\gg n^{-1/3}$. We expect this exponent to be shared among many interface models. The present work thus sheds light on the dynamical aspect of the KPZ class; it builds on several recent advances. These include Chatterjee's harmonic analytic theory [Cha14] of equivalence of superconcentration and chaos in Gaussian spaces; a refined understanding of the static landscape geometry of Brownian LPP developed in the companion paper [GH20]; and, underlying the latter, strong comparison estimates of the geodesic energy profile to Brownian motion in [CHH19].

math.PR↗

arXiv2020

Interlacing and scaling exponents for the geodesic watermelon in last passage percolation

In discrete planar last passage percolation (LPP), random values are assigned independently to each vertex in $\mathbb Z^2$, and each finite upright path in $\mathbb Z^2$ is ascribed the weight given by the sum of values of its vertices. The weight of a collection of disjoint paths is the sum of its members' weights. The notion of a geodesic, a maximum weight path between two vertices, has a natural generalization concerning several disjoint paths: a $k$-geodesic watermelon in $[1,n]^2\cap\mathbb Z^2$ is a collection of $k$ disjoint paths contained in this square that has maximum weight among all such collections. While the weights of such collections are known to be important objects, the maximizing paths have been largely unexplored beyond the $k=1$ case. For exactly solvable models, such as exponential and geometric LPP, it is well known that for $k=1$ the exponents that govern fluctuation in weight and transversal distance are $1/3$ and $2/3$; that is, typically, the weight of the geodesic on the route $(1,1) \to (n,n)$ fluctuates around a dominant linear growth of the form $\mu n$ by the order of $n^{1/3}$; and the maximum Euclidean distance of the geodesic from the diagonal has order $n^{2/3}$. Assuming a strong but local form of convexity and one-point moderate deviation bounds for the geodesic weight profile---which are available in all known exactly solvable models---we establish that, typically, the $k$-geodesic watermelon's weight falls below $\mu nk$ by order $k^{5/3}n^{1/3}$, and its transversal fluctuation is of order $k^{1/3}n^{2/3}$. Our arguments crucially rely on, and develop, a remarkable deterministic interlacing property that the watermelons admit. Our methods also yield sharp rigidity estimates for naturally associated point processes, which improve on estimates obtained via tools from the theory of determinantal point processes available in the integrable setting.

math.PR↗

arXiv2019

Hausdorff dimensions for shared endpoints of disjoint geodesics in the directed landscape

Within the Kardar-Parisi-Zhang universality class, the space-time Airy sheet is conjectured to be the canonical scaling limit for last passage percolation models. In recent work arXiv:1812.00309 of Dauvergne, Ortmann, and Vir\'ag, this object was constructed and shown to be the limit after parabolic correction of one such model: Brownian last passage percolation. This limit object, called the directed landscape, admits geodesic paths between any two space-time points $(x,s)$ and $(y,t)$ with $s<t$. In this article, we examine fractal properties of the set of these paths. Our main results concern exceptional endpoints admitting disjoint geodesics. First, we fix two distinct starting locations $x_1$ and $x_2$, and consider geodesics traveling $(x_1,0)\to (y,1)$ and $(x_2,0)\to (y,1)$. We prove that the set of $y\in\mathbb{R}$ for which these geodesics coalesce only at time $1$ has Hausdorff dimension one-half. Second, we consider endpoints $(x,0)$ and $(y,1)$ between which there exist two geodesics intersecting only at times $0$ and $1$. We prove that the set of such $(x,y)\in\mathbb{R}^2$ also has Hausdorff dimension one-half. The proofs require several inputs of independent interest, including (i) connections to the so-called difference weight profile studied in arXiv:1904.01717; and (ii) a tail estimate on the number of disjoint geodesics starting and ending in small intervals. The latter result extends the analogous estimate proved for the prelimiting model in arXiv:1709.04110.

math.PR↗

arXiv2019

Brownian structure in the KPZ fixed point

Many models of one-dimensional local random growth are expected to lie in the Kardar-Parisi-Zhang (KPZ) universality class. For such a model, the interface profile at advanced time may be viewed in scaled coordinates specified via characteristic KPZ scaling exponents of one-third and two-thirds. When the long time limit of this scaled interface is taken, it is expected -- and proved for a few integrable models -- that, up to a parabolic shift, the Airy$_2$ process $\mathcal{A}:\mathbb{R} \to \mathbb{R}$ is obtained. This process may be embedded via the Robinson-Schensted-Knuth correspondence as the uppermost curve in an $\mathbb{N}$-indexed system of random continuous curves, the Airy line ensemble. Among our principal results is the assertion that the Airy$_2$ process enjoys a very strong similarity to Brownian motion $B$ (of rate two) on unit-order intervals; as a consequence, the Radon-Nikodym derivative of the law of $\mathcal{A}$ on say $[-1,1]$, with respect to the law of $B$ on this interval, lies in every $L^p$ space for $p \in (1,\infty)$. Our technique of proof harnesses a probabilistic resampling or {\em Brownian Gibbs} property satisfied by the Airy line ensemble after parabolic shift, and this article develops Brownian Gibbs analysis of this ensemble begun in [CH14] and pursued in [Ham19a]. Our Brownian comparison for scaled interface profiles is an element in the ongoing programme of studying KPZ universality via probabilistic and geometric methods of proof, aided by limited but essential use of integrable inputs. Indeed, the comparison result is a useful tool for studying this universality class. We present and prove several applications, concerning for example the structure of near ground states in Brownian last passage percolation, or Brownian structure in scaled interface profiles that arise from evolution from any element in a very general class of initial data.

math.PR↗

arXiv2019

KPZ equation correlations in time

We consider the narrow wedge solution to the Kardar-Parisi-Zhang stochastic PDE under the characteristic $3:2:1$ scaling of time, space and fluctuations. We study the correlation of fluctuations at two different times. We show that when the times are close to each other, the correlation approaches one at a power-law rate with exponent $2/3$, while when the two times are remote from each other, the correlation tends to zero at a power-law rate with exponent $-1/3$. We also prove exponential-type tail bounds for differences of the solution at two space-time points. Three main tools are pivotal to proving these results: 1) a representation for the two-time distribution in terms of two independent narrow wedge solutions; 2) the Brownian Gibbs property of the KPZ line ensemble; and 3) recently proved one-point tail bounds on the narrow wedge solution.

math.PR↗

arXiv2019

Fractal geometry of Airy_2 processes coupled via the Airy sheet

In last passage percolation models lying in the Kardar-Parisi-Zhang universality class, maximizing paths that travel over distances of order $n$ accrue energy that fluctuates on scale $n^{1/3}$; and these paths deviate from the linear interpolation of their endpoints on scale $n^{2/3}$. These maximizing paths and their energies may be viewed via a coordinate system that respects these scalings. What emerges by doing so is a system indexed by $x,y \in \mathbb{R}$ and $s,t \in \mathbb{R}$ with $s < t$ of unit order quantities $W_n\big( x,s ; y,t \big)$ specifying the scaled energy of the maximizing path that moves in scaled coordinates between $(x,s)$ and $(y,t)$. The space-time Airy sheet is, after a parabolic adjustment, the putative distributional limit $W_\infty$ of this system as $n \to \infty$. The Airy sheet has recently been constructed in [15] as such a limit of Brownian last passage percolation. In this article, we initiate the study of fractal geometry in the Airy sheet. We prove that the scaled energy difference profile given by $\mathbb{R} \to \mathbb{R}: z \to W_\infty \big( 1,0 ; z,1 \big) - W_\infty \big( -1,0 ; z,1 \big)$ is a non-decreasing process that is constant in a random neighbourhood of almost every $z \in \mathbb{R}$; and that the exceptional set of $z \in \mathbb{R}$ that violate this condition almost surely has Hausdorff dimension one-half. Points of violation correspond to special behaviour for scaled maximizing paths, and we prove the result by investigating this behaviour, making use of two inputs from recent studies of scaled Brownian LPP; namely, Brownian regularity of profiles, and estimates on the rarity of pairs of disjoint scaled maximizing paths that begin and end close to each other.

math.PR↗

arXiv2019

Modulus of continuity of polymer weight profiles in Brownian last passage percolation

In last passage percolation models lying in the KPZ universality class, the energy of long energy-maximizing paths may be studied as a function of the paths' pair of endpoint locations. Scaled coordinates may be introduced, so that these maximizing paths, or polymers, now cross unit distances with unit-order fluctuations, and have scaled energy, or weight, of unit order. In this article, we consider Brownian last passage percolation in these scaled coordinates. In the narrow wedge case, one endpoint of such polymers is fixed, say at $(0,0) \in \mathbb{R}^2$, and the other is varied horizontally, over $(z,1)$, $z \in \mathbb{R}$, so that the polymer weight profile may be studied as a function of $z \in \mathbb{R}$. This profile is known to manifest a one-half power law, having $1/2-$-Hölder continuity. The polymer weight profile may be defined beginning from a much more general initial condition. In this article, we present a more general assertion of this one-half power law, as well as a bound on the poly-logarithmic correction. For a very broad class of initial data, the polymer weight profile has a modulus of continuity of the order of $x^{1/2} \big( \log x^{-1} \big)^{2/3}$, with a high degree of uniformity in the scaling parameter and the initial condition.

math.PR↗

arXiv2019

Coagulation and diffusion: a probabilistic perspective on the Smoluchowski PDE

The Smoluchowski coagulation-diffusion PDE is a system of partial differential equations modelling the evolution in time of mass-bearing Brownian particles which are subject to short-range pairwise coagulation. This survey presents a fairly detailed exposition of the kinetic limit derivation of the Smoluchowski PDE from a microscopic model of many coagulating Brownian particles that was undertaken in [11]. It presents heuristic explanations of the form of the main theorem before discussing the proof, and presents key estimates in that proof using a novel probabilistic technique. The survey's principal aim is an exposition of this kinetic limit derivation, but it also contains an overview of several topics which either motivate or are motivated by this derivation.

math.PR↗

arXiv2018

Self-attracting self-avoiding walk

This article is concerned with self-avoiding walks (SAW) on $\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary SAW. Ueltschi has shown how to overcome these difficulties for sufficiently regular infinite-range step distributions and weak self-attractions. This article considers the case of bounded step distributions. For weak self-attractions we show that the connective constant exists, and, in $d\geq 5$, carry out a lace expansion analysis to prove the mean-field behaviour of the critical two-point function, hereby addressing a problem posed by den Hollander.

math.PR↗

arXiv2018

On self-avoiding polygons and walks: the snake method via polygon joining

For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks beginning at the origin in the integer lattice $\mathbb{Z}^d$, and write $Γ$ for a $\mathsf{W}_n$-distributed walk. We show that the closing probability $\mathsf{W}_n \big( \vert \vert Γ_n \vert \vert = 1 \big)$ that $Γ$'s endpoint neighbours the origin is at most $n^{-4/7 + o(1)}$ for a positive density set of odd $n$ in dimension $d = 2$. This result is proved using the snake method, a technique for proving closing probability upper bounds, which originated in [3] and was made explicit in [8]. Our conclusion is reached by applying the snake method in unison with a polygon joining technique whose use was initiated by Madras in [13].

math.PR↗