Lenya Ryzhik
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Lenya Ryzhik has a total of 83 co-authors. Here are the top co-authors by number of shared publications:
- Tomasz Komorowski
Institute of Mathematics, Polish Academy of Sciences, Warsaw, Poland
20 shared publications - Alexander Kiselev
Department of Mathematics Duke University 90320 Durham NC USA
14 shared publications - Guillaume Bal
University of Chicago
12 shared publications - Alexei Novikov
Mathematics Department Penn State University 16802 University Park PA
10 shared publications - Alexander Dunlap
Department of Mathematics, Duke University, Durham, USA
9 shared publications - Cole Graham
University of Wisconsin–Madison, Madison, USA
6 shared publications
Latest Publications
- 16 July 2026
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 407 (8) , 177
Correction to: Stationary Solutions to the Stochastic Burgers Equation on the Line
- 16 July 2026
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 407 (8) , 177
Correction to: Stationary Solutions to the Stochastic Burgers Equation on the Line
- Open Access
- 25 May 2026
- Published by Springer Nature in Letters in Mathematical Physics
- Vol. 116 (3) , 59
A contact topological glossary for non-equilibrium thermodynamics
We discuss the occurrence of some notions and results from contact topology in non-equilibrium thermodynamics. This includes Reeb chords and the partial order on the space of Legendrian submanifolds.
- 25 May 2026
- Published by Springer Nature in Letters in Mathematical Physics
- Vol. 116 (3) , 59
Open AccessA contact topological glossary for non-equilibrium thermodynamics
We discuss the occurrence of some notions and results from contact topology in non-equilibrium thermodynamics. This includes Reeb chords and the partial order on the space of Legendrian submanifolds.
- 5 March 2026
- Published by World Scientific Pub Co Pte Ltd in Communications in Contemporary Mathematics
- Vol. 28 (05)
Mean field games without rational expectations
Mean Field Game (MFG) models implicitly assume “rational expectations”, meaning that the heterogeneous agents being modeled correctly know all relevant transition probabilities for the complex system they inhabit. When there is common noise, it becomes necessary to solve the “Master equation”, in which the infinite-dimensional density of agents is a state variable. The rational expectations assumption and the implication that agents solve Master equations are unrealistic in many applications. We show how to instead formulate MFGs with non-rational expectations. Departing from rational expectations is particularly relevant in “MFGs with a low-dimensional coupling”, i.e. MFGs in which agents’ running reward function depends on the density only through low-dimensional functionals of this density. This happens, for example, in most macroeconomics MFGs in which these low-dimensional functionals have the interpretation of “equilibrium prices”. In MFGs with a low-dimensional coupling, departing from rational expectations allows for completely sidestepping the Master equation and for instead solving much simpler finite-dimensional HJB equations. We introduce an adaptive learning model as a particular example of non-rational expectations and discuss its properties.
- 5 March 2026
- Published by World Scientific Pub Co Pte Ltd in Communications in Contemporary Mathematics
- Vol. 28 (05)
Mean field games without rational expectations
Mean Field Game (MFG) models implicitly assume “rational expectations”, meaning that the heterogeneous agents being modeled correctly know all relevant transition probabilities for the complex system they inhabit. When there is common noise, it becomes necessary to solve the “Master equation”, in which the infinite-dimensional density of agents is a state variable. The rational expectations assumption and the implication that agents solve Master equations are unrealistic in many applications. We show how to instead formulate MFGs with non-rational expectations. Departing from rational expectations is particularly relevant in “MFGs with a low-dimensional coupling”, i.e. MFGs in which agents’ running reward function depends on the density only through low-dimensional functionals of this density. This happens, for example, in most macroeconomics MFGs in which these low-dimensional functionals have the interpretation of “equilibrium prices”. In MFGs with a low-dimensional coupling, departing from rational expectations allows for completely sidestepping the Master equation and for instead solving much simpler finite-dimensional HJB equations. We introduce an adaptive learning model as a particular example of non-rational expectations and discuss its properties.
- Open Access
- 12 November 2025
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 157 (2) , 559-616
Voting models and tightness for a family of recursion equations
We consider recursion equations of the form u n +1 ( x ) = Q [ u n ]( x ), n ≥ 1, x ∈ ℝ, with a non-local operator Q [ u ] = g ( u * q ), where g is a polynomial, satisfying g (0) = 0, g (1) = 1, g ((0, 1)) ⊆ (0, 1), and q is a (compactly supported) probability density with * denoting convolution. Motivated by a line of works for nonlinear PDEs initiated by Etheridge, Freeman and Penington (2017), we show that for general g , a probabilistic model based on branching random walk can be given to the solution of the recursion, while in case g is also strictly monotone, a probabilistic threshold-based model can be given. In the latter case, we provide a conditional tightness result. We analyze in detail the bistable case and prove for it convergence of the solution shifted around a linear in n centering.
- 12 November 2025
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 157 (2) , 559-616
Open AccessVoting models and tightness for a family of recursion equations
We consider recursion equations of the form u n +1 ( x ) = Q [ u n ]( x ), n ≥ 1, x ∈ ℝ, with a non-local operator Q [ u ] = g ( u * q ), where g is a polynomial, satisfying g (0) = 0, g (1) = 1, g ((0, 1)) ⊆ (0, 1), and q is a (compactly supported) probability density with * denoting convolution. Motivated by a line of works for nonlinear PDEs initiated by Etheridge, Freeman and Penington (2017), we show that for general g , a probabilistic model based on branching random walk can be given to the solution of the recursion, while in case g is also strictly monotone, a probabilistic threshold-based model can be given. In the latter case, we provide a conditional tightness result. We analyze in detail the bistable case and prove for it convergence of the solution shifted around a linear in n centering.
- 25 November 2024
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 191 (12) , 1-36
Geometric Aspects of a Spin Chain
- 25 November 2024
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 191 (12) , 1-36
Geometric Aspects of a Spin Chain
- 4 October 2024
- Published by Springer Nature in Archive for Rational Mechanics and Analysis
- Vol. 248 (6) , 1-45
A Uniform Bound for Solutions to a Thermo-diffusive System
- 4 October 2024
- Published by Springer Nature in Archive for Rational Mechanics and Analysis
- Vol. 248 (6) , 1-45
A Uniform Bound for Solutions to a Thermo-diffusive System
- Open Access
Diffusion of knowledge and the lottery society
The Lucas-Moll system is a mean-field game type model describing the growth of an economy by means of diffusion of knowledge. The individual agents in the economy advance their knowledge by learning from each other and via internal innovation. Their cumulative distribution function satisfies a forward in time nonlinear non-local reaction-diffusion type equation. On the other hand, the learning strategy of the agents is based on the solution to a backward in time nonlocal Hamilton-Jacobi-Bellman equation that is coupled to the aforementioned equation for the agents density. Together, these equations form a system of the mean-field game type. When the learning rate is sufficiently large, existence of balanced growth path solutions to the Lucas-Moll system was proved in~\cite{PRV,Porretta-Rossi}. Here, we analyze a complementary regime where the balanced growth paths do not exist. The main result is a long time convergence theorem. Namely, the solution to the initial-terminal value problem behaves in such a way that at large times an overwhelming majority of the agents spend no time producing at all and are only learning. In particular, the agents density propagates at the Fisher-KPP speed. We name this type of solutions a lottery society.
Open AccessDiffusion of knowledge and the lottery society
The Lucas-Moll system is a mean-field game type model describing the growth of an economy by means of diffusion of knowledge. The individual agents in the economy advance their knowledge by learning from each other and via internal innovation. Their cumulative distribution function satisfies a forward in time nonlinear non-local reaction-diffusion type equation. On the other hand, the learning strategy of the agents is based on the solution to a backward in time nonlocal Hamilton-Jacobi-Bellman equation that is coupled to the aforementioned equation for the agents density. Together, these equations form a system of the mean-field game type. When the learning rate is sufficiently large, existence of balanced growth path solutions to the Lucas-Moll system was proved in~\cite{PRV,Porretta-Rossi}. Here, we analyze a complementary regime where the balanced growth paths do not exist. The main result is a long time convergence theorem. Namely, the solution to the initial-terminal value problem behaves in such a way that at large times an overwhelming majority of the agents spend no time producing at all and are only learning. In particular, the agents density propagates at the Fisher-KPP speed. We name this type of solutions a lottery society.
- Open Access
Branching Brownian motion with generation-dependent diffusivity and nonlocal partial differential equations
We study a voting model on a branching Brownian motion process on $\mathbb{R}$ in which the diffusivity of each child particle is increased from that of the parent by a factor of $γ>1$. The probability distribution of the overall vote is given in terms of the solution to a nonlocal nonlinear PDE. We exhibit conditions on the nonlinearity such that the long-time behavior of the distribution undergoes a phase transition in $γ$. If $γ$ is sufficiently large, then the long-time distribution converges to uniform. If $γ$ is close enough to $1$, then the long-time distribution depends in a nontrivial way on the location of the initial particle. The limiting dependence is given by a steady-state solution to the nonlocal PDE. Our study gives a probabilistic interpretation of a class of semilinear nonlocal PDEs. Interestingly, while the PDE are nonlocal, the underlying random process does not require any non-local interactions.Open AccessBranching Brownian motion with generation-dependent diffusivity and nonlocal partial differential equations
We study a voting model on a branching Brownian motion process on $\mathbb{R}$ in which the diffusivity of each child particle is increased from that of the parent by a factor of $γ>1$. The probability distribution of the overall vote is given in terms of the solution to a nonlocal nonlinear PDE. We exhibit conditions on the nonlinearity such that the long-time behavior of the distribution undergoes a phase transition in $γ$. If $γ$ is sufficiently large, then the long-time distribution converges to uniform. If $γ$ is close enough to $1$, then the long-time distribution depends in a nontrivial way on the location of the initial particle. The limiting dependence is given by a steady-state solution to the nonlocal PDE. Our study gives a probabilistic interpretation of a class of semilinear nonlocal PDEs. Interestingly, while the PDE are nonlocal, the underlying random process does not require any non-local interactions. - Open Access
- 18 December 2023
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 27 (5) , 2073-2154
Pushed, pulled and pushmi-pullyu fronts of the Burgers-FKPP equation
We consider the long time behavior of the solutions to the Burgers-FKPP equation with advection of a strength \beta\in\mathbb{R} . This equation exhibits a transition from pulled to pushed front behavior at \beta_{c}=2 . We prove convergence of the solutions to a traveling wave in a reference frame centered at a position m_{\beta}(t) and study the asymptotics of the front location m_{\beta}(t) . When \beta < 2 , it has the same form as for the standard Fisher-KPP equation established by Bramson: m_{\beta}(t) = 2t - (3/2)\log t + x_{\infty} + o(1) as t\to\infty . This form is typical of pulled fronts. When \beta > 2 , the front is located at the position m_{\beta}(t)=c_{*}(\beta)t+x_{\infty}+o(1) with c_{*}(\beta)=\beta/2+2/\beta , which is the typical form of pushed fronts. However, at the critical value \beta_{c} = 2 , the expansion changes to m_{\beta}(t) = 2t - (1/2)\log t + x_{\infty} + o(1) , reflecting the “pushmi-pullyu” nature of the front. The arguments for \beta2 relies on standard pushed front techniques. The proof in the case \beta=\beta_{c} is much more intricate and involves arguments not usually encountered in the study of the Bramson correction. It relies on a somewhat hidden viscous conservation law structure of the Burgers-FKPP equation at \beta_{c}=2 and utilizes a dissipation inequality, which comes from a relative entropy type computation, together with a weighted Nash inequality involving dynamically changing weights.
- 18 December 2023
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 27 (5) , 2073-2154
Open AccessPushed, pulled and pushmi-pullyu fronts of the Burgers-FKPP equation
We consider the long time behavior of the solutions to the Burgers-FKPP equation with advection of a strength \beta\in\mathbb{R} . This equation exhibits a transition from pulled to pushed front behavior at \beta_{c}=2 . We prove convergence of the solutions to a traveling wave in a reference frame centered at a position m_{\beta}(t) and study the asymptotics of the front location m_{\beta}(t) . When \beta < 2 , it has the same form as for the standard Fisher-KPP equation established by Bramson: m_{\beta}(t) = 2t - (3/2)\log t + x_{\infty} + o(1) as t\to\infty . This form is typical of pulled fronts. When \beta > 2 , the front is located at the position m_{\beta}(t)=c_{*}(\beta)t+x_{\infty}+o(1) with c_{*}(\beta)=\beta/2+2/\beta , which is the typical form of pushed fronts. However, at the critical value \beta_{c} = 2 , the expansion changes to m_{\beta}(t) = 2t - (1/2)\log t + x_{\infty} + o(1) , reflecting the “pushmi-pullyu” nature of the front. The arguments for \beta2 relies on standard pushed front techniques. The proof in the case \beta=\beta_{c} is much more intricate and involves arguments not usually encountered in the study of the Bramson correction. It relies on a somewhat hidden viscous conservation law structure of the Burgers-FKPP equation at \beta_{c}=2 and utilizes a dissipation inequality, which comes from a relative entropy type computation, together with a weighted Nash inequality involving dynamically changing weights.
- Open Access
Voting models and tightness for a family of recursion equations
We consider recursion equations of the form $u_{n+1}(x)=Q[u_n](x),~n\ge 1,~x\in R$, with a non-local operator $Q[u](x)= g( u\ast q)$, where $g$ is a polynomial, satisfying $g(0)=0$, $g(1)=1$, $g((0,1)) \subseteq (0,1)$, and $q$ is a (compactly supported) probability density with $\ast$ denoting convolution. Motivated by a line of works for nonlinear PDEs initiated by Etheridge, Freeman and Penington (2017), we show that for general $g$, a probabilistic model based on branching random walk can be given to the solution of the recursion, while in case $g$ is also strictly monotone, a probabilistic threshold-based model can be given. In the latter case, we provide a conditional tightness result. We analyze in detail the bistable case and prove for it convergence of the solution shifted around a linear in $n$ centering.Open AccessVoting models and tightness for a family of recursion equations
We consider recursion equations of the form $u_{n+1}(x)=Q[u_n](x),~n\ge 1,~x\in R$, with a non-local operator $Q[u](x)= g( u\ast q)$, where $g$ is a polynomial, satisfying $g(0)=0$, $g(1)=1$, $g((0,1)) \subseteq (0,1)$, and $q$ is a (compactly supported) probability density with $\ast$ denoting convolution. Motivated by a line of works for nonlinear PDEs initiated by Etheridge, Freeman and Penington (2017), we show that for general $g$, a probabilistic model based on branching random walk can be given to the solution of the recursion, while in case $g$ is also strictly monotone, a probabilistic threshold-based model can be given. In the latter case, we provide a conditional tightness result. We analyze in detail the bistable case and prove for it convergence of the solution shifted around a linear in $n$ centering.