Related papers: On mixtures of copulas and mixing coefficients
For a stochastically monotone Markov chain taking values in a Polish space, we present a number of conditions for existence and for uniqueness of its stationary regime, as well as for closeness of its transient trajectories. In particular,…
Consider the class of (functions of) strictly stationary Markov chains in which (i) the second moments are finite and (ii) absolute regularity (beta-mixing) is satisfied with exponential mixing rate. For (functions of) Markov chains in that…
A copolymer is a chain of repetitive units (monomers) that are almost identical, but they differ in their degree of affinity for certain solvents. This difference leads to striking phenomena when the polymer fluctuates in a nonhomogeneous…
We study the possibility of $\rho-\delta$ mixing via N-N excitations in dense nuclear matter. This mixing induces a peak in the dilepton spectra at an invariant mass equal to that of the $\delta$. We calculate the cross section for dilepton…
We consider continuous-space, discrete-time Markov chains on $\mathbb{R}^d$, that admit a finite number $N$ of metastable states. Our main motivation for investigating these processes is to analyse random Poincar\'e maps, which describe…
We use a Poisson point process approach to prove distributional convergence to a stable law for non square-integrable observables $\phi: [0,1]\to R$, mostly of the form $\phi (x) = d(x,x_0)^{-\frac{1}{\alpha}}$,$0<\alpha\le 2$, on…
Lepton mixing can originate from the breaking of a flavor symmetry in different ways in the neutrino and the charged lepton sector. We propose an extension of this framework which allows to connect the mixing parameters with masses, and…
Consider a sequence (indexed by n) of Markov chains Z^n in R^d characterized by transition kernels that approximately (in n) depend only on the rescaled state n^{-1} Z^n. Subject to a smoothness condition, such a family can be closely…
Markov chains on the non-negative quadrant of dimension $d$ are often used to model the stochastic dynamics of the number of $d$ entities, such as $d$ chemical species in stochastic reaction networks. The infinite state space poses…
We address the problem of estimating the mixing time of a Markov chain from a single trajectory of observations. Unlike most previous works which employed Hilbert space methods to estimate spectral gaps, we opt for an approach based on…
We survey recent results concerning the total-variation mixing time of the simple exclusion process on the segment (symmetric and asymmetric) and a continuum analog, the simple random walk on the simplex with an emphasis on cutoff results.…
For an open and dense subset of elliptic ${\rm SL}(2,\mathbb R)$ matrix cocycles, we construct a family of loosely Bernoulli ergodic measures with zero top Lyapunov exponent. This provides a counterpart to a classical result by Furstenberg.…
Let $X_n, n \ge 0$ be a Markov chain with finite state space $M$. If $x,y \in M$ such that $x$ is transient we have $P^y(X_n = x) \to 0$ for $n \to \infty$, and under mild aperiodicity conditions this convergence is monotone in that for…
In its continuous version, the entropy functional measuring the information content of a given probability density may be plagued by a "measure" problem that results from improper weighting of phase space. This issue is addressed…
We consider the effect of broadband decoherence on the performance of refocusing sequences, having in mind applications of dynamical decoupling in concatenation with quantum error correcting codes as the first stage of coherence protection.…
Given an irreducible discrete-time Markov chain on a finite state space, we consider the largest expected hitting time $T(\alpha)$ of a set of stationary measure at least $\alpha$ for $\alpha\in(0,1)$. We obtain tight inequalities among the…
We prove that Broder's Markov chain for approximate sampling near-perfect and perfect matchings is not rapidly mixing for Hamiltonian, regular, threshold and planar bipartite graphs, filling a gap in the literature. In the second part we…
We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…
Given sufficiently many components, it is often cited that finite mixture models can approximate any other probability density function (pdf) to an arbitrary degree of accuracy. Unfortunately, the nature of this approximation result is…
We demonstrate how an effective density of states can be derived from the S-matrix describing a coupled-channel system. Besides the locations of poles, the phase of the determinant of the S-matrix encodes essential details in characterizing…