Related papers: Distances for Weighted Transition Systems: Games a…
We lay out a general method for computing branching distances between labeled transition systems. We translate the quantitative games used for defining these distances to other, path-building games which are amenable to methods from the…
This thesis is concerned with quantitative verification, that is, the verification of quantitative properties of quantitative systems. These systems are found in numerous applications, and their quantitative verification is important, but…
This paper concerns branching simulation for weighted Kripke structures with parametric weights. Concretely, we consider a weighted extension of branching simulation where a single transitions can be matched by a sequence of transitions…
We develop a new framework for branched transport between probability measures which are allowed to vary in time. This framework can be used to model problems where the underlying transportation network displays a branched structure, but…
An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely…
We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by…
This paper considers linear functions constructed on two different weighted branching processes and provides explicit bounds for their Kantorovich-Rubinstein distance in terms of couplings of their corresponding generic branching vectors.…
Classical machine learning approaches are sensitive to non-stationarity. Transfer learning can address non-stationarity by sharing knowledge from one system to another, however, in areas like machine prognostics and defense, data is…
Branching random flights are key to describing the evolution of many physical and biological systems, ranging from neutron multiplication to gene mutations. When their paths evolve in bounded regions, we establish a relation between the…
Specification theories as a tool in model-driven development processes of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature, and therefore…
We define the distance between two information structures as the largest possible difference in value across all zero-sum games. We provide a tractable characterization of distance and use it to discuss the relation between the value of…
A transient stochastic process is considered strongly transient if conditioned on returning to the starting location, the expected time it takes to return the the starting location is finite. We characterize strong transience for a…
Intransitivity is a critical issue in pairwise preference modeling. It refers to the intransitive pairwise preferences between a group of players or objects that potentially form a cyclic preference chain and has been long discussed in…
Quantum walks are accepted as a generic model for quantum transport. The character of the transport crucially depends on the properties of the walk like its geometry and the driving coin. We demonstrate that increasing transport distance…
We dene the distance between two information structures as the largest possible dierence in the value across all zero-sum games. We provide a tractable characterization of the distance, as the minimal distance between 2 polytopes. We use it…
A quantum finite multi-barrier system, with a periodic potential, is considered and exact expressions for its plane wave amplitudes are obtained using the Transfer Matrix method [10]. This quantum model is then associated with a stochastic…
In this work we build a theoretical framework for the transport of information in quantum systems. This is a framework aimed at describing how out of equilibrium open quantum systems move information around their state space, using an…
Existing frameworks for transfer learning are incomplete from a systems theoretic perspective. They place emphasis on notions of domain and task, and neglect notions of structure and behavior. In doing so, they limit the extent to which…
The appropriate selection of recurrence thresholds is a key problem in applications of recurrence quantification analysis and related methods across disciplines. Here, we discuss the distribution of pairwise distances between state vectors…
Many systems across the sciences evolve through a combination of multiplicative growth and diffusive transport. In the presence of disorder, these systems tend to form localized structures which alternate between long periods of relative…