Searcharxiv⌕ Search

arXiv subjects

Yevgeniy Kovchegov

Publications and source records attributed to Yevgeniy Kovchegov.

36 records · Page 2Linked to original sources

Path Coupling and Aggregate Path Coupling

In this survey paper, we describe and characterize an extension to the classical path coupling method applied statistical mechanical models, referred to as aggregate path coupling. In conjunction with large deviations estimates, we use this aggregate path coupling method to prove rapid mixing of Glauber dynamics for a large class of statistical mechanical models, including models that exhibit discontinuous phase transitions which have traditionally been more difficult to analyze rigorously. The parameter region for rapid mixing for the generalized Curie-Weiss-Potts model is derived as a new application of the aggregate path coupling method.

math.PR↗

Orthogonal Polynomials for Seminonparametric Instrumental Variables Model

We develop an approach that resolves a {\it polynomial basis problem} for a class of models with discrete endogenous covariate, and for a class of econometric models considered in the work of Newey and Powell (2003), where the endogenous covariate is continuous. Suppose $X$ is a $d$-dimensional endogenous random variable, $Z_1$ and $Z_2$ are the instrumental variables (vectors), and $Z=\left(\begin{array}{c}Z_1 \\Z_2\end{array}\right)$. Now, assume that the conditional distributions of $X$ given $Z$ satisfy the conditions sufficient for solving the identification problem as in Newey and Powell (2003) or as in Proposition 1.1 of the current paper. That is, for a function $π(z)$ in the image space there is a.s. a unique function $g(x,z_1)$ in the domain space such that $$E[g(X,Z_1)~|~Z]=π(Z) \qquad Z-a.s.$$ In this paper, for a class of conditional distributions $X|Z$, we produce an orthogonal polynomial basis $Q_j(x,z_1)$ such that for a.e. $Z_1=z_1$, and for all $j \in \mathbb{Z}_+^d$, and a certain $μ(Z)$, $$P_j(μ(Z))=E[Q_j(X, Z_1)~|~Z ],$$ where $P_j$ is a polynomial of degree $j$. This is what we call solving the {\it polynomial basis problem}. Assuming the knowledge of $X|Z$ and an inference of $π(z)$, our approach provides a natural way of estimating the structural function of interest $g(x,z_1)$. Our polynomial basis approach is naturally extended to Pearson-like and Ord-like families of distributions.

math.ST↗

Stable Adiabatic Times for Markov Chains

In this paper we continue our work on adiabatic time of time-inhomogeneous Markov chains first introduced in Kovchegov (2010) and Bradford and Kovchegov (2011). Our study is an analog to the well-known Quantum Adiabatic (QA) theorem which characterizes the quantum adiabatic time for the evolution of a quantum system as a result of applying of a series of Hamilton operators, each is a linear combination of two given initial and final Hamilton operators, i.e. $\mathbf{H}(s) = (1-s)\mathbf{H_0} + s\mathbf{H_1}$. Informally, the quantum adiabatic time of a quantum system specifies the speed at which the Hamiltonian operators changes so that the ground state of the system at any time $s$ will always remain $ε$-close to that induced by the Hamilton operator $\mathbf{H}(s)$ at time $s$. Analogously, we derive a sufficient condition for the stable adiabatic time of a time-inhomogeneous Markov evolution specified by applying a series of transition probability matrices, each is a linear combination of two given irreducible and aperiodic transition probability matrices, i.e., $\mathbf{P_{t}} = (1-t)\mathbf{P_{0}} + t\mathbf{P_{1}}$. In particular we show that the stable adiabatic time $t_{sad}(\mathbf{P_{0}}, \mathbf{P_{1}}, ε) = O (t_{mix}^{4}(ε\slash 2) \slash ε^{3}), $ where $t_{mix}$ denotes the maximum mixing time over all $\mathbf{P_{t}}$ for $0 \leq t \leq 1$.

math.PR↗

A Class of Markov Chains with no Spectral Gap

In this paper we extend the results of the research started by the first author, in which Karlin-McGregor diagonalization of certain reversible Markov chains over countably infinite general state spaces by orthogonal polynomials was used to estimate the rate of convergence to a stationary distribution. We use a method of Koornwinder to generate a large and interesting family of random walks which exhibits a lack of spectral gap, and a polynomial rate of convergence to the stationary distribution. For the Chebyshev type subfamily of Markov chains, we use asymptotic techniques to obtain an upper bound of order $O({\log{t} \over \sqrt{t}})$ and a lower bound of order $O({1 \over \sqrt{t}})$ on the distance to the stationary distribution regardless of the initial state. Due to the lack of a spectral gap, these results lie outside the scope of geometric ergodicity theory.

math.CA↗

Tokunaga and Horton self-similarity for level set trees of Markov chains

The Horton and Tokunaga branching laws provide a convenient framework for studying self-similarity in random trees. The Horton self-similarity is a weaker property that addresses the principal branching in a tree; it is a counterpart of the power-law size distribution for elements of a branching system. The stronger Tokunaga self-similarity addresses so-called side branching. The Horton and Tokunaga self-similarity have been empirically established in numerous observed and modeled systems, and proven for two paradigmatic models: the critical Galton-Watson branching process with finite progeny and the finite-tree representation of a regular Brownian excursion. This study establishes the Tokunaga and Horton self-similarity for a tree representation of a finite symmetric homogeneous Markov chain. We also extend the concept of Horton and Tokunaga self-similarity to infinite trees and establish self-similarity for an infinite-tree representation of a regular Brownian motion. We conjecture that fractional Brownian motions are also Tokunaga and Horton self-similar, with self-similarity parameters depending on the Hurst exponent.

math.PR↗

Framework for discrete-time quantum walks and a symmetric walk on a binary tree

We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2 on which this is based. The framework has no need for coin spaces, it imposes no constraints on the evolution operator other than unitarity, and is unifying of other approaches. As an example we construct a symmetric discrete-time quantum walk on the semi-infinite binary tree. The generating function of the amplitude at the root is computed in closed-form, as a function of time and the initial level n in the tree, and we find the asymptotic and a full numerical solution for the amplitude. It exhibits a sharp interference peak and a power law tail, as opposed to the exponentially decaying tail of a broadly peaked distribution of the classical symmetric random walk on a binary tree. The probability peak is orders of magnitude larger than it is for the classical walk (already at small n). The quantum walk shows a polynomial algorithmic speedup in n over the classical walk, which we conjecture to be of the order 2/3, based on strong trends in data.

quant-ph↗

Mixing times via super-fast coupling

We provide a coupling proof that the transposition shuffle on a deck of n cards is mixing of rate Cn(log{n}) with a moderate constant, C. This rate was determined by Diaconis and Shahshahani, but the question of a natural probabilistic coupling proof has been missing, and questions of its existence have been raised. The proof, and indeed any proof, requires that we enlarge the methodology of coupling to include intuitive but non-adapted coupling rules, because a typical Markovian coupling is incapable of resolving finer questions of rates.

math.PR↗

Mixing Times for the Mean-Field Blume-Capel Model via Aggregate Path Coupling

In this paper we investigate the relationship between the mixing times of the Glauber dynamics of a statistical mechanical system with its thermodynamic equilibrium structure. For this we consider the mean-field Blume-Capel model, one of the simplest statistical mechanical models that exhibits the following intricate phase transition structure: within a two dimensional parameter space there exists a curve at which the model undergoes a second-order, continuous phase transition, a curve where the model undergoes a first-order, discontinuous phase transition, and a tricritical point which separates the two curves. We determine the interface between the regions of slow and rapid mixing. In order to completely determine the region of rapid mixing, we employ a novel extension of the path coupling method, successfully proving rapid mixing even in the absence of contraction between neighboring states.

math.PR↗

Adiabatic times for Markov chains and applications

