Search

Given a family of rotationally symmetric compact manifolds indexed by the dimension and a weight function, the goal of this paper is to investigate the cut-off phenomenon for the Brownian motions on this family. We provide a class of compact manifolds with non-negative Ricci curvatures for which the cut-off in separation with windows occurs, in high dimension, with different explicit mixing times. We also produce counter-examples, still with non-negative Ricci curvatures, where there are no cut-off in separation. In fact we show a phase transition for the cut-off phenomenon concerning the Brownian motions on a rotationally symmetric compact manifolds. Our proof is based on a previous construction of a sharp strong stationary times by the authors, and some quantitative estimates on the two first moments of the covering time of the dual process. The concentration of measure phenomenon for the above family of manifolds appears to be relevant for the study of the corresponding cut-off.

Consider the global optimisation of a function $U$ defined on a finite set $V$ endowed with an irreducible and reversible Markov generator.By integration, we extend $U$ to the set $\mathcal{P}(V)$ of probability distributions on $V$ and we penalise it with a time-dependent generalised entropy functional.Endowing $\mathcal{P}(V)$ with a Maas' Wasserstein-type Riemannian structure, enables us to consider an associated time-inhomogeneous gradient descent algorithm.There are several ways to interpret this $\cP(V)$-valued dynamical system as the time-marginal laws of a time-inhomogeneous non-linear Markov process taking values in $V$, each of them allowing for interacting particle approximations.This procedure extends to the discrete framework the continuous state space swarm algorithm approach of Bolte, Miclo and Villeneuve \cite{Bolte}, but here we go further by considering more general generalised entropy functionals for which functional inequalities can be proven.Thus in the full generality of the above finite framework, we give conditions on the underlying time dependence ensuring the convergence of the algorithm toward laws supported by the set of global minima of $U$.Numerical simulations illustrate that one has to be careful about the choice of the time-inhomogeneous non-linear Markov process interpretation.

A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the spreading or mixing rate of random walks on graphs. In this expository paper, inspired by a blog post by Terence Tao, we describe a particular perspective on this question that derives quantum walks from the discrete wave equation on graphs. This yields a description of the quantum walk dynamics as simply applying a Chebyshev polynomial to the random walk transition matrix. This perspective decouples the problem from its quantum origin, and highlights connections to earlier (non-quantum) work and the use of Chebyshev polynomials in random walk theory as in the Varopoulos-Carne bound. We illustrate the approach by proving a weak limit of the quantum walk dynamics on the lattice. This gives a different proof of the quadratically improved spreading behavior of quantum walks on lattices.

Let $U$ be a Morse function on a compact connected $m$-dimensional Riemannian manifold, $m \geq 2,$ satisfying $\min U=0$ and let $\mathcal{U} = \{x \in M \: : U(x) = 0\}$ be the set of global minimizers. Consider the stochastic algorithm $X^{(\beta)}:=(X^{(\beta)}(t))_{t\geq 0}$ defined on $N = M \setminus \mathcal{U},$ whose generator is$U \Delta \cdot-\beta\langle \nabla U,\nabla \cdot\rangle$, where $\beta\in\RR$ is a real parameter.We show that for $\beta>\frac{m}{2}-1,$ $X^{(\beta)}(t)$ converges a.s.\ as $t \rightarrow \infty$, toward a point $p \in \mathcal{U}$ and that each $p \in \mathcal{U}$ has a positive probability to be selected. On the other hand, for $\beta < \frac{m}{2}-1,$ the law of $(X^{(\beta)}(t))$ converges in total variation (at an exponential rate) toward the probability measure $\pi_{\beta}$ having density proportional to $U(x)^{-1-\beta}$ with respect to the Riemannian measure.

For $N\in\mathbb{N}$, let $\pi_N$ be the law of the number of fixed points of a random permutation of $\{1, 2, ..., N\}$. Let $\mathcal{P}$ be a Poisson law of parameter 1.A classical result shows that $\pi_N$ converges to $\mathcal{P}$ for large $N$ and indeed in total variation $$\left\Vert \pi_N-\mathcal{P}\right\Vert_{\mathrm{tv}} \leq \frac{2^N}{(N+1)!}$$ This implies that $\pi_N$ and $\mathcal{P}$ can be coupled to at least this accuracy. This paper constructs such a coupling (a long open problem) using the machinery of intertwining of two Markov chains. This method shows promise for related problems of random matrix theory.

