James B. Martin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
James B. Martin has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Alexander E. Holroyd
Microsoft Research
3 shared publications - Arvind Ayyer
Department of Mathematics, Indian Institute of Science, Bangalore, India
3 shared publications - Pablo Augusto Ferrari
Universidad de Buenos Aires and IMAS-UBA-CONICET 1 , Buenos Aires
3 shared publications - Alexander E. Holroyd
University of Washington, Seattle, USA
2 shared publications - Ben Hambly
University of Oxford
2 shared publications - Erik Bates
Department of Mathematics North Carolina State University
2 shared publications
Latest Publications
- Open Access
- 22 July 2026
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 196 (5-6) , 2609-2674
Permutation invariance in last-passage percolation and the distribution of the Busemann process
In i.i.d. exponential last-passage percolation, we describe the joint distribution of Busemann functions, over all edges and over all directions, in terms of a joint last-passage problem in a finite inhomogeneous environment. More specifically, the Busemann increments within a $$k\times \ell $$ grid, and associated to d different directions, are equal in distribution to a particular collection of last-passage increments inside a $$(k+d-1)\times (\ell +d-1)$$ grid. The joint Busemann distribution was previously described along a horizontal line by Fan and the fourth author, using certain queueing maps. By contrast, our new description explicitly gives the joint distribution for any collection of edges (not just along a horizontal line) using only finitely many random variables. Our result thus provides an exact and accessible way to sample from the joint distribution. In the proof, we rely on one-directional marginal distributions of the inhomogeneous Busemann functions recently studied by Janjigian and the second and fourth authors. The second ingredient of our proof is a novel joint invariance of inhomogeneous last-passage times under permutations of the inhomogeneity parameters. Our proof of the invariance is different from earlier proofs of such results, using the Burke property instead of the RSK correspondence, and leading to an explicit coupling of the weights before and after the permutation of the parameters.- 22 July 2026
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 196 (5-6) , 2609-2674
Open AccessPermutation invariance in last-passage percolation and the distribution of the Busemann process
In i.i.d. exponential last-passage percolation, we describe the joint distribution of Busemann functions, over all edges and over all directions, in terms of a joint last-passage problem in a finite inhomogeneous environment. More specifically, the Busemann increments within a $$k\times \ell $$ grid, and associated to d different directions, are equal in distribution to a particular collection of last-passage increments inside a $$(k+d-1)\times (\ell +d-1)$$ grid. The joint Busemann distribution was previously described along a horizontal line by Fan and the fourth author, using certain queueing maps. By contrast, our new description explicitly gives the joint distribution for any collection of edges (not just along a horizontal line) using only finitely many random variables. Our result thus provides an exact and accessible way to sample from the joint distribution. In the proof, we rely on one-directional marginal distributions of the inhomogeneous Busemann functions recently studied by Janjigian and the second and fourth authors. The second ingredient of our proof is a novel joint invariance of inhomogeneous last-passage times under permutations of the inhomogeneity parameters. Our proof of the invariance is different from earlier proofs of such results, using the Burke property instead of the RSK correspondence, and leading to an explicit coupling of the weights before and after the permutation of the parameters. - Open Access
Permutation invariance in last-passage percolation and the distribution of the Busemann process
In i.i.d. exponential last-passage percolation, we describe the joint distribution of Busemann functions, over all edges and over all directions, in terms of a joint last-passage problem in a finite inhomogeneous environment. More specifically, the Busemann increments within a $k\times\ell$ grid, and associated to $d$ different directions, are equal in distribution to a particular collection of last-passage increments inside a $(k+d-1)\times(\ell+d-1)$ grid. The joint Busemann distribution was previously described along a horizontal line by Fan and the fourth author, using certain queuing maps. By contrast, our new description explicitly gives the joint distribution for any collection of edges (not just along a horizontal line) using only finitely many random variables. Our result thus provides an exact and accessible way to sample from the joint distribution. In the proof, we rely on one-directional marginal distributions of the inhomogeneous Busemann functions recently studied by Janjigian and the second and fourth authors. Another innovation of our argument is a joint invariance of inhomogeneous last-passage times under permutation of the inhomogeneity parameters. This result does not appear to be contained among the last-passage invariances recently described by Dauvergne. Our proof of invariance is also rather different, using the Burke property instead of the RSK correspondence, and leading to an explicit coupling of the weights before and after the permutation of the parameters.Open AccessPermutation invariance in last-passage percolation and the distribution of the Busemann process
In i.i.d. exponential last-passage percolation, we describe the joint distribution of Busemann functions, over all edges and over all directions, in terms of a joint last-passage problem in a finite inhomogeneous environment. More specifically, the Busemann increments within a $k\times\ell$ grid, and associated to $d$ different directions, are equal in distribution to a particular collection of last-passage increments inside a $(k+d-1)\times(\ell+d-1)$ grid. The joint Busemann distribution was previously described along a horizontal line by Fan and the fourth author, using certain queuing maps. By contrast, our new description explicitly gives the joint distribution for any collection of edges (not just along a horizontal line) using only finitely many random variables. Our result thus provides an exact and accessible way to sample from the joint distribution. In the proof, we rely on one-directional marginal distributions of the inhomogeneous Busemann functions recently studied by Janjigian and the second and fourth authors. Another innovation of our argument is a joint invariance of inhomogeneous last-passage times under permutation of the inhomogeneity parameters. This result does not appear to be contained among the last-passage invariances recently described by Dauvergne. Our proof of invariance is also rather different, using the Burke property instead of the RSK correspondence, and leading to an explicit coupling of the weights before and after the permutation of the parameters. - 13 September 2024
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 308 (2) , 1-45
Modified Macdonald polynomials and the multispecies zero range process: II
- 13 September 2024
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 308 (2) , 1-45
Modified Macdonald polynomials and the multispecies zero range process: II
- Open Access
The inhomogeneous $t$-PushTASEP and Macdonald polynomials
We study a multispecies $t$-PushTASEP system on a finite ring of $n$ sites with site-dependent rates $x_1,\dots,x_n$. Let $λ=(λ_1,\dots,λ_n)$ be a partition whose parts represent the species of the $n$ particles on the ring. We show that for each composition $η$ obtained by permuting the parts of $λ$, the stationary probability of being in state $η$ is proportional to the ASEP polynomial $F_η(x_1,\dots,x_n; q,t)$ at $q=1$; the normalizing constant (or partition function) is the Macdonald polynomial $P_λ(x_1,\dots,x_n;q,t)$ at $q=1$. Our approach involves new relations between the families of ASEP polynomials and of non-symmetric Macdonald polynomials at $q=1$. We also use multiline diagrams, showing that a single jump of the PushTASEP system is closely related to the operation of moving from one line to the next in a multiline diagram. We derive symmetry properties for the system under permutation of its jump rates, as well as a formula for the current of a single-species system.Open AccessThe inhomogeneous $t$-PushTASEP and Macdonald polynomials
We study a multispecies $t$-PushTASEP system on a finite ring of $n$ sites with site-dependent rates $x_1,\dots,x_n$. Let $λ=(λ_1,\dots,λ_n)$ be a partition whose parts represent the species of the $n$ particles on the ring. We show that for each composition $η$ obtained by permuting the parts of $λ$, the stationary probability of being in state $η$ is proportional to the ASEP polynomial $F_η(x_1,\dots,x_n; q,t)$ at $q=1$; the normalizing constant (or partition function) is the Macdonald polynomial $P_λ(x_1,\dots,x_n;q,t)$ at $q=1$. Our approach involves new relations between the families of ASEP polynomials and of non-symmetric Macdonald polynomials at $q=1$. We also use multiline diagrams, showing that a single jump of the PushTASEP system is closely related to the operation of moving from one line to the next in a multiline diagram. We derive symmetry properties for the system under permutation of its jump rates, as well as a formula for the current of a single-species system. - Open Access
- 1 January 2023
- Published by Institute of Mathematical Statistics in Electronic Communications in Probability
- Vol. 28 (none) , 1-13
The Foata–Fuchs proof of Cayley’s formula, and its probabilistic uses
We present a very simple bijective proof of Cayley’s formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive probabilistic identities, bounds, and growth procedures for random trees with given degrees, including random d-ary trees. We also introduce a partial order on the degree sequences of rooted trees, and conjecture that it induces a stochastic partial order on heights of random rooted trees with given degrees.
- 1 January 2023
- Published by Institute of Mathematical Statistics in Electronic Communications in Probability
- Vol. 28 (none) , 1-13
Open AccessThe Foata–Fuchs proof of Cayley’s formula, and its probabilistic uses
We present a very simple bijective proof of Cayley’s formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive probabilistic identities, bounds, and growth procedures for random trees with given degrees, including random d-ary trees. We also introduce a partial order on the degree sequences of rooted trees, and conjecture that it induces a stochastic partial order on heights of random rooted trees with given degrees.
- Open Access
The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive probabilistic identities, bounds, and growth procedures for random trees with given degrees, including random d-ary trees. We also introduce a partial order on the degree sequences of rooted trees, and conjecture that it induces a stochastic partial order on heights of random rooted trees with given degrees.
Open AccessThe Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive probabilistic identities, bounds, and growth procedures for random trees with given degrees, including random d-ary trees. We also introduce a partial order on the degree sequences of rooted trees, and conjecture that it induces a stochastic partial order on heights of random rooted trees with given degrees.
- Open Access
Modified Macdonald polynomials and the multispecies zero range process: I
In this paper we prove a new combinatorial formula for the modified Macdonald polynomials $\widetilde{H}_\lambda(X;q,t)$, motivated by connections to the theory of interacting particle systems from statistical mechanics. The formula involves a new statistic called queue inversions on fillings of tableaux. This statistic is closely related to the multiline queues which were recently used to give a formula for the Macdonald polynomials $P_\lambda(X;q,t)$. In the case $q=1$ and $X=(1,1,\dots,1)$, that formula had also been shown to compute stationary probabilities for a particle system known as the multispecies ASEP on a ring, and it is natural to ask whether a similar connection exists between the modified Macdonald polynomials and a suitable statistical mechanics model. In a sequel to this work, we demonstrate such a connection, showing that the stationary probabilities of the multispecies totally asymmetric zero-range process (mTAZRP) on a ring can be computed using tableaux formulas with the queue inversion statistic. This connection extends to arbitrary $X=(x_1,\dots, x_n)$; the $x_i$ play the role of site-dependent jump rates for the mTAZRP.Open AccessModified Macdonald polynomials and the multispecies zero range process: I
In this paper we prove a new combinatorial formula for the modified Macdonald polynomials $\widetilde{H}_\lambda(X;q,t)$, motivated by connections to the theory of interacting particle systems from statistical mechanics. The formula involves a new statistic called queue inversions on fillings of tableaux. This statistic is closely related to the multiline queues which were recently used to give a formula for the Macdonald polynomials $P_\lambda(X;q,t)$. In the case $q=1$ and $X=(1,1,\dots,1)$, that formula had also been shown to compute stationary probabilities for a particle system known as the multispecies ASEP on a ring, and it is natural to ask whether a similar connection exists between the modified Macdonald polynomials and a suitable statistical mechanics model. In a sequel to this work, we demonstrate such a connection, showing that the stationary probabilities of the multispecies totally asymmetric zero-range process (mTAZRP) on a ring can be computed using tableaux formulas with the queue inversion statistic. This connection extends to arbitrary $X=(x_1,\dots, x_n)$; the $x_i$ play the role of site-dependent jump rates for the mTAZRP. - Open Access
- 7 May 2021
- Published by Wiley in Random Structures & Algorithms
- Vol. 59 (4) , 495-521
Galton–Watson games
- 7 May 2021
- Published by Wiley in Random Structures & Algorithms
- Vol. 59 (4) , 495-521
Open AccessGalton–Watson games
- Open Access
Stationary distributions of the multi-type ASEP
We give a recursive construction of the stationary distribution of multi-type asymmetric simple exclusion processes on a finite ring or on the infinite line $Z$. The construction can be interpreted in terms of "multi-line diagrams" or systems of queues in tandem. Let $q$ be the asymmetry parameter of the system. The queueing construction generalises the one previously known for the totally asymmetric ($q=0$) case, by introducing queues in which each potential service is unused with probability $q^k$ when the queue-length is $k$. The analysis is based on the matrix product representation of Prolhac, Evans and Mallick. Consequences of the construction include: a simple method for sampling exactly from the stationary distribution for the system on a ring; results on common denominators of the stationary probabilities, expressed as rational functions of $q$ with non-negative integer coefficients; and probabilistic descriptions of "convoy formation" phenomena in large systems.Open AccessStationary distributions of the multi-type ASEP
We give a recursive construction of the stationary distribution of multi-type asymmetric simple exclusion processes on a finite ring or on the infinite line $Z$. The construction can be interpreted in terms of "multi-line diagrams" or systems of queues in tandem. Let $q$ be the asymmetry parameter of the system. The queueing construction generalises the one previously known for the totally asymmetric ($q=0$) case, by introducing queues in which each potential service is unused with probability $q^k$ when the queue-length is $k$. The analysis is based on the matrix product representation of Prolhac, Evans and Mallick. Consequences of the construction include: a simple method for sampling exactly from the stationary distribution for the system on a ring; results on common denominators of the stationary probabilities, expressed as rational functions of $q$ with non-negative integer coefficients; and probabilistic descriptions of "convoy formation" phenomena in large systems. - 6 December 2019
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 29 (3) , 455-484
Minimax functions on Galton–Watson trees
We consider the behaviour of minimax recursions defined on random trees. Such recursions give the value of a general class of two-player combinatorial games. We examine in particular the case where the tree is given by a Galton–Watson branching process, truncated at some depth 2n, and the terminal values of the level 2n nodes are drawn independently from some common distribution. The case of a regular tree was previously considered by Pearl, who showed that as n → ∞ the value of the game converges to a constant, and by Ali Khan, Devroye and Neininger, who obtained a distributional limit under a suitable rescaling.For a general offspring distribution, there is a surprisingly rich variety of behaviour: the (unrescaled) value of the game may converge to a constant, or to a discrete limit with several atoms, or to a continuous distribution. We also give distributional limits under suitable rescalings in various cases.We also address questions of endogeny. Suppose the game is played on a tree with many levels, so that the terminal values are far from the root. To be confident of playing a good first move, do we need to see the whole tree and its terminal values, or can we play close to optimally by inspecting just the first few levels of the tree? The answers again depend in an interesting way on the offspring distribution.We also mention several open questions.
- 6 December 2019
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 29 (3) , 455-484
Minimax functions on Galton–Watson trees
We consider the behaviour of minimax recursions defined on random trees. Such recursions give the value of a general class of two-player combinatorial games. We examine in particular the case where the tree is given by a Galton–Watson branching process, truncated at some depth 2n, and the terminal values of the level 2n nodes are drawn independently from some common distribution. The case of a regular tree was previously considered by Pearl, who showed that as n → ∞ the value of the game converges to a constant, and by Ali Khan, Devroye and Neininger, who obtained a distributional limit under a suitable rescaling.For a general offspring distribution, there is a surprisingly rich variety of behaviour: the (unrescaled) value of the game may converge to a constant, or to a discrete limit with several atoms, or to a continuous distribution. We also give distributional limits under suitable rescalings in various cases.We also address questions of endogeny. Suppose the game is played on a tree with many levels, so that the terminal values are far from the root. To be confident of playing a good first move, do we need to see the whole tree and its terminal values, or can we play close to optimally by inspecting just the first few levels of the tree? The answers again depend in an interesting way on the offspring distribution.We also mention several open questions.