We state and prove a generalized adiabatic theorem for Markov chains and provide examples and applications related to Glauber dynamics of Ising model over Z^d/nZ^d. The theorems derived in this paper describe a type of adiabatic dynamics for l^1(R_+^n) norm preserving, time inhomogeneous Markov transformations, while quantum adiabatic theorems deal with l^2(C^n) norm preserving ones, i.e. gradually changing unitary dynamics in C^n.

math.PR↗

Orthogonality and probability: mixing times

We produce the first example of bounding total variation distance to stationarity and estimating mixing times via orthogonal polynomials diagonalization of discrete reversible Markov chains, the Karlin-McGregor approach.

math.PR↗

Occupation times via Bessel functions

This study of occupation time densities for continuous-time Markov processes was inspired by the work of E.Nir et al (2006) in the field of Single Molecule FRET spectroscopy. There, a single molecule fluctuates between two or more states, and the experimental observable depends on the state's occupation time distribution. To mathematically describe the observable there was a need to calculate a single state occupation time distribution. In this paper, we consider a Markov process with countably many states. In order to find a one-stete occupation time density, we use a combination of Fourier and Laplace transforms in the way that allows for inversion of the Fourier transform. We derive an explicit expression for an occupation time density in the case of a simple continuous time random walk on Z. Also we examine the spectral measures in Karlin-McGregor diagonalization in an attempt to represent occupation time densities via modified Bessel functions.

math.PR↗

Orthogonality and probability: beyond nearest neighbor transitions

In this article, we will explore why Karlin-McGregor method of using orthogonal polynomials in the study of Markov processes was so successful for one dimensional nearest neighbor processes, but failed beyond nearest neighbor transitions. We will proceed by suggesting and testing possible fixtures.

math.PR↗

Multi-particle processes with reinforcements

We consider a multi-particle generalization of linear edge-reinforced random walk (ERRW). We observe that in absence of exchangeability, new techniques are needed in order to study the multi-particle model. We describe an unusual coupling construction associated with the two-point edge-reinforced process on Z and prove a form of recurrence: the two particles meet infinitely often a.s.

math.PR↗

Exclusion Processes with Multiple Interactions

We introduce the mathematical theory of the particle systems that interact via permutations, where the transition rates are assigned not to the jumps from a site to a site, but to the permutations themselves. This permutation processes can be viewed as a generalization of the symmetric exclusion processes, where particles interact via transpositions. The duality and coupling techniques for the processes are described, the needed conditions for them to apply are established. The stationary distributions of the permutation processes are explored for translation invariant cases.

math.PR↗

Linear speed large deviations for percolation clusters

Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta. When d >= 2, and Gamma is any open subset of Omega, we prove: lim_{n \to \infty}(1/n) \log P(C_n \in Γ) = -\inf_{S \in Γ} λ(S) where lambda(S) is the one-dimensional Hausdorff measure of S defined using the {\em correlation norm}: ||u|| := \lim_{n \to \infty} - \frac{1}{n} \log P (u_n \in C_n) where u_n is u rounded to the nearest element of (1/n)Z^d. Given points a^1, >..., a^k in R^d, there are finitely many correlation-norm Steiner trees spanning these points and the origin. We show that if the C_n are each conditioned to contain the points a^1_n,..., a^k_n, then the probability that C_n fails to approximate one of these trees decays exponentially in n.

math.PR↗

Brownian Bridge Asymptotics for the Subcritical Bernoulli Bond Percolation

For the d-dimensional model of a subcritical bond percolation (p<p_c) and a point \vec{a} in Z^d, we prove that a cluster conditioned on connecting points (0,...,0) and n\vec{a} if scaled by 1/(n|vec{a}|) along \vec{a} and by 1/sqrt{n} in the orthogonal direction converges asymptotically to Time x (d-1)-dimensional Brownian Bridge.

math.PR↗

Brownian Bridge and Self-Avoiding Random Walk

We establish the Brownian bridge asymptotics for a scaled self-avoiding walk conditioned on arriving to a far away point $n \vec{a}$ for $\vec{a}$ in $Z^d$, as $n$ increases to infinity.

math.PR↗