Related papers: Reasoning in Systems with Elements that Randomly S…
This paper examines the quantities used by MYCIN to reason with uncertainty, called certainty factors. It is shown that the original definition of certainty factors is inconsistent with the functions used in MYCIN to combine the quantities.…
This thesis consists of two separate parts: in each we study the stability under small perturbations of certain probability models in different contexts. In the first, we study small random perturbations of a deterministic dynamical system…
We propose a new way of thinking about one parameter persistence. We believe topological persistence is fundamentally not about decomposition theorems but a central role is played by a choice of metrics. Choosing a pseudometric between…
This article is concerned with stability analysis and stabilization of randomly switched nonlinear systems. These systems may be regarded as piecewise deterministic stochastic systems: the discrete switches are triggered by a stochastic…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and…
These lectures present results and problems on the characterization of structurally stable dynamics. We will shed light those which do not seem to depend on the regularity class (holomorphic or differentiable). Furthermore, we will present…
The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…
The notion of stability in a structured argumentation setup characterizes situations where the acceptance status associated with a given literal will not be impacted by any future evolution of this setup. In this paper, we abstract away…
The analysis of decision making under uncertainty is closely related to the analysis of probabilistic inference. Indeed, much of the research into efficient methods for probabilistic inference in expert systems has been motivated by the…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
We develop a framework for modelling and reasoning with uncertainty based on accept and reject statements about gambles. It generalises the frameworks found in the literature based on statements of acceptability, desirability, or…
We study the stability of posterior predictive inferences to the specification of the likelihood model and perturbations of the data generating process. In modern big data analyses, useful broad structural judgements may be elicited from…
The properties of a coherent system with a single general standby component is investigated. Here three different switch over viz. perfect switching, imperfect switching and random worm up period of the standby component are considered with…
We describe new methods for deciding the stability of switching systems. The methods build on two ideas previously appeared in the literature: the polytope norm iterative construction, and the lifting procedure. Moreover, the combination of…
This paper considers the problem of robust stability for a class of uncertain quantum systems subject to unknown perturbations in the system coupling operator. A general stability result is given for a class of perturbations to the system…
The paper discusses linear fractional representations of parameter-dependent nonlinear systems with dynamics defined by real rational nonlinearities and a finite set of point delays. The global asymptotic stability is investigated via…
The idea of fully accepting statements when the evidence has rendered them probable enough faces a number of difficulties. We leave the interpretation of probability largely open, but attempt to suggest a contextual approach to full belief.…
In this article we study algorithmic synthesis of the class of stabilizing switching signals for discrete-time switched linear systems proposed in [12]. A weighted digraph is associated in a natural way to a switched system, and the…
Dynamical systems, that are used to model power grids, the brain, and other physical systems, can exhibit coexisting stable states known as attractors. A powerful tool to understand such systems, as well as to better predict when they may…