We investigate renormalized curvature flow (RCF) and stochastic renormalized curvature flow (SRCF) for convex sets in the plane.RCF is the gradient descent flow for logarithm of $\sigma/\lambda^2$ where $\sigma$ is the perimeter and $\lambda$ is the volume. SRCF is RCF perturbated by a Brownian noise and has the remarkable property that it can be intertwined with the Brownian motion, yielding a generalization of Pitman "2M-X" theorem. We prove that along RCF, entropy $\mathcal{E}_t$ for curvature as well as $h_t:=\sigma_t/\lambda_t$ are non-increasing. We deduce infinite lifetime and convergence to a disk after normalization.For SRCF the situation is more complicated. The process $(h_t)_t$ is always a supermartingale. For $(\mathcal{E}_t)_t$ to be a supermartingale, we need that the starting set is invariant by the isometry group $G_n$ generated by the reflection with respect to the vertical line and the rotation of angle $2\pi/n$ with $n\ge 3$. But for proving infinite lifetime, we need invariance of the starting set by $G_n$ with $n\ge 7$. We provide the first SRCF with infinite lifetime which cannot be reduced to a finite dimensional flow. Gage inequality plays a major role in our study of the regularity of flows, as well as a careful investigation of morphological skeletons. We characterize symmetric convex sets with star shaped skeletons in terms of properties of their Gauss map. Finally, we establish a new isoperimetric estimate for these sets, of order $1/n^4$ where $n$ is the number of branches of the skeleton.

The norm of the gradient $\nabla$f (x) measures the maximum descent of a real-valued smooth function f at x. For (nonsmooth) convex functions, this is expressed by the distance dist(0, $\partial$f (x)) of the subdifferential to the origin, while for general real-valued functions defined on metric spaces by the notion of metric slope |$\nabla$f |(x). In this work we propose an axiomatic definition of descent modulus T [f ](x) of a real-valued function f at every point x, defined on a general (not necessarily metric) space. The definition encompasses all above instances as well as average descents for functions defined on probability spaces. We show that a large class of functions are completely determined by their descent modulus and corresponding critical values. This result is already surprising in the smooth case: a one-dimensional information (norm of the gradient) turns out to be almost as powerful as the knowledge of the full gradient mapping. In the nonsmooth case, the key element for this determination result is the break of symmetry induced by a downhill orientation, in the spirit of the definition of the metric slope. The particular case of functions defined on finite spaces is studied in the last section. In this case, we obtain an explicit classification of descent operators that are, in some sense, typical.

This note proves that the separation convergence towards the uniform distribution abruptly occurs at times around ln(n)/n for the (time-accelerated by 2) Brownian motion on the sphere with a high dimension n. The arguments are based on a new and elementary perturbative approach for estimating hitting times in a small noise context. The quantitative estimates thus obtained are applied to the strong stationary times constructed in a privious article by the authors to deduce the wanted cut-off phenomenon.

The Rado graph, also known as the random graph $G(\infty, p)$, is a classical limit object for finite graphs. We study natural ball walks as a way of understanding the geometry of this graph. For the walk started at $i$, we show that order $\log_2^*i$ steps are sufficient, and for infinitely many $i$, necessary for convergence to stationarity. The proof involves an application of Hardy's inequality for trees., Comment: 43 pages

