George Yin

George Yin

Auto-generated profile, based on publicly available information

George Yin

Department of Mathematics, University of Connecticut, Storrs, CT 06269 USA

Research Focus & Metrics

Academic Career Length

44Years (1983-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 March 2016 in Journal of Applied Probability
Verified
Journal Article
Closed access
PDF file
NDNguyen Huu Du
Nguyen Huu Du
DNDang Hai Nguyen
Dang Hai Nguyen
GYG. George Yin
G. George Yin
In this paper we derive sufficient conditions for the permanence and ergodicity of a stochastic predator–prey model with a Beddington–DeAngelis functional response. The conditions obtained are in fact very close to the necessary conditions. Both nondegenerate and degenerate diffusions are considered. One of the distinctive features of our results is that they enable the characterization of the support of a unique invariant probability measure. It proves the convergence in total variation norm of the transition probability to the invariant measure. Comparisons to the existing literature and matters related to other stochastic predator–prey models are also given.

22 April 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SLShu Liang
Shu Liang
LWLe Yi Wang
Le Yi Wang
GYGeorge Yin
George Yin
This note develops a distributed algorithm to solve a convex optimization problem with coupled constraints. Both coupled equality and inequality constraints are considered, where functions in the equality constraints are affine and functions in the inequality constraints are convex. Different from primal-dual subgradient methods with vanishing decreasing stepsizes for nonsmooth optimizations, our algorithm focuses on smooth problems and uses a fixed stepsize to find the exact optimal solution. Convergence analysis is derived with rigorous proofs. Our result is also illustrated by simulations.

14 June 2018 in IEEE Transactions on Control Systems Technology
Verified
Journal Article
Closed access
LDLei Ding
Lei Ding
LWLe Yi Wang
Le Yi Wang
GYGeorge Yin Yin
George Yin Yin
WZWei Xing Zheng
Wei Xing Zheng
QHQing-Long Han
Qing-Long Han
This paper is concerned with distributed energy management and control issues of both generators and loads. It aims to maximize the total social welfare that balances generation-side expanses, user-side payments, and transmission line costs. A distributed control strategy with continuous information exchange among neighbors is first proposed. It is shown that this distributed algorithm achieves the global optimal power outputs on generators and the optimal electricity usage on loads asymptotically. To reduce communication resource consumptions, the distributed optimization algorithm is further expanded to incorporate event-triggered communication and control mechanism. In this new algorithm, an event-triggering condition for each generator and each load is employed to determine when its related state information should be sampled and transmitted to its neighbors. Compared with the standard periodic sampling and communication schemes, this new distributed and event-triggered algorithm can significantly reduce communication data flows while achieving the nearly identical control performance to that under continuous data communications. The theoretical results of this paper are validated by using a simulation case study with distributed generators and multiple loads on an IEEE 9-bus system.

27 July 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XZXiaofeng Zong
Xiaofeng Zong
TLTao Li
Tao Li
GYGeorge Yin
George Yin
LWLe Yi Wang
Le Yi Wang
JZJi-Feng Zhang
Ji-Feng Zhang
This paper develops stochastic consentability of linear multiagent systems with time delays and multiplicative noises. First, the stochastic stability for stochastic differential delay equations driven by multiplicative noises is examined, and the existence of the positive definite solution for a class of generalized algebraic Riccati equations (GAREs) is established. Then, sufficient conditions are deduced for the mean square and almost sure consentability and stabilization based on the developed stochastic stability and GAREs. Consensus protocols are designed for linear multiagent systems with undirected and leader-following topologies. It is revealed that multiagent consentability depends on certain characterizing system parameters, including linear system dynamics, communication graph, channel uncertainties, and time delay of the deterministic term. It is shown that a second-order integrator multiagent system is unconditionally mean square and almost surely consentable for any given noise intensities and time delay, and that the mean square and almost sure consensus can be achieved by carefully choosing the control gain according to certain explicit conditions.

3 July 2017 in Journal of Mathematical Biology
Verified
Journal Article
Open access
PDF file
AHAlexandru Hening
Alexandru Hening
DNDang H. Nguyen
Dang H. Nguyen
GYGeorge Yin
George Yin
This work is devoted to studying the dynamics of a structured population that is subject to the combined effects of environmental stochasticity, competition for resources, spatio-temporal heterogeneity and dispersal. The population is spread throughout n patches whose population abundances are modeled as the solutions of a system of nonlinear stochastic differential equations living on \([0,\infty )^n\). We prove that r, the stochastic growth rate of the total population in the absence of competition, determines the long-term behaviour of the population. The parameter r can be expressed as the Lyapunov exponent of an associated linearized system of stochastic differential equations. Detailed analysis shows that if \( r>0\), the population abundances converge polynomially fast to a unique invariant probability measure on \((0,\infty )^n\), while when \( r<0\), the population abundances of the patches converge almost surely to 0 exponentially fast. This generalizes and extends the results of Evans et al. (J Math Biol 66(3):423–476, 2013) and proves one of their conjectures. Compared to recent developments, our model incorporates very general density-dependent growth rates and competition terms. Furthermore, we prove that persistence is robust to small, possibly density dependent, perturbations of the growth rates, dispersal matrix and covariance matrix of the environmental noise. We also show that the stochastic growth rate depends continuously on the coefficients. Our work allows the environmental noise driving our system to be degenerate. This is relevant from a biological point of view since, for example, the environments of the different patches can be perfectly correlated. We show how one can adapt the nondegenerate results to the degenerate setting. As an example we fully analyze the two-patch case, \(n=2\), and show that the stochastic growth rate is a decreasing function of the dispersion rate. In particular, coupling two sink patches can never yield persistence, in contrast to the results from the non-degenerate setting treated by Evans et al. which show that sometimes coupling by dispersal can make the system persistent.

9 August 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SLShu Liang
Shu Liang
LWLe Yi Wang
Le Yi Wang
GYGeorge Yin
George Yin
Inspired by the subgradient push method developed recently by Nedi\'{c} et al., we present a distributed dual averaging push algorithm for constrained nonsmooth convex optimization over time-varying directed graph. Our algorithm combines the dual averaging method with the push-sum technique and achieves an $O(1/ \sqrt{k})$ convergence rate. Compared with the subgradient push algorithm, our algorithm i) addresses the constrained problems, and ii) has a faster convergence rate, and iii) simplifies the convergence analysis. We also generalize the proposed algorithm so that input variables of subgradient oracles have guaranteed convergence.