206,833 research outputs found
Asynchronous Networks and Event Driven Dynamics
Real-world networks in technology, engineering and biology often exhibit
dynamics that cannot be adequately reproduced using network models given by
smooth dynamical systems and a fixed network topology. Asynchronous networks
give a theoretical and conceptual framework for the study of network dynamics
where nodes can evolve independently of one another, be constrained, stop, and
later restart, and where the interaction between different components of the
network may depend on time, state, and stochastic effects. This framework is
sufficiently general to encompass a wide range of applications ranging from
engineering to neuroscience. Typically, dynamics is piecewise smooth and there
are relationships with Filippov systems. In the first part of the paper, we
give examples of asynchronous networks, and describe the basic formalism and
structure. In the second part, we make the notion of a functional asynchronous
network rigorous, discuss the phenomenon of dynamical locks, and present a
foundational result on the spatiotemporal factorization of the dynamics for a
large class of functional asynchronous networks
Computing stationary probability distributions and large deviation rates for constrained random walks. The undecidability results
Our model is a constrained homogeneous random walk in a nonnegative orthant
Z_+^d. The convergence to stationarity for such a random walk can often be
checked by constructing a Lyapunov function. The same Lyapunov function can
also be used for computing approximately the stationary distribution of this
random walk, using methods developed by Meyn and Tweedie. In this paper we show
that, for this type of random walks, computing the stationary probability
exactly is an undecidable problem: no algorithm can exist to achieve this task.
We then prove that computing large deviation rates for this model is also an
undecidable problem. We extend these results to a certain type of queueing
systems. The implication of these results is that no useful formulas for
computing stationary probabilities and large deviations rates can exist in
these systems
Stability of Utility Maximization in Nonequivalent Markets
Stability of the utility maximization problem with random endowment and
indifference prices is studied for a sequence of financial markets in an
incomplete Brownian setting. Our novelty lies in the nonequivalence of markets,
in which the volatility of asset prices (as well as the drift) varies.
Degeneracies arise from the presence of nonequivalence. In the positive real
line utility framework, a counterexample is presented showing that the expected
utility maximization problem can be unstable. A positive stability result is
proven for utility functions on the entire real line
Constrained Finite Receding Horizon Linear Quadratic Control
Issues of feasibility, stability and performance are considered for a finite horizon formulation of receding horizon control (RHC) for linear systems under mixed linear state and control constraints. It is shown that for a sufficiently long horizon, a receding horizon policy will remain feasible and result in stability, even when no end constraint is imposed. In addition, offline finite horizon calculations can be used to determine not only a stabilizing horizon length, but guaranteed performance bounds for the receding horizon policy. These calculations are demonstrated on two examples
Stability and Performance Analysis of Systems Under Constraints
All real world control systems must deal with actuator and state constraints. Standard conic sector bounded nonlinearity stability theory provides methods for analyzing the stability and performance of systems under constraints, but it is well-known that these conditions can be very conservative. A method is developed to reduce conservatism in the analysis of constraints by representing them as nonlinear real parametric uncertainty
- …