Search

This work is devoted to finding the closed-loop equilibria for a class of mean-field games (MFGs) with infinitely many symmetric players in a common switching environment when the cost functional is under general discount in time. There are two key challenges in the application of the well-known Hamilton-Jacobi-Bellman and Fokker-Planck (HJB-FP) approach to our problems: the path-dependence due to the conditional mean-field interaction and the time-inconsistency due to the general discounting cost. To overcome the difficulties, a theory for a class of systems of path-dependent equilibrium Hamilton-Jacobi-Bellman equations (HJBs) is developed. Then closed-loop equilibrium strategies can be identified through a two-step verification procedure. It should be noted that the closed-loop equilibrium strategies obtained satisfy a new form of local optimality in the Nash sense. The theory obtained extends the HJB-FP approach for classical MFGs to more general conditional MFGs with general discounting costs.

This paper introduces a new stochastic hybrid system (SHS) framework for contingency detection in modern power systems (MPS). The framework uses stochastic hybrid system representations in state space models to expand and facilitate capability of contingency detection. In typical microgrids (MGs), buses may contain various synchronous generators, renewable generators, controllable loads, battery systems, regular loads, etc. For development of SHS models in power systems, this paper introduces the concept of dynamic and non-dynamic buses. By converting a physical power grid into a virtual linearized state space model and representing contingencies as random switching of system structures and parameters, this paper formulates the contingency detection problem as a joint estimation problem of discrete event and continuous states in stochastic hybrid systems. This method offers unique advantages, including using common measurement signals on voltage and current synchrophasors to detect different types and locations of contingencies, avoiding expensive local direct fault measurements and detecting certain contingencies that cannot be directly measured. The method employs a small and suitably-designed probing signal to sustain the ability of persistent contingency detection. Joint estimation algorithms are presented with their proven convergence and reliability properties. Examples that use an IEEE 5-bus system demonstrate the main ideas and derivation steps. Simulation case studies on an IEEE 33-bus system are used for detecting transmission line faults and sensor interruptions., Comment: 12 pages, 10 figures. arXiv admin note: text overlap with arXiv:2401.16568

This paper introduces a stochastic hybrid system (SHS) framework in state space model to capture sensor, communication, and system contingencies in modern power systems (MPS). Within this new framework, the paper concentrates on the development of state estimation methods and algorithms to provide reliable state estimation under randomly intermittent and noisy sensor data. MPSs employ diversified measurement devices for monitoring system operations that are subject to random measurement errors and rely on communication networks to transmit data whose channels encounter random packet loss and interruptions. The contingency and noise form two distinct and interacting stochastic processes that have a significant impact on state estimation accuracy and reliability. This paper formulates stochastic hybrid system models for MPSs, introduces coordinated observer design algorithms for state estimation, and establishes their convergence and reliability properties. A further study reveals a fundamental design tradeoff between convergence rates and steady-state error variances. Simulation studies on the IEEE 5-bus system and IEEE 33-bus system are used to illustrate the modeling methods, observer design algorithms, convergence properties, performance evaluations, and impact sensor system selections., Comment: 15 pages, 9 figures

The escalating global concern over extensive food wastage necessitates innovative solutions to foster a net-zero lifestyle and reduce emissions. The LILA home composter presents a convenient means of recycling kitchen scraps and daily food waste into nutrient-rich, high-quality compost. To capture the nutritional information of the produced compost, we have created and annotated a large high-resolution image dataset of kitchen food waste with segmentation masks of 19 nutrition-rich categories. Leveraging this dataset, we benchmarked four state-of-the-art semantic segmentation models on food waste segmentation, contributing to the assessment of compost quality of Nitrogen, Phosphorus, or Potassium. The experiments demonstrate promising results of using segmentation models to discern food waste produced in our daily lives. Based on the experiments, SegFormer, utilizing MIT-B5 backbone, yields the best performance with a mean Intersection over Union (mIoU) of 67.09. Class-based results are also provided to facilitate further analysis of different food waste classes.

