← Latest papers
🔢 mathematics

Inhomogeneous Geometric Last Passage Percolation and the qq-deformed Jacobi Unitary Ensemble

This paper investigates inhomogeneous geometric last passage percolation by establishing an exact link to the qq-deformed Jacobi unitary ensemble, thereby deriving explicit limit shapes and fluctuation limits governed by Airy or Bessel kernels depending on the inhomogeneity strength.

Original authors: Sung-Soo Byun, Yeong-Gwang Jung, Nick Simm

Published 2026-10-30
📖 4 min read🧠 Deep dive

Original authors: Sung-Soo Byun, Yeong-Gwang Jung, Nick Simm

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a vast grid of points, like a checkerboard stretching out in every direction. On each square of this board sits a number, a random weight that represents a cost or a delay. Now, picture a traveler who must move from the bottom-left corner to the top-right, stepping only up or to the right. The traveler's goal is to find the path where the sum of these numbers is as large as possible. This is a problem of last passage percolation, a mathematical model used to understand how things grow, spread, or accumulate over time. In a perfectly uniform world, where every square has the same statistical chance of holding a number, mathematicians have long known the rules of the game. They know exactly how the total sum grows and how it wobbles around that average. But the real world is rarely uniform. In nature, growth happens in messy, uneven environments where the rules change from place to place. When the landscape is uneven, the old rules break down, and the traveler's path becomes much harder to predict.

This is the challenge that Sung-Soo Byun, Yeong-Gwang Jung, and Nick Simm set out to solve. They studied a version of this traveler's journey where the random numbers on the grid are not the same everywhere. Instead, the likelihood of finding a large number depends on the location, creating a landscape that is either gently sloping or sharply concentrated near the starting point. The researchers wanted to know two things: what the average shape of the traveler's path would look like over a long distance, and how much the actual path would wiggle away from that average. To answer this, they did something unexpected. Instead of trying to track the traveler directly, they translated the entire problem into a different language: the language of random matrices.

Random matrices are grids of numbers where the entries are chosen at random, but they follow specific statistical laws. These matrices often appear in physics and number theory, and they have a special property: the numbers inside them, called eigenvalues, tend to arrange themselves in a very specific, predictable way. The authors discovered a precise, mathematical bridge connecting the traveler's journey on the uneven grid to the smallest number in a special family of these random matrices. This family is known as the q-deformed Jacobi unitary ensemble. By building this bridge, the researchers could use the powerful, well-understood tools of random matrix theory to solve the difficult problem of the uneven traveler's path.

The study revealed that the behavior of the traveler depends entirely on how strong the unevenness of the environment is. When the variation in the landscape is mild, the traveler's path fluctuates in a way that follows a pattern known as the Airy kernel. This is the same pattern seen in many other growing systems, suggesting a deep universality in how things expand in a slightly messy world. However, when the unevenness is extreme—when the weights are heavily concentrated right at the start—the behavior changes completely. In this strong inhomogeneity regime, the fluctuations follow a different pattern, governed by the Bessel kernel. This is a much rarer phenomenon, usually associated with boundaries or hard walls that stop growth. The researchers showed that the transition between these two behaviors is not a guess or a simulation, but a rigorous mathematical fact derived from their new connection between the two models.

Beyond just the traveler, the paper also uncovered new details about the random matrices themselves. The authors calculated the large-scale distribution of the numbers inside these matrices, finding a new shape that acts as a distorted version of a classic distribution known as the Wachter distribution. They also proved that the smallest number in these matrices behaves in the same two ways as the traveler: it follows the Airy pattern when the environment is mild, and the Bessel pattern when the environment is harsh. This work is significant because it provides one of the very few explicit formulas for how growth behaves in an uneven environment. It confirms that even when the rules of the game change across space, the underlying mathematics remains orderly and predictable, provided one knows how to look at it through the right lens. The findings offer a complete picture of how randomness and structure interact in a non-uniform world, turning a complex, messy problem into a clear, solvable equation.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →