arXiv subjects

Ming Cao

Publications and source records attributed to Ming Cao.

At least 73 records · Page 4Linked to original sources

arXiv2023

Discrete-time Layered-network Epidemics Model with Time-varying Transition Rates and Multiple Resources

This paper studies a discrete-time time-varying multi-layer networked SIWS (susceptible-infected-water-susceptible) model with multiple resources under both single-virus and competing multi-virus settings. Besides the human-to-human interaction, we also consider that the disease can diffuse on different types of medium. We use \emph{resources} to refer to any media that the pathogen of a virus can spread through, and do not restrict the resource only to be water. In the single-virus case, we give a full analysis of the system's behaviour related to its healthy state and endemic equilibrium. In the multi-virus case, we show analytically that different equilibria appear driven by the competition among all viruses. We also show that some analytical results of the time-invariant system can be expanded into time-varying cases. Finally, we illustrate the results through some simulations.

eess.SY↗

arXiv2023

Evolutionary dynamics under periodic switching of update rules on regular networks

Microscopic strategy update rules play an important role in the evolutionary dynamics of cooperation among interacting agents on complex networks. Many previous related works only consider one \emph{fixed} rule, while in the real world, individuals may switch, sometimes periodically, between rules. It is of particular theoretical interest to investigate under what conditions the periodic switching of strategy update rules facilitates the emergence of cooperation. To answer this question, we study the evolutionary prisoner's dilemma game on regular networks where agents can periodically switch their strategy update rules. We accordingly develop a theoretical framework of this periodically switched system, where the replicator equation corresponding to each specific microscopic update rule is used for describing the subsystem, and all the subsystems are activated in sequence. By utilizing switched system theory, we identify the theoretical condition for the emergence of cooperative behavior. Under this condition, we have proved that the periodically switched system with different switching rules can converge to the full cooperation state. Finally, we consider an example where two strategy update rules, that is, the imitation and pairwise-comparison updating, are periodically switched, and find that our numerical calculations validate our theoretical results.

math.OC↗

arXiv2023

Flocking control against the malicious agent

This paper investigates the flocking control of a swarm with a malicious agent that falsifies its controller parameters to cause collision, division, and escape of agents in the swarm. A novel geometric flocking condition is established by designing the configuration of the malicious agent and its neighbors, under which we propose a hierarchal geometric configuration-based flocking control method. To help detect the malicious agent, a parameter estimate mechanism is also provided. The proposed method can achieve the flocking control goal and meanwhile contain the malicious agent in the swarm without removing it. Experimental result shows the effectiveness of the theoretical result.

eess.SY↗

arXiv2023

Stable Chimera States: A Geometric Singular Perturbation Approach

Over the past decades chimera states have attracted considerable attention given their unexpected symmetry-breaking spatio-temporal nature, simultaneously exhibiting synchronous and incoherent behaviours under specific conditions. Despite relevant precursory results of such unforeseen states for diverse physical and topological configurations, there remain structures and mechanisms yet to be unveiled. In this work, using mean-field techniques, we analyze a multilayer network composed by two populations of heterogeneous Kuramoto phase oscillators with coevolutive coupling strengths. Moreover, we employ Geometric Singular Perturbation Theory (GSPT) with the inclusion of a time-scale separation between the dynamics of the network elements and the adaptive coupling strength connecting them, gaining a better insight into the behaviour of the system from a fast-slow dynamics perspective. Consequently, we derive the necessary and sufficient condition to produce stable chimera states when considering a co-evolutionary intercoupling strength. Additionally, under the aforementioned constraint and with a suitable adaptive law election, it is possible to generate intriguing patterns, such as persistent breathing chimera states. Thereafter, we analyze the geometric properties of the mean-field system with a co-evolutionary intracoupling strength and demonstrate the production of stable chimera states which depend on the associated network. Finally, relaxation oscillations and canard cycles, also related to breathing chimeras, are numerically produced under identified conditions due to the geometry of our system.

math.DS↗

arXiv2023

A Stackelberg viral marketing design for two competing players

A Stackelberg duopoly model in which two firms compete to maximize their market share is considered. The firms offer a service/product to customers that are spread over several geographical regions (e.g., countries, provinces, or states). Each region has its own characteristics (spreading and recovery rates) of each service propagation. We consider that the spreading rate can be controlled by each firm and is subject to some investment that the firm does in each region. One of the main objectives of this work is to characterize the advertising budget allocation strategy for each firm across regions to maximize its market share when competing. To achieve this goal we propose a Stackelberg game model that is relatively simple while capturing the main effects of the competition for market share. {By characterizing the strong/weak Stackelberg equilibria of the game, we provide the associated budget allocation strategy.} In this setting, it is established under which conditions the solution of the game is the so-called ``winner takes all". Numerical results expand upon our theoretical findings and we provide the equilibrium characterization for an example.

cs.GT↗

arXiv2023

Coevolutionary Dynamics of Actions and Opinions in Social Networks

Empirical studies suggest a deep intertwining between opinion formation and decision-making processes, but these have been treated as separate problems in the study of dynamical models for social networks. In this paper, we bridge the gap in the literature by proposing a novel coevolutionary model, in which each individual selects an action from a binary set and has an opinion on which action they prefer. Actions and opinions coevolve on a two-layer network. For homogeneous parameters, undirected networks, and under reasonable assumptions on the asynchronous updating mechanics, we prove that the coevolutionary dynamics is an ordinal potential game, enabling analysis via potential game theory. Specifically, we establish global convergence to the Nash equilibria of the game, proving that actions converge in a finite number of time steps, while opinions converge asymptotically. Next, we provide sufficient conditions for the existence of, and convergence to, polarized equilibria, whereby the population splits into two communities, each selecting and supporting one of the actions. Finally, we use simulations to examine the social psychological phenomenon of pluralistic ignorance.

eess.SY↗

arXiv2023

Compressed Differentially Private Distributed Optimization with Linear Convergence

This paper addresses the problem of differentially private distributed optimization under limited communication, where each agent aims to keep their cost function private while minimizing the sum of all agents' cost functions. In response, we propose a novel Compressed differentially Private distributed Gradient Tracking algorithm (CPGT). We demonstrate that CPGT achieves linear convergence for smooth and strongly convex cost functions, even with a class of biased but contractive compressors, and achieves the same accuracy as the idealized communication algorithm. Additionally, we rigorously prove that CPGT ensures differential privacy. Simulations are provided to validate the effectiveness of the proposed algorithm.

math.OC↗

arXiv2023

The Domain of Attraction of the Desired Path in Vector-field Guided Path Following

In the vector-field guided path-following problem, a sufficiently smooth vector field is designed such that its integral curves converge to and move along a one-dimensional geometric desired path. The existence of singular points where the vector field vanishes creates a topological obstruction to global convergence to the desired path and some associated topological analysis has been conducted in our previous work. In this paper, we strengthen the result in our previous work by showing that the domain of attraction of the desired path, which is a compact asymptotically stable one-dimensional embedded submanifold of an $n$-dimensional ambient manifold $\mathcal{M}$, is homeomorphic to $\mathbb{R}^{n-1} \times \mathbb{S}^1$, and not just homotopy equivalent to $\mathbb{S}^1$. This result is extended for a $k$-dimensional compact manifold for $k \ge 2$.

eess.SY↗

arXiv2022

Modeling the Co-evolution of Climate Impact and Population Behavior: A Mean-Field Analysis

Motivated by the climate crisis that is currently ravaging the planet, we propose and analyze a novel framework for the evolution of anthropogenic climate impact in which the evolution of human environmental behavior and environmental impact is coupled. Our framework includes a human decision-making process that captures social influence, government policy interventions, and the cost of environmentally-friendly behavior, modeled within a game-theoretic paradigm. By taking a mean-field approach in the limit of large populations, we derive the equilibria and their local stability characteristics. Subsequently, we study global convergence, whereby we show that the system converges to a periodic solution for almost all initial conditions. Numerical simulations confirm our findings and suggest that, before the system reaches such a periodic solution, the level of environmental impact might become dangerously high, calling for the design of optimal control strategies to influence the system trajectory.

math.DS↗

arXiv2022

Language Model Classifier Aligns Better with Physician Word Sensitivity than XGBoost on Readmission Prediction

Traditional evaluation metrics for classification in natural language processing such as accuracy and area under the curve fail to differentiate between models with different predictive behaviors despite their similar performance metrics. We introduce sensitivity score, a metric that scrutinizes models' behaviors at the vocabulary level to provide insights into disparities in their decision-making logic. We assess the sensitivity score on a set of representative words in the test set using two classifiers trained for hospital readmission classification with similar performance statistics. Our experiments compare the decision-making logic of clinicians and classifiers based on rank correlations of sensitivity scores. The results indicate that the language model's sensitivity score aligns better with the professionals than the xgboost classifier on tf-idf embeddings, which suggests that xgboost uses some spurious features. Overall, this metric offers a novel perspective on assessing models' robustness by quantifying their discrepancy with professional opinions. Our code is available on GitHub (https://github.com/nyuolab/Model_Sensitivity).

cs.CL↗

arXiv2022

Guiding vector fields for the distributed motion coordination of mobile robots

We propose coordinating guiding vector fields to achieve two tasks simultaneously with a team of robots: first, the guidance and navigation of multiple robots to possibly different paths or surfaces typically embedded in 2D or 3D; second, their motion coordination while tracking their prescribed paths or surfaces. The motion coordination is defined by desired parametric displacements between robots on the path or surface. Such a desired displacement is achieved by controlling the virtual coordinates, which correspond to the path or surface's parameters, between guiding vector fields. Rigorous mathematical guarantees underpinned by dynamical systems theory and Lyapunov theory are provided for the effective distributed motion coordination and navigation of robots on paths or surfaces from all initial positions. As an example for practical robotic applications, we derive a control algorithm from the proposed coordinating guiding vector fields for a Dubins-car-like model with actuation saturation. Our proposed algorithm is distributed and scalable to an arbitrary number of robots. Furthermore, extensive illustrative simulations and fixed-wing aircraft outdoor experiments validate the effectiveness and robustness of our algorithm.

cs.RO↗

arXiv2022

A Polarized Temporal Network Model to Study the Spread of Recurrent Epidemic Diseases in a Partially Vaccinated Population

Motivated by massive outbreaks of COVID-19 that occurred even in populations with high vaccine uptake, we propose a novel multi-population temporal network model for the spread of recurrent epidemic diseases. We study the effect of human behavior, testing, and vaccination campaigns on the control of local outbreaks and infection prevalence. Our modeling framework decouples the vaccine effectiveness in protecting against transmission and the development of severe symptoms. Furthermore, the framework accounts for the polarizing effect of the decision to vaccinate and captures homophily, i.e., the tendency of people to interact with like-minded individuals. By means of a mean-field approach, we analytically derive the epidemic threshold. Our theoretical results suggest that, while vaccination campaigns reduce pressure on hospitals, they might facilitate resurgent outbreaks, highlighting the key role that testing campaigns may have in eradicating the disease. Numerical simulations are then employed to confirm and extend our theoretical findings to more realistic scenarios. Our numerical and analytical results agree that vaccination is not sufficient to achieve full eradication, without employing massive testing campaigns or relying on the population's responsibility. Furthermore, we show that homophily plays a critical role in the control of local outbreaks, highlighting the peril of a polarized network structure.

math.DS↗

arXiv2022

Guiding Vector Fields for Following Occluded Paths

Accurately following a geometric desired path in a two-dimensional space is a fundamental task for many engineering systems, in particular mobile robots. When the desired path is occluded by obstacles, it is necessary and crucial to temporarily deviate from the path for obstacle/collision avoidance. In this paper, we develop a composite guiding vector field via the use of smooth bump functions, and provide theoretical guarantees that the integral curves of the vector field can follow an arbitrary sufficiently smooth desired path and avoid collision with obstacles of arbitrary shapes. These two behaviors are reactive since path (re)-planning and global map construction are not involved. To deal with the common deadlock problem, we introduce a switching vector field, and the Zeno behavior is excluded. Simulations are conducted to support the theoretical results.

eess.SY↗

arXiv2022

Limit Cycles Analysis and Control of Evolutionary Game Dynamics with Environmental Feedback

Recently, an evolutionary game dynamics model taking into account the environmental feedback has been proposed to describe the co-evolution of strategic actions of a population of individuals and the state of the surrounding environment; correspondingly a range of interesting dynamic behaviors have been reported. In this paper, we provide new theoretical insight into such behaviors and discuss control options. Instead of the standard replicator dynamics, we use a more realistic and comprehensive model of replicator-mutator dynamics, to describe the strategic evolution of the population. After integrating the environment feedback, we study the effect of mutations on the resulting closed-loop system dynamics. We prove the conditions for two types of bifurcations, Hopf bifurcation and Heteroclinic bifurcation, both of which result in stable limit cycles. These limit cycles have not been identified in existing works, and we further prove that such limit cycles are in fact persistent in a large parameter space and are almost globally stable. In the end, an intuitive control policy based on incentives is applied, and the effectiveness of this control policy is examined by analysis and simulations.

eess.SY↗

arXiv2022

Robust optimal policies for team Markov games

In stochastic dynamic environments, team Markov games have emerged as a versatile paradigm for studying sequential decision-making problems of fully cooperative multi-agent systems. However, the optimality of the derived policies is usually sensitive to model parameters, which are typically unknown and required to be estimated from noisy data in practice. To mitigate the sensitivity of optimal policies to these uncertain parameters, we propose a robust model of team Markov games in this paper, where agents utilize robust optimization approaches to update strategies. This model extends team Markov games to the scenario of incomplete information and meanwhile provides an alternative solution concept of robust team optimality. To seek such a solution, we develop a robust iterative learning algorithm of team policies and prove its convergence. This algorithm, compared with robust dynamic programming, not only possesses a faster convergence rate, but also allows for using approximation calculations to alleviate the curse of dimensionality. Moreover, some numerical simulations are presented to demonstrate the effectiveness of the algorithm by generalizing the game model of sequential social dilemmas to uncertain scenarios.

math.OC↗

arXiv2022

A mean-field analysis of a network behavioural-epidemic model

The spread of an epidemic disease and the population's collective behavioural response are deeply intertwined, influencing each other's evolution. Such a co-evolution typically has been overlooked in mathematical models, limiting their real-world applicability. To address this gap, we propose and analyse a behavioural-epidemic model, in which a susceptible-infected-susceptible epidemic model and an evolutionary game-theoretic decision-making mechanism concerning the use of self-protective measures are coupled. Through a mean-field approach, we characterise the asymptotic behaviour of the system, deriving conditions for global convergence to a disease-free equilibrium and characterising the endemic equilibria of the system and their (local) stability. Interestingly, for a certain range of the model parameters, we prove global convergence to a limit cycle, characterised by periodic epidemic outbreaks.

math.DS↗

arXiv2022

Topological Analysis of Vector-Field Guided Path Following on Manifolds

A path-following control algorithm enables a system's trajectories under its guidance to converge to and evolve along a given geometric desired path. There exist various such algorithms, but many of them can only guarantee local convergence to the desired path in its neighborhood. In contrast, the control algorithms using a well-designed guiding vector field can ensure almost global convergence of trajectories to the desired path; here, "almost" means that in some cases, a measure-zero set of trajectories converge to the singular set where the vector field becomes zero (with all other trajectories converging to the desired path). In this paper, we first generalize the guiding vector field from the Euclidean space to a general smooth Riemannian manifold. This generalization can deal with path-following in some abstract configuration space (such as robot arm joint space). Then we show several theoretical results from a topological viewpoint. Specifically, we are motivated by the observation that singular points of the guiding vector field exist in many examples where the desired path is homeomorphic to the unit circle, but it is unknown whether the existence of singular points always holds in general (i.e., is inherent in the topology of the desired path). In the $n$-dimensional Euclidean space, we provide an affirmative answer, and conclude that it is not possible to guarantee global convergence to desired paths that are homeomorphic to the unit circle. Furthermore, we show that there always exist \emph{non-path-converging trajectories} (i.e., trajectories that do not converge to the desired path) starting from the boundary of a ball containing the desired path in an $n$-dimensional Euclidean space where $n \ge 3$. Examples are provided to illustrate the theoretical results.

eess.SY↗

arXiv2022

On Wilson's theorem about domains of attraction and tubular neighborhoods

In this paper, we show that the domain of attraction of a compact asymptotically stable submanifold of a finite-dimensional smooth manifold of an autonomous system is homeomorphic to its tubular neighborhood. The compactness of the attractor is crucial, without which this result is false; two counterexamples are provided to demonstrate this.

math.DS↗