This paper develops a new deep learning algorithm to solve a class of finite-horizon mean-field games. The proposed hybrid algorithm uses Markov chain approximation method combined with a stochastic approximation-based iterative deep learning algorithm. Under the framework of finite-horizon mean-field games, the induced measure and Monte-Carlo algorithm are adopted to establish the iterative mean-field interaction in Markov chain approximation method and deep learning, respectively. The Markov chain approximation method plays a key role in constructing the iterative algorithm and estimating an initial value of a neural network, whereas stochastic approximation is used to find accurate parameters in a bounded region. The convergence of the hybrid algorithm is proved; two numerical examples are provided to illustrate the results.

This paper focuses on and analyzes realistic SIR models that take stochasticity into account. The proposed systems are applicable to most incidence rates that are used in the literature including the bilinear incidence rate, the Beddington-DeAngelis incidence rate, and a Holling type II functional response. Given that many diseases can lead to asymptomatic infections, we look at a system of stochastic differential equations that also includes a class of hidden state individuals, for which the infection status is unknown. We assume that the direct observation of the percentage of hidden state individuals that are infected, $\alpha(t)$, is not given and only a noise-corrupted observation process is available. Using the nonlinear filtering techniques in conjunction with an invasion type analysis (or analysis using Lyapunov exponents from the dynamical system point of view), this paper proves that the long-term behavior of the disease is governed by a threshold $\lambda\in \mathbb{R}$ that depends on the model parameters. It turns out that if $\lambda<0$ the number $I(t)$ of infected individuals converges to zero exponentially fast, or the extinction happens. In contrast, if $\lambda>0$, the infection is endemic and the system is permanent. We showcase our results by applying them in specific illuminating examples. Numerical simulations are also given to illustrate our results., Comment: 27 pages, 3 figures

This paper focuses on systems of nonlinear second-order stochastic differential equations with multi-scales. The motivation for our study stems from mathematical physics and statistical mechanics, for examples, Langevin dynamics and stochastic acceleration in a random environment. Our effort is to carry out asymptotic analysis to establish large deviations principles. Our focus is on obtaining the desired results for systems under weaker conditions. When the fast-varying process is a diffusion, neither Lipschitz continuity nor linear growth needs to be assumed. Our approach is based on combinations of the intuition from Smoluchowski-Kramers approximation, and the methods initiated in [34] relying on the concepts of relatively large deviations compactness and the identification of rate functions. When the fast-varying process is under a general setup with no specified structure, the paper establishes the large deviations principle of the underlying system under the assumption on the local large deviations principles of the corresponding first-order system.

This work focuses on optimal harvesting-renewing for a stochastic population. A mixed regular-singular control formulation with a state constraint and regime-switching is introduced. The decision-makers either harvest or renew with finite or infinite harvesting/renewing rates. The payoff functions depend on the harvesting/renewing rates. Several properties of the value functions are established. The limiting value function as the white noise intensity approaches infinity is identified. The Markov chain approximation method is used to find a numerical approximation of the value function and optimal strategies.

This work develops new results for stochastic approximation algorithms. The emphases are on treating algorithms and limits with discontinuities. The main ingredients include the use of differential inclusions, set-valued analysis, and non-smooth analysis, and stochastic differential inclusions. Under broad conditions, it is shown that a suitably scaled sequence of the iterates has a differential inclusion limit. In addition, it is shown for the first time that a centered and scaled sequence of the iterates converges weakly to a stochastic differential inclusion limit. The results are then used to treat several application examples including Markov decision process, Lasso algorithms, Pegasos algorithms, support vector machine classification, and learning. Some numerical demonstrations are also provided.

This paper develops stability and stabilization results for systems of fully coupled jump diffusions. Such systems frequently arise in numerous applications where each subsystem (component) is operated under the influence of other subsystems (components). This paper derives sufficient conditions under which the underlying coupled jump diffusion is stable. The results are then applied to investigate the stability of linearizable jump diffusions, fast-slow coupled jump diffusions. Moreover, weak stabilization of interacting systems and consensus of leader-following systems are examined.

Motivated by applications in natural resource management, risk management, and finance, this paper is focused on an ergodic two-sided singular control problem for a general one-dimensional diffusion process. The control is given by a bounded variation process. Under some mild conditions, the optimal reward value as well as an optimal control policy are derived by the vanishing discount method. Moreover, the Abelian and Ces\`aro limits are established. Then a direct solution approach is provided at the end of the paper.

This work, Part II, together with its companion Part I develops a new framework for stochastic functional Kolmogorov equations, which are nonlinear stochastic differential equations depending on the current as well as the past states. Because of the complexity of the problems, it is natural to divide our contributions into two parts to answer a long-standing question in biology and ecology. What are the minimal conditions for long-term persistence and extinction of a population? Part I of our work provides characterization of persistence, whereas in this part, extinction is the main focus. The main techniques used in this paper are combination of the newly developed functional It^o formula and a dynamical system approach. Compared to the study of stochastic Kolmogorov systems without delays, the main difficulty is that infinite dimensional systems have to be treated. The extinction is characterized after investigating random occupation measures and examining behavior of functional systems around boundaries. Our characterizations of long-term behavior of the systems reduces to that of Kolmogorov systems without delay when there is no past dependence. A number of applications are also examined.

This work (Part (I)) together with its companion (Part (II) [45]) develops a new framework for stochastic functional Kolmogorov equations, which are nonlinear stochastic differential equations depending on the current as well as the past states. Because of the complexity of the results, it seems to be instructive to divide our contributions to two parts. In contrast to the existing literature, our effort is to advance the knowledge by allowing delay and past dependence, yielding essential utility to a wide range of applications. A long-standing question of fundamental importance pertaining to biology and ecology is: What are the minimal necessary and sufficient conditions for long-term persistence and extinction (or for long-term coexistence of interacting species) of a population? Regardless of the particular applications encountered, persistence and extinction are properties shared by Kolmogorov systems. While there are many excellent treaties of stochastic-differential-equation-based Kolmogorov equations, the work on stochastic Kolmogorov equations with past dependence is still scarce. Our aim here is to answer the aforementioned basic question. This work, Part (I), is devoted to characterization of persistence, whereas its companion, Part (II) [45], is devoted to extinction. The main techniques used in this paper include the newly developed functional It^o formula and asymptotic coupling and Harris-like theory for infinite dimensional systems specialized to functional equations. General theorems for stochastic functional Kolmogorov equations are developed first. Then a number of applications are examined to obtain new results substantially covering, improving, and extending the existing literature. Furthermore, these conditions reduce to that of Kolmogorov systems when there is no past dependence.

In contrast to the study of Langevin equations in a homogeneous environment in the literature, the study on Langevin equations in randomly-varying environments is relatively scarce. Almost all the existing works require random environments to have a specific formulation that is independent of the systems. This paper aims to consider large deviations principles (LDPs) of Langevin equations involving a random environment that is a process taking value in a measurable space and that is allowed to interact with the systems, without specified formulation on the random environment. Examples and applications to statistical physics are provided. Our formulation of the random environment presents the main challenges and requires new approaches. Our approach stems from the intuition of the Smoluchowski-Kramers approximation. The techniques developed in this paper focus on the relation between the solutions of the second-order equations and the associate first-order equations. We obtain the desired LDPs by showing a family of processes enjoy the exponential tightness and local LDPs with an appropriate rate function.

This work focuses on optimal controls of a class of stochastic SIS epidemic models under regime switching. By assuming that a decision maker can either influence the infectivity period or isolate infected individuals, our aim is to minimize the expected discounted cost due to illness, medical treatment, and the adverse effect on the society. In addition, a model with the incorporation of vaccination is proposed. Numerical schemes are developed by approximating the continuous-time dynamics using Markov chain approximation methods. It is demonstrated that the approximation schemes converge to the optimal strategy as the mesh size goes to zero. Numerical examples are provided to illustrate our results.

It is well known that adding any skew symmetric matrix to the gradient of Langevin dynamics algorithm results in a non-reversible diffusion with improved convergence rate. This paper presents a gradient algorithm to adaptively optimize the choice of the skew symmetric matrix. The resulting algorithm involves a non-reversible diffusion algorithm cross coupled with a stochastic gradient algorithm that adapts the skew symmetric matrix. The algorithm uses the same data as the classical Langevin algorithm. A weak convergence proof is given for the optimality of the choice of the skew symmetric matrix. The improved convergence rate of the algorithm is illustrated numerically in Bayesian learning and tracking examples.

This paper develops a novel passive stochastic gradient algorithm. In passive stochastic approximation, the stochastic gradient algorithm does not have control over the location where noisy gradients of the cost function are evaluated. Classical passive stochastic gradient algorithms use a kernel that approximates a Dirac delta to weigh the gradients based on how far they are evaluated from the desired point. In this paper we construct a multi-kernel passive stochastic gradient algorithm. The algorithm performs substantially better in high dimensional problems and incorporates variance reduction. We analyze the weak convergence of the multi-kernel algorithm and its rate of convergence. In numerical examples, we study the multi-kernel version of the passive least mean squares (LMS) algorithm for transfer learning to compare the performance with the classical passive version.

This paper develops a deep learning method for linear and nonlinear filtering. The idea is to start with a nominal dynamic model and generate Monte Carlo sample paths. Then these samples are used to train a deep neutral network. A least square error is used as a loss function for network training. Then the resulting weights are applied to Monte Carlo sampl\ es from an actual dynamic model. The deep filter obtained in such a way compares favorably to the traditional Kalman filter in linear cases and the extended Kalman filter in nonlinear cases. Moreover, a switching model with jumps is studied to show the adaptiveness and power of our deep filtering method. A main advantage of deep filtering is its robustness when the nominal model and actual model differ. Another advantage of deep filtering is that real data can be used directly to train the deep neutral network. Therefore, one does not need to calibrate the model., Comment: 3 figuress

Inverse reinforcement learning (IRL) aims to estimate the reward function of optimizing agents by observing their response (estimates or actions). This paper considers IRL when noisy estimates of the gradient of a reward function generated by multiple stochastic gradient agents are observed. We present a generalized Langevin dynamics algorithm to estimate the reward function $R(\theta)$; specifically, the resulting Langevin algorithm asymptotically generates samples from the distribution proportional to $\exp(R(\theta))$. The proposed IRL algorithms use kernel-based passive learning schemes. We also construct multi-kernel passive Langevin algorithms for IRL which are suitable for high dimensional data. The performance of the proposed IRL algorithms are illustrated on examples in adaptive Bayesian learning, logistic regression (high dimensional problem) and constrained Markov decision processes. We prove weak convergence of the proposed IRL algorithms using martingale averaging methods. We also analyze the tracking performance of the IRL algorithms in non-stationary environments where the utility function $R(\theta)$ jump changes over time as a slow Markov chain.

In this work, we study a class of mean-field linear quadratic Gaussian (LQG) problems. Under suitable conditions, explicit solutions of the distribution-dependent optimal control problems are obtained. Riccati systems are derived by directly solving the associated master equations. Some extensions on controls with partial observations are also considered., Comment: 13 pages

This paper focuses on a class of continuous-time controlled Markov chains with time-inconsistent and distribution-dependent cost functional (in some appropriate sense). A new definition of time-inconsistent distribution-dependent equilibrium in closed-loop sense is given and its existence and uniqueness have been established. Because of the time-inconsistency, it is proved that the equilibrium is locally optimal in an appropriate sense. Moreover, it has been shown that our problem is essentially equivalent to an infinite-player mean-field game with time-inconsistent cost.

Focusing on identification, this paper develops techniques to reconstruct zero and nonzero elements of a sparse parameter vector of a stochastic dynamic system under feedback control, for which the current input may depend on the past inputs and outputs, system noises as well as exogenous dithers. First, a sparse parameter identification algorithm is introduced based on L2 norm with L1 regularization, where the adaptive weights are adopted in the optimization variables of L1 term. Second, estimates generated by the algorithm are shown to have both set and parameter convergence. That is, sets of the zero and nonzero elements in the parameter can be correctly identified with probability one using a finite number of observations, and estimates of the nonzero elements converge to the true values almost surely. Third, it is shown that the results are applicable to a large number of applications, including variable selection, open-loop identification, and closed-loop control of stochastic systems. Finally, numerical examples are given to support the theoretical analysis.

Here we investigate single-cell stochastic gene expression kinetics in a minimal coupled gene circuit with positive-plus-negative feedback. A triphasic stochastic bifurcation upon the increasing ratio of the positive and negative feedback strengths is observed, which reveals a strong synergistic interaction between positive and negative feedback loops. We discover that coupled positive-plus-negative feedback amplifies gene expression mean but reduces gene expression noise over a wide range of feedback strengths when promoter switching is relatively slow, stabilizing gene expression around a relatively high level. In addition, we study two types of macroscopic limits of the discrete chemical master equation model: the Kurtz limit applies to proteins with large burst frequencies and the L\'{e}vy limit applies to proteins with large burst sizes. We derive the analytic steady-state distributions of the protein abundance in a coupled gene circuit for both the discrete model and its two macroscopic limits, generalizing the results obtained in [Chaos 26:043108, 2016]. We also obtain the analytic time-dependent protein distribution for the classical Friedman-Cai-Xie random bursting model proposed in [Phys. Rev. Lett. 97:168302, 2006]. Our analytic results are further applied to study the structure of gene expression noise in a coupled gene circuit and a complete decomposition of noise in terms of five different biophysical origins is provided., Comment: 27 pages, 7 figures

We study the long-term qualitative behavior of randomly perturbed dynamical systems. More specifically, we look at limit cycles of stochastic differential equations (SDE) with Markovian switching, in which the process switches at random times among different systems of SDEs, when the switching is fast and the diffusion (white noise) term is small. The system is modeled by $$ dX^{\epsilon,\delta}(t)=f(X^{\epsilon,\delta}(t), \alpha^\epsilon(t))dt+\sqrt{\delta}\sigma(X^{\epsilon,\delta}(t), \alpha^\epsilon(t))dW(t) , \ X^\epsilon(0)=x, $$ where $\alpha^\epsilon(t)$ is a finite state space Markov chain with irreducible generator $Q=(q_{ij})$. The relative changing rates of the switching and the diffusion are highlighted by the two small parameters $\epsilon$ and $\delta$. We associate to the system the averaged ODE \[ d\bar X(t)=\bar f(\bar X(t))dt, \ X(0)=x, \] where $\bar f(\cdot)=\sum_{i=1}^{m_0}f(\cdot, i)\nu_i$ and $(\nu_1,\dots,\nu_{m_0})$ is the unique invariant probability measure of the Markov chain with generator $Q$. Suppose that for each pair $(\epsilon,\delta)$ of parameters, the process has an invariant probability measure $\mu^{\epsilon,\delta}$, and that the averaged ODE has a limit cycle in which there is an averaged occupation measure $\mu^0$ for the averaged equation. We are able to prove that if $\bar f$ has finitely many unstable or hyperbolic fixed points, then $\mu^{\epsilon,\delta}$ converges weakly to $\mu^0$ as $\epsilon\to 0$ and $\delta \to 0$. Our results generalize to the setting of state-dependent switching \[ \mathbb{P}\{\alpha^\epsilon(t+\Delta)=j~|~\alpha^\epsilon=i, X^{\epsilon,\delta}(s),\alpha^\epsilon(s), s\leq t\}=q_{ij}(X^{\epsilon,\delta}(t))\Delta+o(\Delta),~~ i\neq j \] as long as the generator $Q(\cdot)=(q_{ij}(\cdot))$ is bounded, Lipschitz, and irreducible for all $x\in\mathbb{R}^d$. We conclude our analysis by studying a predator-prey model., Comment: 41 pages, 5 figures

Focusing on stochastic systems arising in mean-field models, the systems under consideration belong to the class of switching diffusions, in which continuous dynamics and discrete events coexist and interact. The discrete events are modeled by a continuous-time Markov chain. Different from the usual switching diffusions, the systems include mean-field interactions. Our effort is devoted to obtaining laws of large numbers for the underlying systems. One of the distinct features of the paper is the limit of the empirical measures is not deterministic but a random measure depending on the history of the Markovian switching process. A main difficulty is that the standard martingale approach cannot be used to characterize the limit because of the coupling due to the random switching process. In this paper, in contrast to the classical approach, the limit is characterized as the conditional distribution (given the history of the switching process) of the solution to a stochastic McKean-Vlasov differential equation with Markovian switching., Comment: 34 pages

This work proposes and analyzes a family of spatially inhomogeneous epidemic models. This is our first effort to use stochastic partial differential equations (SPDEs) to model epidemic dynamics with spatial variations and environmental noise. After setting up the problem, existence and uniqueness of solutions of the underlying SPDEs are examined. Then definitions of permanence and extinction are given. Certain sufficient conditions are provided for the permanence and extinction. Our hope is that this paper will open up windows for investigation of epidemic models from a new angle.

This work focuses on a class of regime-switching jump diffusion processes, which is a two component Markov processes $(X(t),\Lambda(t))$, where $\Lambda(t)$ is a component representing discrete events taking values in a countably infinite set. Considering the corresponding stochastic differential equations, our main focus is on treating those with non-Lipschitz coefficients. We first show that there exists a unique strong solution to the corresponding stochastic differential equation. Then Feller and strong Feller properties are investigated.

We analyze the optimal harvesting problem for an ecosystem of species that experience environmental stochasticity. Our work generalizes the current literature significantly by taking into account non-linear interactions between species, state-dependent prices, and species injections. The key generalization is making it possible to not only harvest, but also `seed' individuals into the ecosystem. This is motivated by how fisheries and certain endangered species are controlled. The harvesting problem becomes finding the optimal harvesting-seeding strategy that maximizes the expected total income from the harvest minus the lost income from the species injections. Our analysis shows that new phenomena emerge due to the possibility of species injections. It is well-known that multidimensional harvesting problems are very hard to tackle. We are able to make progress, by characterizing the value function as a viscosity solution of the associated Hamilton-Jacobi-Bellman (HJB) equations. Moreover, we provide a verification theorem, which tells us that if a function has certain properties, then it will be the value function. This allows us to show heuristically, as was shown in Lungu and $\O$ksendal (Bernoulli '01), that it is almost surely never optimal to harvest or seed from more than one population at a time. We approximate the continuous-time systems by Markov chains and show that the optimal harvesting-seeding strategies of the Markov chain approximations converge to the correct optimal harvesting strategy. This is used to provide numerical approximations to the optimal harvesting-seeding strategies and is a first step towards a full understanding of the intricacies of how one should harvest and seed interacting species. In particular, we look at three examples: one species modeled by a Verhulst-Pearl diffusion, two competing species and a two-species predator-prey system., Comment: 35 pages, 10 figures

This work examines a class of switching jump diffusion processes. The main effort is devoted to proving the maximum principle and obtaining the Harnack inequalities. Compared with the diffusions and switching diffusions, the associated operators for switching jump diffusions are non-local, resulting in more difficulty in treating such systems. Our study is carried out by taking into consideration of the interplay of stochastic processes and the associated systems of integro-differential equations., Comment: To appear in Bernoulli

This work develops asymptotic properties of a class of switching jump diffusion processes. The processes under consideration may be viewed as a number of jump diffusion processes modulated by a random switching mechanism. The underlying processes feature in the switching process depends on the jump diffusions. In this paper, conditions for recurrence and positive recurrence are derived. Ergodicity is examined in detail. Existence of invariant probability measures is proved., Comment: To appear in Applied Mathematics and Optimization

This work develops an approximation procedure for a class of non-zero-sum stochastic differential investment and reinsurance games between two insurance companies. Both proportional reinsurance and excess-of loss reinsurance policies are considered. We develop numerical algorithms to obtain the Nash equilibrium by adopting the Markov chain approximation methodology and applying the dynamical programming principle for the nonlinear integro-differential Hamilton-Jacobi-Isaacs (HJI) equations. Furthermore, we establish the convergence of the approximation sequences and the approximation to the value functions. Numerical examples are presented to illustrate the applicability of the algorithms.

