THE CONSTRUCTION OF DENUMERABLE q-PROCESSES IN RANDOM ENVIRONMENTS-THE EXISTENCE AND UNIQUENESS

The concepts of Markov process in random environment, q-matrix in random environment, and q-process in random environment are introduced. The minimal q-process in random environment is constructed and the necessary and sufficient conditions for the uniqueness of q-process in random environment are given.

THE CONSTRUCTION OF DENUMERABLE q-PROCESSES IN RANDOM ENVIRONMENTS SATISFYING (F) OR (B)

This article is a continuation of[9].Based on the discussion of random Kolmogorov forward（backward）equations,for any given q-matrix in random environment, Q（θ）=（q（θ;x,y）,x,y∈X）,an infinite class of q-processes in random environments satisfying the random Kolmogorov forward（backward）equation is constructed.Moreover, under some conditions,all the q-processes in random environments satisfying the random Kolmogorov forward（backward）equation are constructed.

THE EXISTENCE AND MOMENTS OF CANONICAL BRANCHING CHAIN IN RANDOM ENVIRONMENT

The concepts of branching chain in random environmnet and canonical branching chain in random environment are introduced. Moreover the existence of these chains is proved. Finally the exact formulas of mathematical expectation and variance of branching chain in random environment are also given.

Research on color image matching method based on feature point compensation in dark light environment

Image matching refers to the process of matching two or more images obtained at different time,different sensors or different conditions through a large number of feature points in the image.At present,image matching is widely used in target recognition and tracking,indoor positioning and navigation.Local features missing,however,often occurs in color images taken in dark light,making the extracted feature points greatly reduced in number,so as to affect image matching and even fail the target recognition.An unsharp masking(USM)based denoising model is established and a local adaptive enhancement algorithm is proposed to achieve feature point compensation by strengthening local features of the dark image in order to increase amount of image information effectively.Fast library for approximate nearest neighbors(FLANN)and random sample consensus(RANSAC)are image matching algorithms.Experimental results show that the number of effective feature points obtained by the proposed algorithm from images in dark light environment is increased,and the accuracy of image matching can be improved obviously.

THE CLASSIFICATION AND PERIOD OF STATES FOR MARKOV CHAIN IN RANDOM ENVIRONMENT

This paper is a continuation of [8]. In Section 1, three kinds of communication are introdnced for two states and the relations among them are investigated. In Section 2, two kinds of period of a state are introdnced and it is obtained that the period is a 'class property',i.e. two states x and y belong to same class implies the period of x is equal to the period of y.

ON MARKOV CHAINS IN SPACE-TIME RANDOM ENVIRONMENTS

In Section 1, the authors establish the models of two kinds of Markov chains in space-time random environments (MCSTRE and MCSTRE(+)) with abstract state space. In Section 2, the authors construct a MCSTRE and a MCSTRE(+) by an initial distribution Φ and a random Markov kernel (RMK) p(γ). In Section 3, the authors es-tablish several equivalence theorems on MCSTRE and MCSTRE(+). Finally, the authors give two very important examples of MCMSTRE, the random walk in spce-time random environment and the Markov br...

ASYMPTOTIC PROPERTIES OF A BRANCHING RANDOM WALK WITH A RANDOM ENVIRONMENT IN TIME

We consider a branching random walk in an independent and identically distributed random environment ξ=(ξn) indexed by the time. Let W be the limit of the martingale Wn=∫e^-txZn(dx)/Eξ∫e^-txZn(dx), with Zn denoting the counting measure of particles of generation n, and Eξ the conditional expectation given the environment ξ. We find necessary and sufficient conditions for the existence of quenched moments and weighted moments of W, when W is non-degenerate.

CENTRAL LIMIT THEOREMS FOR A BRANCHING RANDOM WALK WITH A RANDOM ENVIRONMENT IN TIME

We consider a branching random walk with a random environment m time, in which the offspring distribution of a particle of generation n and the distribution of the displacements of its children depend on an environment indexed by the time n. The envi- ronment is supposed to be independent and identically distributed. For A C R, let Zn（A） be the number of particles of generation n located in A. We show central limit theorems for the counting measure Zn （-） with appropriate normalization.

THE DECOMPOSITION OF STATE SPACE FOR MARKOV CHAIN IN RANDOM ENVIRONMENT

This paper is a continuation of [8] and [9]. The author obtains the decomposition of state space X of an Markov chain in random environment by making use of the results in [8] and [9], gives three examples, random walk in random environment, renewal process in random environment and queue process in random environment, and obtains the decompositions of the state spaces of these three special examples.

THE CONSTRUCTION OF MULTITYPE CANONICAL MARKOV BRANCHING CHAINS IN RANDOM ENVIRONMENTS

