相关论文: Classes of states of discrete systems

Multistate models offer a powerful framework for studying disease processes and can be used to formulate intensity-based and more descriptive marginal regression models. They also represent a natural foundation for the construction of joint…

A simple reweighting scheme is proposed for Monte Carlo simulations of interacting particle systems, permitting one to study various parameter values in a single study, and improving efficiency by an order of magnitude. Unlike earlier…

In this paper, a purely measurement-based method is proposed to estimate the dynamic system state matrix by applying the regression theorem of the multivariate Ornstein-Uhlenbeck process. The proposed method employs a recursive algorithm to…

We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of…

We study a control system resembling a singularly perturbed system whose variables are decomposed into groups that change their values with rates of different orders of magnitude. We establish that the slow trajectories of this system are…

Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…

We present and explore a model of stateless and self-stabilizing distributed computation, inspired by real-world applications such as routing on today's Internet. Processors in our model do not have an internal state, but rather interact by…

Rapidly decreasing tempered stable distributions are useful models for financial applications. However, there has been no exact method for simulation available in the literature. We remedy this by introducing an exact simulation method in…

We consider a geometrization, i.e., we identify geometrical structures, for the space of density states of a quantum system. We also provide few comments on a possible application of this geometrization for composite systems.

In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…

We introduce driven exclusion processes with internal states that serve as generic transport models in various contexts, ranging from molecular or vehicular traffic on parallel lanes to spintronics. The ensuing non-equilibrium steady states…

Many dynamical systems, including thermal, fluid, and multi-agent systems, can be represented as weighted graphs. In this paper we consider whether the unstable states of such systems can be observed from limited discrete-time measurement,…

We develop a method to control discrete-time systems with constant but initially unknown parameters from linear temporal logic (LTL) specifications. We introduce the notions of (non-deterministic) parametric and adaptive transition systems…

In this document, some novel theoretical and computational techniques for constrained approximation of data-driven systems, are presented. The motivation for the development of these techniques came from structure-preserving matrix…

Stationary states of stochastic models, which have $N$ states per site, in matrix product form are considered. First we give a necessary condition for the existence of a finite $M$-dimensional matrix product state for any ${N,M}$. Second,…

We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

A finite set is "hidden" if its elements are not directly enumerable or if its size cannot be ascertained via a deterministic query. In public health, epidemiology, demography, ecology and intelligence analysis, researchers have developed a…

Graphity models are characterized by configuration spaces in which states correspond to graphs and Hamiltonians that depend on local properties of graphs such as the degrees of vertices and numbers of short cycles. As statistical systems,…

This paper introduces a general approach for synthesizing procedural models of the state-transitions of a given discrete system. The approach is general in that it accepts different target languages for modeling the state-transitions of a…