This work is concerned with competitive Lotka-Volterra model with Markov switching. A novelty of the contribution is that the Markov chain has a countable state space. Our main objective of the paper is to reduce the computational complexity by using the two-time-scale systems. Because existence and uniqueness as well as continuity of solutions for Lotka-Volterra ecosystems with Markovian switching in which the switching takes place in a countable set are not available, such properties are studied first. The two-time scale feature is highlighted by introducing a small parameter into the generator of the Markov chain. When the small parameter goes to 0, there is a limit system or reduced system. It is established in this paper that if the reduced system possesses certain properties such as permanence and extinction, etc., then the complex system also has the same properties when the parameter is sufficiently small. These results are obtained by using the perturbed Lyapunov function methods.

The paper considers a chemostat model describing an activated sludge process in wastewater treatment. The model is assumed to be subject to environment noise in terms of both white noise and color noise. The paper fully characterizes the asymptotic behavior of the model that is a hybrid switching diffusion. We show that the long-term properties of the system can be classified using a value $\lambda$. More precisely, if $\lambda\leq 0$, the bacteria in the sewage will die out, which means that the process does not operate. If $\lambda>0$, the system has an invariant probability measure to which the transition probability of the solution process converges exponentially fast. One of the distinctive contributions of this paper is that the critical case $\lambda=0$ is considered. Numerical examples are given to illustrate our results., Comment: to appear in Stochastic Processes and their Applications