The investigation for branching processes has a long history by their strong physics background, but only a few authors have investigated the branching processes in random environments. First of all, the author introduces the concepts of the multitype canonical Markov branching chain in random environment （CMBCRE） and multitype Markov branching chain in random environment （MBCRE） and proved that CMBCRE must be MBCRE, and any MBCRE must be equivalent to another CMBCRE in distribution. The main results of this article are the construction of CMBCRE and some of its probability properties.

Some Probability Properties of Random Walk in Time-Random Environment

A general formulation of the stochastic model for random walk in time-random environment and an equivalent definition is established in this paper. Moreover, some basic probability relations similar to the classical case which are very useful in the corresponding research of fractal properties are given. At the end, a typical example is provided to show the recurrence and transience. Key words random environment - random walk in timerandom environment - skew product Markov chain CLC number O 211.6 Foudation item: Supported by the National Natural Science Foundation of China (10371092) and Foundation of Wuhan University.Biography: Zhang Xiao-min (1977-), male, Ph. D candidate, research direction: stochastic processes and random fractal.

RENEWAL THEOREM FOR(L,1)-RANDOM WALK IN RANDOM ENVIRONMENT

We consider a random walk on Z in random environment with possible jumps {-L,…, -1, 1}, in the case that the environment {ωi ： i ∈ Z} are i.i.d.. We establish the renewal theorem for the Markov chain of ＂the environment viewed from the particle＂ in both annealed probability and quenched probability, which generalize partially the results of Kesten （1977） and Lalley （1986） for the nearest random walk in random environment on Z, respectively. Our method is based on （L, 1）-RWRE formulated in Hong and Wang the intrinsic branching structure within the （2013）.

Laplace Transformation and Ergodic Potential Kernel for q-Process in Random Environment

This paper introduces some concepts such as q- process in random environment, Laplace transformation, ergodic potential kernel, error function and some basic lemmas.We study the continuity and Laplace transformation of random transition function. Finally, we give the sufficient condition for the existence of ergodic potential kernel for homogeneous q- processes in random environments.

Model of Markov Chains in Space-Time Random Environments

A general framework of stochastic model for a Markov chain in a space-time random environment is introduced, here the environment ξ^＊：={ξ1,x∈N,x∈ X}is a random field. We study the dependence relations between the environment and the original chain, especially the ＂feedback＂. Some equivalence theorems and law of large numbers are obtained.

RECURRENCE FOR THE GENERALIZED BIRTH-DEATH CHAINS IN A RANDOM ENVIRONMENT

This is a study of one dimensional generalized birth-death chains in a random environment (GBDIRE). We give two sufficient conditions of recurrence for GBDIRE.

THE ERGODICITY FOR BI-IMMIGRATION BIRTH AND DEATH PROCESSES IN RANDOM ENVIRONMENT

The concepts of bi-immigration birth and death density matrix in random environment and bi-immigration birth and death process in random environment are introduced. For any bi-immigration birth and death matrix in random environment Q（θ） with birth rate λ 〈 death rate μ, the following results are proved, （1） there is an unique q-process in random environment, P^-（θ＊（0）;t） = （p^-（θ^＊（0）;t,i,j）,i,j ≥ 0）, which is ergodic, that is, lim t→∞（θ^＊（0）;t,i,j） = π^-（θ^＊（0）;j） ≥0 does not depend on i ≥ 0 and ∑j≥0π （θ＊（0）;j） = 1, （2） there is a bi-immigration birth and death process in random enjvironment （X^＊ = {X^＊,t ≥ 0},ε^＊ = {εt,t ∈ （-∞, ∞）}） with random transition matrix P^-（θ^＊ （0）;t） such that X^＊ is a strictly stationary process.

LIMIT THEOREMS FOR A GALTON-WATSON PROCESS IN THE I.I.D. RANDOM ENVIRONMENT

In this article, we obtain the central limit theorem and the law of the iterated logarithm for Galton-Watson processes in i.i.d, random environments.

MOMENTS OF CONTINUOUS-STATE BRANCHING PROCESSES IN LéVY RANDOM ENVIRONMENTS

For continuous-state branching processes in Lévy random environments, the recursion of n-moments and the equivalent condition for the existence of general f-moments are established, where f is a positive continuous function satisfying some standard conditions.

MOMENTS AND LARGE DEVIATIONS FOR SUPERCRITICAL BRANCHING PROCESSES WITH IMMIGRATION IN RANDOM ENVIRONMENTS

Let(Z_(n))be a branching process with immigration in a random environmentξ,whereξis an independent and identically distributed sequence of random variables.We show asymptotic properties for all the moments of Z_(n) and describe the decay rates of the n-step transition probabilities.As applications,a large deviation principle for the sequence log Z_(n) is established,and related large deviations are also studied.

The Laplace Functional and Moments for Markov Branching Chains in Random Environments

The concepts of random Markov matrix, Markov branching chain in randomenvironment (MBCRE) and Laplace functional of Markov branching chain in random environment (LFMBCRE)are introduced. The properties of LFMBCRE and the explicit formulas of momentsof MBCRE are given.