Using jointly geometric and stochastic reformulations of nonconvex problems and exploiting a Monge-Kantorovich gradient system formulation with vanishing forces, we formally extend the simulated annealing method to a wide class of global optimization methods. Due to an inbuilt combination of a gradient-like strategy and particles interactions, we call them swarm gradient dynamics. As in the original paper of Holley-Kusuoka-Stroock, the key to the existence of a schedule ensuring convergence to a global minimizer is a functional inequality. One of our central theoretical contributions is the proof of such an inequality for one-dimensional compact manifolds. We conjecture the inequality to be true in a much wider setting. We also describe a general method allowing for global optimization and evidencing the crucial role of functional inequalities {\`a} la {\L}ojasiewicz.

The first aim of this paper is to introduce a class of Markov chains on $\mathbb{Z}_+$ which are discrete self-similar in the sense that their semigroups satisfy an invariance property expressed in terms of a discrete random dilation operator. After showing that this latter property requires the chains to be upward skip-free, we first establish a gateway relation, a concept introduced in [26], between the semigroup of such chains and the one of spectrally negative self-similar Markov processes on $\mathbb{R}_+$. As a by-product, we prove that each of these Markov chains, after an appropriate scaling, converge in the Skorohod metric, to the associated self-similar Markov process. By a linear perturbation of the generator of these Markov chains, we obtain a class of ergodic Markov chains, which are non-reversible. By means of intertwining and interweaving relations, where the latter was recently introduced in [27], we derive several deep analytical properties of such ergodic chains including the description of the spectrum, the spectral expansion of their semigroups, the study of their convergence to equilibrium in the $\Phi$-entropy sense as well as their hypercontractivity property., Comment: 50 pages

The purpose of this paper is to construct a Brownian motion $X := (X_t)_{t\geq 0}$ taking values in a Riemannian manifold $M$, together with a compact valued process $D:= (D_t)_{t\geq 0}$ such that, at least for small enough ${\mathscr F}^D$-stopping time $\tau> 0$ and conditioned by ${\mathscr F}_\tau^D$, the law of $X_\tau$ is the normalized Lebesgue measure on $D_\tau$. This intertwining result is a generalization of Pitman theorem. We first construct regular intertwined processes related to Stokes' theorem. Then using several limiting procedures we construct synchronous intertwined, free intertwined, mirror intertwined processes. The local times of the Brownian motion on the (morphological) skeleton or the boundary of $D$ plays an important role. Several examples with moving intervals, discs, annulus, symmetric convex sets are investigated. KEYWORDS: Brownian motions on Riemannian manifolds, intertwining relations, set-valued dual processes, couplings of primal and dual processes, stochastic mean curvature evolutions, boundary and skeleton local times, generalized Pitman theorem.

How much and when should we limit economic and social activity to ensure that the health-care system is not overwhelmed during an epidemic? We study a setting where ICU resources are constrained while suppression is costly (e.g., limiting economic interaction). Providing a fully analytical solution we show that the common wisdom of "flattening the curve", where suppression measures are continuously taken to hold down the spread throughout the epidemic, is suboptimal. Instead, the optimal suppression is discontinuous. The epidemic should be left unregulated in a first phase and when the ICU constraint is approaching society should quickly lock down (a discontinuity). After the lockdown regulation should gradually be lifted, holding the rate of infected constant thus respecting the ICU resources while not unnecessarily limiting economic activity. In a final phase, regulation is lifted. We call this strategy "filling the box"., Comment: 3 figures

Interweaving relations are introduced and studied here in a general Markovian setting as a strengthening of usual intertwining relations between semigroups, obtained by adding a randomized delay feature. They provide a new classification scheme of the set of Markovian semigroups which enables to transfer from a reference semigroup and up to an independent warm-up time, some ergodic, analytical and mixing properties including the $\varphi$-entropy convergence to equilibrium, the hyperboundedness and when the warm-up time is deterministic the cut-off phenomena. We also present several useful transformations that preserve interweaving relations. We provide a variety of examples of interweaving relations ranging from classical, discrete, and non-local Laguerre and Jacobi semigroups to degenerate hypoelliptic Ornstein-Uhlenbeck semigroups and some non-colliding particle systems

Markovian intertwining relations between two Markov semigroups are related to the partial inclusion of the spectra of their generators, at least for finite ergodic processes. We check the limitations of this observation by investigating the Markov intertwining relations between the Ehrenfest, Yule and Ornstein-Uhlenbeck processes, whose spectra are all included into -$\mathbb{Z}_+$. As a by-product, we offer a clarification of an intertwining relation found in Biane [2] between the Yule and the Ornstein-Uhlenbeck processes.

This paper is concerned with the solution of the optimal stopping problem associated to the valuation of Perpetual American options driven by continuous time Markov chains. We introduce a new dynamic approach for the numerical pricing of this type of American options where the main idea is to build a monotone sequence of almost excessive functions that are associated to hitting times of explicit sets. Under minimal assumptions about the payoff and the Markov chain, we prove that the value function of an American option is characterized by the limit of this monotone sequence.

We examine a queue-based random-access algorithm where activation and deactivation rates are adapted as functions of queue lengths. We establish its heavy traffic behavior on a complete interference graph, which turns out to be highly nonstandard in two respects: (1) the scaling depends on some parameter of the algorithm and is not the $N/N^2$ scaling usually found in functional central limit theorems; (2) the heavy traffic limit is deterministic. We discuss how this nonstandard behavior arises from the idleness induced by the distributed nature of the algorithm. In order to prove our main result, we developed a new method for obtaining a fully coupled stochastic averaging principle., Comment: 40 pages

By providing instances of approximation of linear diffusions by birth-death processes, Feller [13], has offered an original path from the discrete world to the continuous one. In this paper, by identifying an intertwining relationship between squared Bessel processes and some linear birth-death processes, we show that this connection is in fact more intimate and goes in the two directions. As by-products, we identify some properties enjoyed by the birth-death family that are inherited from squared Bessel processes. For instance, these include a discrete self-similarity property and a discrete analogue of the beta-gamma algebra. We proceed by explaining that the same gateway identity also holds for the corresponding ergodic Laguerre semi-groups. It follows again that the continuous and discrete versions are more closely related than thought before, and this enables to pass information from one semi-group to the other one., Comment: 47 pages

This article presents a new proof of the rate of convergence to the normal distribution of sums of independent, identically distributed random variables in chi-square distance, which was also recently studied in \cite{BobkovRenyi}. Our method consists of taking advantage of the underlying time non-homogeneous Markovian structure and studying the spectral properties of the non-reversible transition operator, which allows to find the optimal rate in the convergence above under matching moments assumptions. Our main assumption is that the random variables involved in the sum are independent and have polynomial density, interestingly, our approach allows to relax the identical distribution hypothesis., Comment: Comments welcome. New version: relevant reference added, introduction modified

We prove a lower bound for the $k$-th Steklov eigenvalues in terms of an isoperimetric constant called the $k$-th Cheeger-Steklov constant in three different situations: finite spaces, measurable spaces, and Riemannian manifolds. These lower bounds can be considered as higher order Cheeger type inequalities for the Steklov eigenvalues. In particular it extends the Cheeger type inequality for the first nonzero Steklov eigenvalue previously studied by Escobar in 1997 and by Jammes in 2015 to higher order Steklov eigenvalues. The technique we develop to get this lower bound is based on considering a family of accelerated Markov operators in the finite and mesurable situations and of mass concentration deformations of the Laplace-Beltrami operator in the manifold setting which converges uniformly to the Steklov operator. As an intermediary step in the proof of the higher order Cheeger type inequality, we define the Dirichlet-Steklov connectivity spectrum and show that the Dirichlet connectivity spectra of this family of operators converges to (or bounded by) the Dirichlet-Steklov spectrum uniformly. Moreover, we obtain bounds for the Steklov eigenvalues in terms of its Dirichlet-Steklov connectivity spectrum which is interesting in its own right and is more robust than the higher order Cheeger type inequalities. The Dirichlet-Steklov spectrum is closely related to the Cheeger-Steklov constants., Comment: Correcting few typos and doing some changes on pages 41 and 45

Consider a finite irreducible Markov chain with invariant probability $\pi$. Define its inverse communication speed as the expectation to go from x to y, when x, y are sampled independently according to $\pi$. In the discrete time setting and when $\pi$ is the uniform distribution $\upsilon$, Litvak and Ejov have shown that the permutation matrices associated to Hamiltonian cycles are the fastest Markov chains. Here we prove (A) that the above optimality is with respect to all processes compatible with a fixed graph of permitted transitions (assuming that it does contain a Hamiltonian cycle), not only the Markov chains, and, (B) that this result admits a natural extension in both discrete and continuous time when $\pi$ is close to $\upsilon$: the fastest Markov chains/processes are those moving successively on the points of a Hamiltonian cycle, with transition probabilities/jump rates dictated by $\pi$. Nevertheless, the claim is no longer true when $\pi$ is significantly different from $\upsilon$.

In analyzing a simple random walk on the Heisenberg group we encounter the problem of bounding the extreme eigenvalues of an $n\times n$ matrix of the form $M=C+D$ where $C$ is a circulant and $D$ a diagonal matrix. The discrete Schr\"odinger operators are an interesting special case. The Weyl and Horn bounds are not useful here. This paper develops three different approaches to getting good bounds. The first uses the geometry of the eigenspaces of $C$ and $D$, applying a discrete version of the uncertainty principle. The second shows that, in a useful limit, the matrix $M$ tends to the harmonic oscillator on $L^2(\mathbb{R})$ and the known eigenstructure can be transferred back. The third approach is purely probabilistic, extending $M$ to an absorbing Markov chain and using hitting time arguments to bound the Dirichlet eigenvalues. The approaches allow generalization to other walks on other groups.

Consider a finite absorbing Markov generator, irreducible on the non-absorbing states. Perron-Frobenius theory ensures the existence of a corresponding positive eigenvector $\varphi$. The goal of the paper is to give bounds on the amplitude $\max \varphi/\min\varphi$. Two approaches are proposed: one using a path method and the other one, restricted to the reversible situation, based on spectral estimates. The latter approach is extended to denumerable birth and death processes absorbing at 0 for which infinity is an entrance boundary. The interest of estimating the ratio is the reduction of the quantitative study of convergence to quasi-stationarity to the convergence to equilibrium of related ergodic processes, as seen in [7].

The Markov commutator associated to a finite Markov kernel P is the convex semigroup consisting of all Markov kernels commuting with P. Its interest comes from its relation with the hypergroup property and with the notion of Markovian duality by intertwining. In particular, it is shown that the discrete analogue of the Achour-Trim{\`e}che's theorem, asserting the preservation of non-negativity by the wave equations associated to certain Metropolis birth and death transition kernels, cannot be extended to all convex potentials. But it remains true for symmetric and monotone convex potentials. Keywords: finite Markov kernels, Markov commutator, symmetry group of a Markov kernel, hypergroup property, duality by intertwining, Achour-Trim{\`e}che theorem, birth and death chains, Metropolis algorithms, one-dimensional discrete wave equations.

Let H(n) be the group of 3x3 uni-uppertriangular matrices with entries in Z/nZ, the integers mod n. We show that the simple random walk converges to the uniform distribution in order n^2 steps. The argument uses Fourier analysis and is surprisingly challenging. It introduces novel techniques for bounding the spectrum which are useful for a variety of walks on a variety of groups., Comment: 24 pages, 6 figures

The quantitative long time behavior of absorbing, finite, irreducible Markov processes is considered. Via Doob transforms, it is shown that only the knowledge of the ratio of the values of the underlying first Dirichlet eigenvector is necessary to come back to the well-investigated situation of the convergence to equilibrium of ergodic finite Markov processes. This leads to explicit estimates on the convergence to quasi-stationarity, in particular via functional inequalities. When the process is reversible, the optimal exponential rate consisting of the spectral gap between the two first Dirichlet eigenvalues is recovered. Several simple examples are provided to illustrate the bounds obtained.

A necessary and sufficient condition is obtained for the existence of strong stationary times for ergodic one-dimensional diffusions, whatever the initial distribution. The strong stationary times are constructed through intertwinings with dual processes, in the Diaconis-Fill sense, taking values in the set of segments of the extended line $\mathbb{R}\sqcup\{-\infty,+\infty\}$. They can be seen as natural $h$-transforms of the extensions to the diffusion framework of the evolving sets of Morris-Peres. Starting from a singleton set, the dual process begins by evolving into true segments in the same way a Bessel process of dimension 3 escapes from 0. The strong stationary time corresponds to the first time the full segment $[-\infty,+\infty]$ is reached. The benchmark Ornstein-Uhlenbeck process cannot be treated in this way, it will nevertheless be seen how to use other strong times to recover its optimal exponential rate of convergence in the total variation sense.

This paper aims to provide a simple modelling of speculative bubbles and derive some quantitative properties of its dynamical evolution. Starting from a description of individual speculative behaviours, we build and study a second order Markov process, which after simple transformations can be viewed as a turning two-dimensional Gaussian process. Then, our main problem is to ob- tain some bounds for the persistence rate relative to the return time to a given price. In our main results, we prove with both spectral and probabilistic methods that this rate is almost proportional to the turning frequency {\omega} of the model and provide some explicit bounds. In the continuity of this result, we build some estimators of {\omega} and of the pseudo-period of the prices. At last, we end the paper by a proof of the quasi-stationary distribution of the process, as well as the existence of its persistence rate., Comment: 53 Pages, 8 Figures

In this paper we study the Poincar\'e constant for the Gaussian measure restricted to $D=\R^d - B(y,r)$ where $B(y,r)$ denotes the Euclidean ball with center $y$ and radius $r$, and $d\geq 2$. We also study the case of the $l^\infty$ ball (the hypercube). This is the first step in the study of the asymptotic behavior of a $d$-dimensional Ornstein-Uhlenbeck process in the presence of obstacles with elastic normal reflections (the Ornstein-Uhlenbeck pinball) we shall study in a companion paper.

A stochastic algorithm is proposed, finding the set of generalized means associated to a probability measure on a compact Riemannian manifold M and a continuous cost function on the product of M by itself. Generalized means include p-means for p>0, computed with any continuous distance function, not necessarily the Riemannian distance. They also include means for lengths computed from Finsler metrics, or for divergences. The algorithm is fed sequentially with independent random variables Y_n distributed according to the probability measure on the manifold and this is the only knowledge of this measure required. It evolves like a Brownian motion between the times it jumps in direction of the Y_n. Its principle is based on simulated annealing and homogenization, so that temperature and approximations schemes must be tuned up. The proof relies on the investigation of the evolution of a time-inhomogeneous L^2 functional and on the corresponding spectral gap estimates due to Holley, Kusuoka and Stroock., Comment: arXiv admin note: substantial text overlap with arXiv:1301.7156

A stochastic algorithm is proposed, finding some elements from the set of intrinsic $p$-mean(s) associated to a probability measure $\nu$ on a compact Riemannian manifold and to $p\in[1,\infty)$. It is fed sequentially with independent random variables $(Y_n)_{n\in \mathbb{N}}$ distributed according to $\nu$, which is often the only available knowledge of $\nu$. Furthermore, the algorithm is easy to implement, because it evolves like a Brownian motion between the random times when it jumps in direction of one of the $Y_n$, $n\in\mathbb{N}$. Its principle is based on simulated annealing and homogenization, so that temperature and approximations schemes must be tuned up (plus a regularizing scheme if $\nu$ does not admit a H\"{o}lderian density). The analysis of the convergence is restricted to the case where the state space is a circle. In its principle, the proof relies on the investigation of the evolution of a time-inhomogeneous $\mathbb{L}^2$ functional and on the corresponding spectral gap estimates due to Holley, Kusuoka and Stroock. But it requires new estimates on the discrepancies between the unknown instantaneous invariant measures and some convenient Gibbs measures., Comment: Published at http://dx.doi.org/10.3150/15-BEJ728 in the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm)

In this paper we are looking for quantitative estimates for the convergene to equilibrium of non reversible Markov processes, especialy in short times. The models studied are simple enough to get an explicit expression of the L2 distance betweeen the semigroup and the invariant measure throught time and to compare it with the corresponding reversible cases.

Let $M$ be a complete Riemannian manifold, $N\in \NN$ and $p\ge 1$. We prove that almost everywhere on $x=(x_1,...,x_N)\in M^N$ for Lebesgue measure in $M^N$, the measure $\di \mu(x)=\f1N\sum_{k=1}^N\d_{x_k}$ has a unique $p$-mean $e_p(x)$. As a consequence, if $X=(X_1,...,X_N)$ is a $M^N$-valued random variable with absolutely continuous law, then almost surely $\mu(X(\om))$ has a unique $p$-mean. In particular if $(X_n)_{n\ge 1}$ is an independent sample of an absolutely continuous law in $M$, then the process $e_{p,n}(\om)=e_p(X_1(\om),..., X_n(\om))$ is well-defined. Assume $M$ is compact and consider a probability measure $\nu$ in $M$. Using partial simulated annealing, we define a continuous semimartingale which converges to the set of minimizers of the integral of distance at power $p$ with respect to $\nu$. When the set is a singleton, it converges to the $p$-mean.

We consider a general class of discrete, two-dimensional Markov chains modeling the dynamics of a population with two types, without mutation or immigration, and neutral in the sense that type has no influence on each individual's birth or death parameters. We prove that all the eigenvectors of the corresponding transition matrix or infinitesimal generator \Pi\ can be expressed as the product of "universal" polynomials of two variables, depending on each type's size but not on the specific transitions of the dynamics, and functions depending only on the total population size. These eigenvectors appear to be Dirichlet eigenvectors for \Pi\ on the complement of triangular subdomains, and as a consequence the corresponding eigenvalues are ordered in a specific way. As an application, we study the quasistationary behavior of finite, nearly neutral, two-dimensional Markov chains, absorbed in the sense that 0 is an absorbing state for each component of the process.