Eugene Strahov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Eugene Strahov has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Gernot Akemann
Bielefeld University
11 shared publications - Sergey Berezin
Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden
3 shared publications - Alexei Borodin
Massachusetts Institute of Technology
2 shared publications - Tim R. Würfel
Faculty of Physics, Bielefeld University, Bielefeld, Germany
2 shared publications Alexei Borodin
Department of Mathematics, Massachusetts Institute of Technology, USA and Institute for Information Transmission Problems of Russian Academy of Sciences, Russia
1 shared publication- Dang-Zheng Liu
School of Mathematical Sciences, University of Science and Technology of China, Hefei, China
1 shared publication
Latest Publications
- Open Access
- 26 September 2026
- Published by Springer Nature in Annales Henri Poincare
- p. 1-47
Last-Passage Percolation and Product-Matrix Ensembles
We introduce and study a model of directed last-passage percolation in planar layered environment. This environment is represented by an array of random exponential clocks arranged in blocks, for each block the average waiting times depend only on the local coordinates within the block. The last-passage time, the total time needed to travel from the source to the sink located in a given block, maximized over all the admissible paths, becomes a stochastic process indexed by the number of blocks in the array. We show that this model is integrable, particularly the probability law of the last-passage time process can be determined via a Fredholm determinant of the kernel that also appears in the study of products of random matrices. Further, we identify the scaling limit of the last-passage time process, as the sizes of the blocks become infinitely large and the average waiting times become infinitely small. Finite-dimensional convergence to the continuous-time critical stochastic process of random matrix theory is established.
- 26 September 2026
- Published by Springer Nature in Annales Henri Poincare
- p. 1-47
Open AccessLast-Passage Percolation and Product-Matrix Ensembles
We introduce and study a model of directed last-passage percolation in planar layered environment. This environment is represented by an array of random exponential clocks arranged in blocks, for each block the average waiting times depend only on the local coordinates within the block. The last-passage time, the total time needed to travel from the source to the sink located in a given block, maximized over all the admissible paths, becomes a stochastic process indexed by the number of blocks in the array. We show that this model is integrable, particularly the probability law of the last-passage time process can be determined via a Fredholm determinant of the kernel that also appears in the study of products of random matrices. Further, we identify the scaling limit of the last-passage time process, as the sizes of the blocks become infinitely large and the average waiting times become infinitely small. Finite-dimensional convergence to the continuous-time critical stochastic process of random matrix theory is established.
- Open Access
Probability measures on families of partitions related to harmonic analysis on big wreath products
We construct generalized regular representations of the wreath product of a compact group with the infinite symmetric group. The characters of these representations are determined by probability measures on families of partitions called the $z$-measures for the wreath product of a compact group with the symmetric group in the present paper. Our main result is an explicit formula for these $z$-measures which holds true for an arbitrary compact group. The result enables us to describe the spectral measures of the generalized regular representations of big wreath products.
Open AccessProbability measures on families of partitions related to harmonic analysis on big wreath products
We construct generalized regular representations of the wreath product of a compact group with the infinite symmetric group. The characters of these representations are determined by probability measures on families of partitions called the $z$-measures for the wreath product of a compact group with the symmetric group in the present paper. Our main result is an explicit formula for these $z$-measures which holds true for an arbitrary compact group. The result enables us to describe the spectral measures of the generalized regular representations of big wreath products.
- Open Access
Last-passage percolation and product-matrix ensembles
We introduce and study a model of directed last-passage percolation in planar layered environment. This environment is represented by an array of random exponential clocks arranged in blocks, for each block the average waiting times depend only on the local coordinates within the block. The last-passage time, the total time needed to travel from the source to the sink located in a given block, maximized over all the admissible paths, becomes a stochastic process indexed by the number of blocks in the array. We show that this model is integrable, particularly the probability law of the last-passage time process can be determined via a Fredholm determinant of the kernel that also appears in the study of products of random matrices. Further, we identify the scaling limit of the last-passage time process, as the sizes of the blocks become infinitely large and the average waiting times become infinitely small. Finite-dimensional convergence to the continuous-time critical stochastic process of random matrix theory is established.
Open AccessLast-passage percolation and product-matrix ensembles
We introduce and study a model of directed last-passage percolation in planar layered environment. This environment is represented by an array of random exponential clocks arranged in blocks, for each block the average waiting times depend only on the local coordinates within the block. The last-passage time, the total time needed to travel from the source to the sink located in a given block, maximized over all the admissible paths, becomes a stochastic process indexed by the number of blocks in the array. We show that this model is integrable, particularly the probability law of the last-passage time process can be determined via a Fredholm determinant of the kernel that also appears in the study of products of random matrices. Further, we identify the scaling limit of the last-passage time process, as the sizes of the blocks become infinitely large and the average waiting times become infinitely small. Finite-dimensional convergence to the continuous-time critical stochastic process of random matrix theory is established.
- Open Access
- 17 February 2025
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 268 (1) , 439-500
Generalized regular representations of big wreath products
Let G be a finite group with k conjugacy classes, and S(∞) be the infinite symmetric group, i.e., the group of finite permutations of {1, 2, 3, …}. Then the wreath product G ∞ = G ∼ S (∞) of G with S (∞) (called the big wreath product) can be defined. The group G ∞ is a generalization of the infinite symmetric group, and it is an example of a “big” group, in Vershik’s terminology. For such groups the two-sided regular representations are irreducible, the conventional scheme of harmonic analysis is not applicable, and the problem of harmonic analysis is a nontrivial problem with connections to different areas of mathematics and mathematical physics. Harmonic analysis on the infinite symmetric group was developed in the works by Kerov, Olshanski, and Vershik, and Borodin and Olshanski. The goal of this paper is to extend this theory to the case of G ∞. In particular, we construct an analogue $${\frak{S}}_{G}$$ of the space of virtual permutations. We then formulate and prove a theorem characterizing all central probability measures on $${\frak{S}}_{G}$$ . Next, we introduce generalized regular representations $$\{T_{z_{1}},\cdots,z_{k} : z_{1}\in \mathbb{C},\cdots,z_{k}\in \mathbb{C}\}$$ of the big wreath product G ∞, which are analogues of the Kerov–Olshanski–Vershik generalized regular representations of the infinite symmetric group. We derive an explicit formula for the characters of $$T_{z_{1}},\cdots,z_{k}$$ . The spectral measures of these representations are characterized in different ways. In particular, these spectral measures are associated with point processes whose correlation functions are explicitly computed. Thus, in representation-theoretic terms, the paper solves a natural problem of harmonic analysis for the big wreath products: our results describe the decomposition of $$T_{z_{1}},\cdots,z_{k}$$ into irreducible components.- 17 February 2025
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 268 (1) , 439-500
Open AccessGeneralized regular representations of big wreath products
Let G be a finite group with k conjugacy classes, and S(∞) be the infinite symmetric group, i.e., the group of finite permutations of {1, 2, 3, …}. Then the wreath product G ∞ = G ∼ S (∞) of G with S (∞) (called the big wreath product) can be defined. The group G ∞ is a generalization of the infinite symmetric group, and it is an example of a “big” group, in Vershik’s terminology. For such groups the two-sided regular representations are irreducible, the conventional scheme of harmonic analysis is not applicable, and the problem of harmonic analysis is a nontrivial problem with connections to different areas of mathematics and mathematical physics. Harmonic analysis on the infinite symmetric group was developed in the works by Kerov, Olshanski, and Vershik, and Borodin and Olshanski. The goal of this paper is to extend this theory to the case of G ∞. In particular, we construct an analogue $${\frak{S}}_{G}$$ of the space of virtual permutations. We then formulate and prove a theorem characterizing all central probability measures on $${\frak{S}}_{G}$$ . Next, we introduce generalized regular representations $$\{T_{z_{1}},\cdots,z_{k} : z_{1}\in \mathbb{C},\cdots,z_{k}\in \mathbb{C}\}$$ of the big wreath product G ∞, which are analogues of the Kerov–Olshanski–Vershik generalized regular representations of the infinite symmetric group. We derive an explicit formula for the characters of $$T_{z_{1}},\cdots,z_{k}$$ . The spectral measures of these representations are characterized in different ways. In particular, these spectral measures are associated with point processes whose correlation functions are explicitly computed. Thus, in representation-theoretic terms, the paper solves a natural problem of harmonic analysis for the big wreath products: our results describe the decomposition of $$T_{z_{1}},\cdots,z_{k}$$ into irreducible components. - Open Access
Generalized regular representations of big wreath products
Let $G$ be a finite group with $k$ conjugacy classes, and $S(\infty)$ be the infinite symmetric group, i.e. the group of finite permutations of $\left\{1,2,3,\ldots\right\}$. Then the wreath product $G_{\infty}=G\sim S(\infty)$ of $G$ with $S(\infty)$ (called the big wreath product) can be defined. The group $G_{\infty}$ is a generalization of the infinite symmetric group, and it is an example of a ``big'' group, in Vershik's terminology. For such groups the two-sided regular representations are irreducible, the conventional scheme of harmonic analysis is not applicable, and the problem of harmonic analysis is a nontrivial problem with connections to different areas of mathematics and mathematical physics. Harmonic analysis on the infinite symmetric group was developed in the works by Kerov, Olshanski, and Vershik, and Borodin and Olshanski. The goal of this paper is to extend this theory to the case of $G_{\infty}$. In particular, we construct an analogue $\mathfrak{S}_{G}$ of the space of virtual permutations. We then formulate and prove a theorem characterizing all central probability measures on $\mathfrak{S}_{G}$, and introduce generalized regular representations $T_{z_1,\ldots,z_k}$ of the big wreath product $G_{\infty}$. The paper solves a natural problem of harmonic analysis for the big wreath products: our results describe the decomposition of $T_{z_1,\ldots,z_k}$ into irreducible components.Open AccessGeneralized regular representations of big wreath products
Let $G$ be a finite group with $k$ conjugacy classes, and $S(\infty)$ be the infinite symmetric group, i.e. the group of finite permutations of $\left\{1,2,3,\ldots\right\}$. Then the wreath product $G_{\infty}=G\sim S(\infty)$ of $G$ with $S(\infty)$ (called the big wreath product) can be defined. The group $G_{\infty}$ is a generalization of the infinite symmetric group, and it is an example of a ``big'' group, in Vershik's terminology. For such groups the two-sided regular representations are irreducible, the conventional scheme of harmonic analysis is not applicable, and the problem of harmonic analysis is a nontrivial problem with connections to different areas of mathematics and mathematical physics. Harmonic analysis on the infinite symmetric group was developed in the works by Kerov, Olshanski, and Vershik, and Borodin and Olshanski. The goal of this paper is to extend this theory to the case of $G_{\infty}$. In particular, we construct an analogue $\mathfrak{S}_{G}$ of the space of virtual permutations. We then formulate and prove a theorem characterizing all central probability measures on $\mathfrak{S}_{G}$, and introduce generalized regular representations $T_{z_1,\ldots,z_k}$ of the big wreath product $G_{\infty}$. The paper solves a natural problem of harmonic analysis for the big wreath products: our results describe the decomposition of $T_{z_1,\ldots,z_k}$ into irreducible components. - Open Access
Multiple Partition Structures and Harmonic Functions on Branching Graphs
We introduce and study multiple partition structures which are sequences of probability measures on families of Young diagrams subjected to a consistency condition. The multiple partition structures are generalizations of Kingman's partition structures, and are motivated by a problem of population genetics. They are related to harmonic functions and coherent systems of probability measures on a certain branching graph. The vertices of this graph are multiple Young diagrams (or multiple partitions), and the edges depend on the Jack parameter. Our main result establishes a bijective correspondence between the set of harmonic functions on the graph and probability measures on the generalized Thoma set. The correspondence is determined by a canonical integral representation of harmonic functions. As a consequence we obtain a representation theorem for multiple partition structures. We give an example of a multiple partition structure which is expected to be relevant for a model of population genetics for the genetic variation of a sample of gametes from a large population. Namely, we construct a probability measure on the wreath product of a finite group with the symmetric group. The constructed probability measure defines a multiple partition structure which is a generalization of the Ewens partition structure studied by Kingman. We show that this multiple partition structure can be represented in terms of a multiple analogue of the Poisson-Dirichlet distribution called the multiple Poisson-Dirichlet distribution in the paper.
Open AccessMultiple Partition Structures and Harmonic Functions on Branching Graphs
We introduce and study multiple partition structures which are sequences of probability measures on families of Young diagrams subjected to a consistency condition. The multiple partition structures are generalizations of Kingman's partition structures, and are motivated by a problem of population genetics. They are related to harmonic functions and coherent systems of probability measures on a certain branching graph. The vertices of this graph are multiple Young diagrams (or multiple partitions), and the edges depend on the Jack parameter. Our main result establishes a bijective correspondence between the set of harmonic functions on the graph and probability measures on the generalized Thoma set. The correspondence is determined by a canonical integral representation of harmonic functions. As a consequence we obtain a representation theorem for multiple partition structures. We give an example of a multiple partition structure which is expected to be relevant for a model of population genetics for the genetic variation of a sample of gametes from a large population. Namely, we construct a probability measure on the wreath product of a finite group with the symmetric group. The constructed probability measure defines a multiple partition structure which is a generalization of the Ewens partition structure studied by Kingman. We show that this multiple partition structure can be represented in terms of a multiple analogue of the Poisson-Dirichlet distribution called the multiple Poisson-Dirichlet distribution in the paper.
- Open Access
Gap probability for products of random matrices in the critical regime
The singular values of a product of $M$ independent Ginibre matrices of size $N\times N$ form a determinantal point process. Near the soft edge, as both $M$ and $N$ go to infinity in such a way that $M/N\to \alpha$, $\alpha>0$, a scaling limit emerges. We consider a gap probability for the corresponding limiting determinantal process, namely, the probability that there are no particles in the interval $(a,+\infty)$. We derive a Tracy-Widom-like formula in terms of the unique solution of a certain matrix Riemann-Hilbert problem of size $2 \times 2$. The right-tail asymptotics for this solution is obtained by the Deift-Zhou non-linear steepest descent analysis.Open AccessGap probability for products of random matrices in the critical regime
The singular values of a product of $M$ independent Ginibre matrices of size $N\times N$ form a determinantal point process. Near the soft edge, as both $M$ and $N$ go to infinity in such a way that $M/N\to \alpha$, $\alpha>0$, a scaling limit emerges. We consider a gap probability for the corresponding limiting determinantal process, namely, the probability that there are no particles in the interval $(a,+\infty)$. We derive a Tracy-Widom-like formula in terms of the unique solution of a certain matrix Riemann-Hilbert problem of size $2 \times 2$. The right-tail asymptotics for this solution is obtained by the Deift-Zhou non-linear steepest descent analysis. - Open Access
- 14 October 2020
- Published by Springer Nature in Annales Henri Poincare
- Vol. 21 (12) , 3973-4002
Averages of Products and Ratios of Characteristic Polynomials in Polynomial Ensembles
Polynomial ensembles are a sub-class of probability measures within determinantal point processes. Examples include products of independent random matrices, with applications to Lyapunov exponents, and random matrices with an external field, that may serve as schematic models of quantum field theories with temperature. We first analyse expectation values of ratios of an equal number of characteristic polynomials in general polynomial ensembles. Using Schur polynomials, we show that polynomial ensembles constitute Giambelli compatible point processes, leading to a determinant formula for such ratios as in classical ensembles of random matrices. In the second part, we introduce invertible polynomial ensembles given, e.g. by random matrices with an external field. Expectation values of arbitrary ratios of characteristic polynomials are expressed in terms of multiple contour integrals. This generalises previous findings by Fyodorov, Grela, and Strahov. for a single ratio in the context of eigenvector statistics in the complex Ginibre ensemble.
- 14 October 2020
- Published by Springer Nature in Annales Henri Poincare
- Vol. 21 (12) , 3973-4002
Open AccessAverages of Products and Ratios of Characteristic Polynomials in Polynomial Ensembles
Polynomial ensembles are a sub-class of probability measures within determinantal point processes. Examples include products of independent random matrices, with applications to Lyapunov exponents, and random matrices with an external field, that may serve as schematic models of quantum field theories with temperature. We first analyse expectation values of ratios of an equal number of characteristic polynomials in general polynomial ensembles. Using Schur polynomials, we show that polynomial ensembles constitute Giambelli compatible point processes, leading to a determinant formula for such ratios as in classical ensembles of random matrices. In the second part, we introduce invertible polynomial ensembles given, e.g. by random matrices with an external field. Expectation values of arbitrary ratios of characteristic polynomials are expressed in terms of multiple contour integrals. This generalises previous findings by Fyodorov, Grela, and Strahov. for a single ratio in the context of eigenvector statistics in the complex Ginibre ensemble.
- Open Access
Averages of products and ratios of characteristic polynomials in polynomial ensembles
Polynomial ensembles are a sub-class of probability measures within determinantal point processes. Examples include products of independent random matrices, with applications to Lyapunov exponents, and random matrices with an external field, that may serve as schematic models of quantum field theories with temperature. We first analyse expectation values of ratios of an equal number of characteristic polynomials in general polynomial ensembles. Using Schur polynomials we show that polynomial ensembles constitute Giambelli compatible point processes, leading to a determinant formula for such ratios as in classical ensembles of random matrices. In the second part we introduce invertible polynomial ensembles given e.g. by random matrices with an external field. Expectation values of arbitrary ratios of characteristic polynomials are expressed in terms of multiple contour integrals. This generalises previous findings by one of the authors for a single ratio in the context of eigenvector statistics in the complex Ginibre ensemble.
Open AccessAverages of products and ratios of characteristic polynomials in polynomial ensembles
Polynomial ensembles are a sub-class of probability measures within determinantal point processes. Examples include products of independent random matrices, with applications to Lyapunov exponents, and random matrices with an external field, that may serve as schematic models of quantum field theories with temperature. We first analyse expectation values of ratios of an equal number of characteristic polynomials in general polynomial ensembles. Using Schur polynomials we show that polynomial ensembles constitute Giambelli compatible point processes, leading to a determinant formula for such ratios as in classical ensembles of random matrices. In the second part we introduce invertible polynomial ensembles given e.g. by random matrices with an external field. Expectation values of arbitrary ratios of characteristic polynomials are expressed in terms of multiple contour integrals. This generalises previous findings by one of the authors for a single ratio in the context of eigenvector statistics in the complex Ginibre ensemble.
- Open Access
- 16 January 2019
- Published by Oxford University Press (OUP) in International Mathematics Research Notices
- Vol. 2020 (20) , 6713-6768
Product Matrix Processes as Limits of Random Plane Partitions
We consider a random process with discrete time formed by squared singular values of products of truncations of Haar-distributed unitary matrices. We show that this process can be understood as a scaling limit of the Schur process, which gives determinantal formulas for (dynamical) correlation functions and a contour integral representation for the correlation kernel. The relation with the Schur processes implies that the continuous limit of marginals for q-distributed plane partitions coincides with the joint law of squared singular values for products of truncations of Haar-distributed random unitary matrices. We provide structural reasons for this coincidence that may also extend to other classes of random matrices.
- 16 January 2019
- Published by Oxford University Press (OUP) in International Mathematics Research Notices
- Vol. 2020 (20) , 6713-6768
Open AccessProduct Matrix Processes as Limits of Random Plane Partitions
We consider a random process with discrete time formed by squared singular values of products of truncations of Haar-distributed unitary matrices. We show that this process can be understood as a scaling limit of the Schur process, which gives determinantal formulas for (dynamical) correlation functions and a contour integral representation for the correlation kernel. The relation with the Schur processes implies that the continuous limit of marginals for q-distributed plane partitions coincides with the joint law of squared singular values for products of truncations of Haar-distributed random unitary matrices. We provide structural reasons for this coincidence that may also extend to other classes of random matrices.