This paper develops near-optimal sustainable harvesting strategies for the predator in a predator-prey system. The objective function is of long-run average per unit time type. To date, ecological systems under environmental noise are usually modeled as stochastic differential equations driven by a Brownian motion. Recognizing that the formulation using a Brownian motion is only an idealization, in this paper, it is assumed that the environment is subject to disturbances characterized by a jump process with rapid jump rates. Under broad conditions, it is shown that the systems under consideration can be approximated by a controlled diffusion system. Based on the limit diffusion system, control policies of the original systems are constructed. Such an approach enables us to develop sustainable harvesting policies leading to near optimality. To treat the underlying problems, one of the main difficulties is due to the long-run average objective function. This in turn, requires the handling of a number of issues related to ergodicity. New approaches are developed to obtain the tightness of the underlying processes based on the population dynamic systems., Comment: 26 pages

This work continues and substantially extends our recent work on switching diffusions with the switching processes that depend on the past states and that take values in a countable state space. That is, the discrete components of the two-component processes take values in a countably infinite set and its switching rates at current time depend on the current value of the continuous component. This paper focuses on recurrence, positive recurrence, and weak stabilization of such systems. In particular, the paper aims to providing more verifiable conditions on recurrence and positive recurrence and related issues. Assuming that the system is linearizable, it provides feasible conditions focusing on the coefficients of the systems for positive recurrence. Then linear feedback controls for weak stabilization are considered. Some illustrative examples are also given., Comment: 21 pages