Wai-Tong Louis Fan
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
Wai-Tong Louis Fan has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- John Wakeley
Department of Organismic and Evolutionary Biology, Harvard University, Cambridge, MA 02138, USA
3 shared publications - Amarjit Budhiraja
Department of Statistics and Operations Research, University of North Carolina, Chapel Hill, USA
2 shared publications Dimitrios Diamantidis
Department of Mathematics, Indiana University, 831 E 3rd St, 47405, Bloomington, IN, USA
2 shared publications- Jinsu Kim
Department of Mathematics, Pohang University of Science Technology, Pohang 37673, Republic of Korea
2 shared publications - Zhen-Qing Chen
University of Washington, Seattle, USA
2 shared publications - Chaojie Yuan
Department of Mathematics, Indiana University, Bloomington, IN 47405 USA
1 shared publication
Latest Publications
- 27 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 25 (4) , 2538-2584
Boundary-Induced Slow Mixing for Markov Chains and Its Application to Stochastic Reaction Networks
Markov chains on the nonnegative quadrant of dimension [Formula: see text] are often used to model the stochastic dynamics of the number of [Formula: see text] entities, such as [Formula: see text] chemical species in stochastic reaction networks. The infinite state space poses technical challenges, and the boundary of the quadrant can have a dramatic effect on the long-term behavior of these Markov chains. For instance, the boundary can slow down the convergence speed of an ergodic Markov chain toward its stationary distribution due to the extinction or the lack of an entity. In this paper, we quantify this slowdown by establishing general criteria for a continuous-time Markov chain on the nonnegative integer grids to exhibit a power-law lower bound for its mixing time. The lower bound is of order [Formula: see text] for all initial states [Formula: see text] on a boundary face of the quadrant, where [Formula: see text] is characterized by the local behavior of the Markov chain near the boundary of the quadrant. We then verify the general criteria for a cyclic reaction network with two species and an arbitrary number of complexes under mass-action kinetics. A better understanding of how these lower bounds arise leads to insights into how the structure of chemical reaction networks contributes to slow mixing.
- 27 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 25 (4) , 2538-2584
Boundary-Induced Slow Mixing for Markov Chains and Its Application to Stochastic Reaction Networks
Markov chains on the nonnegative quadrant of dimension [Formula: see text] are often used to model the stochastic dynamics of the number of [Formula: see text] entities, such as [Formula: see text] chemical species in stochastic reaction networks. The infinite state space poses technical challenges, and the boundary of the quadrant can have a dramatic effect on the long-term behavior of these Markov chains. For instance, the boundary can slow down the convergence speed of an ergodic Markov chain toward its stationary distribution due to the extinction or the lack of an entity. In this paper, we quantify this slowdown by establishing general criteria for a continuous-time Markov chain on the nonnegative integer grids to exhibit a power-law lower bound for its mixing time. The lower bound is of order [Formula: see text] for all initial states [Formula: see text] on a boundary face of the quadrant, where [Formula: see text] is characterized by the local behavior of the Markov chain near the boundary of the quadrant. We then verify the general criteria for a cyclic reaction network with two species and an arbitrary number of complexes under mass-action kinetics. A better understanding of how these lower bounds arise leads to insights into how the structure of chemical reaction networks contributes to slow mixing.
- 11 December 2025
- Published by Elsevier in Theoretical Population Biology
- Vol. 167, 40-68
Correlation of coalescence times in a diploid Wright–Fisher model with recombination and selfing
- 11 December 2025
- Published by Elsevier in Theoretical Population Biology
- Vol. 167, 40-68
Correlation of coalescence times in a diploid Wright–Fisher model with recombination and selfing
- 7 July 2025
- Published by Elsevier in Theoretical Population Biology
- Vol. 165, 29-44
Conditional gene genealogies given the population pedigree for a diploid Moran model with selfing
- 7 July 2025
- Published by Elsevier in Theoretical Population Biology
- Vol. 165, 29-44
Conditional gene genealogies given the population pedigree for a diploid Moran model with selfing
- 15 May 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 24 (2) , 1668-1710
A New Path Method for Exponential Ergodicity of Markov Processes on \({{\mathbb Z^{d}}}\), with Applications to Stochastic Reaction NetworksThis paper provides a new path method that can be used to determine when an ergodic continuous-time Markov chain on [Formula: see text] converges exponentially fast to its stationary distribution in [Formula: see text]. Specifically, we provide general conditions that guarantee the positivity of the spectral gap. Importantly, our results do not require the assumption of time-reversibility of the Markov model. We then apply our new method to the well-studied class of stochastically modeled reaction networks. Notably, we show that each complex-balanced model that is also “open” has a positive spectral gap and is therefore exponentially ergodic. We further illustrate how our results can be applied for models that are not necessarily complex-balanced. Moreover, we provide an example of a detailed-balanced (in the sense of reaction network theory), and hence complex-balanced, stochastic reaction network that is not exponentially ergodic. We believe this to be the first such example in the literature.
- 15 May 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 24 (2) , 1668-1710
A New Path Method for Exponential Ergodicity of Markov Processes on \({{\mathbb Z^{d}}}\), with Applications to Stochastic Reaction NetworksThis paper provides a new path method that can be used to determine when an ergodic continuous-time Markov chain on [Formula: see text] converges exponentially fast to its stationary distribution in [Formula: see text]. Specifically, we provide general conditions that guarantee the positivity of the spectral gap. Importantly, our results do not require the assumption of time-reversibility of the Markov model. We then apply our new method to the well-studied class of stochastically modeled reaction networks. Notably, we show that each complex-balanced model that is also “open” has a positive spectral gap and is therefore exponentially ergodic. We further illustrate how our results can be applied for models that are not necessarily complex-balanced. Moreover, we provide an example of a detailed-balanced (in the sense of reaction network theory), and hence complex-balanced, stochastic reaction network that is not exponentially ergodic. We believe this to be the first such example in the literature.
- Open Access
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 30 (none) , 1-80
Intertwining the Busemann process of the directed polymer model
We study the Busemann process and competition interfaces of the planar directed polymer model with i.i.d. weights on the vertices of the planar square lattice, in both the general case and the solvable inverse-gamma case. We prove new regularity properties of the Busemann process without reliance on unproved assumptions on the shape function. For example, each nearest-neighbor Busemann function is strictly monotone and has the same random set of discontinuities in the direction variable. When all Busemann functions on a horizontal line are viewed together, the Busemann process intertwines with an evolution that obeys a version of the geometric Robinson–Schensted–Knuth correspondence. When specialized to the inverse-gamma case, this relationship enables an explicit distributional description: the Busemann function on a nearest-neighbor edge has independent increments in the direction variable, and its distribution comes from an inhomogeneous planar Poisson process. The distribution of the asymptotic competition interface direction of the inverse-gamma polymer is discrete and supported on the Busemann discontinuities which—unlike in zero-temperature last-passage percolation—are dense. Further implications follow for the eternal solutions and the failure of the one force–one solution principle of the discrete stochastic heat equation solved by the polymer partition function.
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 30 (none) , 1-80
Open AccessIntertwining the Busemann process of the directed polymer model
We study the Busemann process and competition interfaces of the planar directed polymer model with i.i.d. weights on the vertices of the planar square lattice, in both the general case and the solvable inverse-gamma case. We prove new regularity properties of the Busemann process without reliance on unproved assumptions on the shape function. For example, each nearest-neighbor Busemann function is strictly monotone and has the same random set of discontinuities in the direction variable. When all Busemann functions on a horizontal line are viewed together, the Busemann process intertwines with an evolution that obeys a version of the geometric Robinson–Schensted–Knuth correspondence. When specialized to the inverse-gamma case, this relationship enables an explicit distributional description: the Busemann function on a nearest-neighbor edge has independent increments in the direction variable, and its distribution comes from an inhomogeneous planar Poisson process. The distribution of the asymptotic competition interface direction of the inverse-gamma polymer is discrete and supported on the Busemann discontinuities which—unlike in zero-temperature last-passage percolation—are dense. Further implications follow for the eternal solutions and the failure of the one force–one solution principle of the discrete stochastic heat equation solved by the polymer partition function.
- Open Access
Correlation of coalescence times in a diploid Wright-Fisher model with recombination and selfing
The correlation among the gene genealogies at different loci is crucial in biology, yet challenging to understand because such correlation depends on many factors including genetic linkage, recombination, natural selection and population structure. Based on a diploid Wright-Fisher model with a single mating type and partial selfing for a constant large population with size N , we quantify the combined effect of genetic drift and two competing factors, recombination and selfing, on the correlation of coalescence times at two linked loci for samples of size two. Recombination decouples the genealogies at different loci and decreases the correlation while selfing increases the correlation. We obtain explicit asymptotic formulas for the correlation for four scaling scenarios that depend on whether the selfing probability and the recombination probability are of order O (1 /N ) or O (1) as N tends to infinity. Our analytical results confirm that the asymptotic lower bound in [King, Wakeley, Carmi (TPB 2018)] is sharp when the loci are unlinked and when there is no selfing, and provide a number of new formulas for other scaling scenarios that have not been considered before. We present asymptotic results for the variance of Tajima’s estimator of the population mutation rate for infinitely many loci as N tends to infinity. When the selfing probability is of order O (1) and is equal to a positive constant s for all N and if the samples at both loci are in the same individual, then the variance of the Tajima’s estimator tends to s/ 2 (hence remains positive) even when the recombination rate, the number of loci and the population size all tend to infinity.
Open AccessCorrelation of coalescence times in a diploid Wright-Fisher model with recombination and selfing
The correlation among the gene genealogies at different loci is crucial in biology, yet challenging to understand because such correlation depends on many factors including genetic linkage, recombination, natural selection and population structure. Based on a diploid Wright-Fisher model with a single mating type and partial selfing for a constant large population with size N , we quantify the combined effect of genetic drift and two competing factors, recombination and selfing, on the correlation of coalescence times at two linked loci for samples of size two. Recombination decouples the genealogies at different loci and decreases the correlation while selfing increases the correlation. We obtain explicit asymptotic formulas for the correlation for four scaling scenarios that depend on whether the selfing probability and the recombination probability are of order O (1 /N ) or O (1) as N tends to infinity. Our analytical results confirm that the asymptotic lower bound in [King, Wakeley, Carmi (TPB 2018)] is sharp when the loci are unlinked and when there is no selfing, and provide a number of new formulas for other scaling scenarios that have not been considered before. We present asymptotic results for the variance of Tajima’s estimator of the population mutation rate for infinitely many loci as N tends to infinity. When the selfing probability is of order O (1) and is equal to a positive constant s for all N and if the samples at both loci are in the same individual, then the variance of the Tajima’s estimator tends to s/ 2 (hence remains positive) even when the recombination rate, the number of loci and the population size all tend to infinity.
- Open Access
Latent mutations in the ancestries of alleles under selection
We consider a single genetic locus with two alleles A 1 and A 2 in a large haploid population. The locus is subject to selection and two-way, or recurrent, mutation. Assuming the allele frequencies follow a Wright-Fisher diffusion and have reached stationarity, we describe the asymptotic behaviors of the conditional gene genealogy and the latent mutations of a sample with known allele counts, when the count n 1 of allele A 1 is fixed, and when either or both the sample size n and the selection strength | α | tend to infinity. Our study extends previous work under neutrality to the case of non-neutral rare alleles, asserting that when selection is not too strong relative to the sample size, even if it is strongly positive or strongly negative in the usual sense ( α → −∞ or α → +∞), the number of latent mutations of the n 1 copies of allele A 1 follows the same distribution as the number of alleles in the Ewens sampling formula. On the other hand, very strong positive selection relative to the sample size leads to neutral gene genealogies with a single ancient latent mutation. We also demonstrate robustness of our asymptotic results against changing population sizes, when one of | α | or n is large.
Open AccessLatent mutations in the ancestries of alleles under selection
We consider a single genetic locus with two alleles A 1 and A 2 in a large haploid population. The locus is subject to selection and two-way, or recurrent, mutation. Assuming the allele frequencies follow a Wright-Fisher diffusion and have reached stationarity, we describe the asymptotic behaviors of the conditional gene genealogy and the latent mutations of a sample with known allele counts, when the count n 1 of allele A 1 is fixed, and when either or both the sample size n and the selection strength | α | tend to infinity. Our study extends previous work under neutrality to the case of non-neutral rare alleles, asserting that when selection is not too strong relative to the sample size, even if it is strongly positive or strongly negative in the usual sense ( α → −∞ or α → +∞), the number of latent mutations of the n 1 copies of allele A 1 follows the same distribution as the number of alleles in the Ewens sampling formula. On the other hand, very strong positive selection relative to the sample size leads to neutral gene genealogies with a single ancient latent mutation. We also demonstrate robustness of our asymptotic results against changing population sizes, when one of | α | or n is large.
- 27 April 2017
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 31 (3) , 1779-1818
Large Deviations for Brownian Particle Systems with Killing
- 27 April 2017
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 31 (3) , 1779-1818
Large Deviations for Brownian Particle Systems with Killing
- Open Access
Large Deviations for Brownian Particle Systems with Killing
Particle approximations for certain nonlinear and nonlocal reaction-diffusion equations are studied using a system of Brownian motions with killing. The system is described by a collection of i.i.d. Brownian particles where each particle is killed independently at a rate determined by the empirical sub-probability measure of the states of the particles alive. A large deviation principle (LDP) for such sub-probability measure-valued processes is established. Along the way a convenient variational representation, which is of independent interest, for expectations of nonnegative functionals of Brownian motions together with an i.i.d. sequence of random variables is established. Proof of the LDP relies on this variational representation and weak convergence arguments.
Open AccessLarge Deviations for Brownian Particle Systems with Killing
Particle approximations for certain nonlinear and nonlocal reaction-diffusion equations are studied using a system of Brownian motions with killing. The system is described by a collection of i.i.d. Brownian particles where each particle is killed independently at a rate determined by the empirical sub-probability measure of the states of the particles alive. A large deviation principle (LDP) for such sub-probability measure-valued processes is established. Along the way a convenient variational representation, which is of independent interest, for expectations of nonnegative functionals of Brownian motions together with an i.i.d. sequence of random variables is established. Proof of the LDP relies on this variational representation and weak convergence arguments.
- 21 June 2016
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 164 (4) , 890-936
Fluctuation Limit for Interacting Diffusions with Partial Annihilations Through Membranes
- 21 June 2016
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 164 (4) , 890-936
Fluctuation Limit for Interacting Diffusions with Partial Annihilations Through Membranes