Related papers: Determinism in the one-way model
We introduce a model for innovation-, evolution- and opinion dynamics whose spreading is dictated by unanimity rules, i.e. a node will change its (binary) state only if all of its neighbours have the same corresponding state. It is shown…
A finite element approach to the elastic flow of a curve coupled with a diffusion equation on the curve is analysed. Considering the graph case, the problem is weakly formulated and approximated with continuous linear finite elements, which…
We introduce unitary network, an oriented architecture for tensor network unitaries. Compared to existing architectures, in a unitary network each local tensor is required to be a unitary matrix upon suitable reshaping. Global unitarity is…
We study a class of filters -- discrete finite-state transition systems employed as incremental stream transducers -- that have application to robotics: e.g., to model combinatorial estimators and also as concise encodings of feedback…
We study a subclass of POMDPs, called Deterministic POMDPs, that is characterized by deterministic actions and observations. These models do not provide the same generality of POMDPs yet they capture a number of interesting and challenging…
Stochastic monotonicity is a well known partial order relation between probability measures defined on the same partially ordered set. Strassen Theorem establishes equivalence between stochastic monotonicity and the existence of a coupling…
Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention.…
Motivated by applications in conditional sampling, given a probability measure $\mu$ and a diffeomorphism $\phi$, we consider the problem of simultaneously approximating $\phi$ and the pushforward $\phi_{\#}\mu$ by means of the flow of a…
Modeling complex conditional distributions is critical in a variety of settings. Despite a long tradition of research into conditional density estimation, current methods employ either simple parametric forms or are difficult to learn in…
Interacting systems are prevalent in nature. It is challenging to accurately predict the dynamics of the system if its constituent components are analyzed independently. We develop a graph-based model that unveils the systemic interactions…
We give a complete structural characterisation of the map the positive branch of a one-way pattern implements. We start with the representation of the positive branch in terms of the phase map decomposition, which is then further analysed…
Normalizing flows are powerful non-parametric statistical models that function as a hybrid between density estimators and generative models. Current learning algorithms for normalizing flows assume that data points are sampled…
Speculative optimisation relies on the estimation of the probabilities that certain properties of the control flow are fulfilled. Concrete or estimated branch probabilities can be used for searching and constructing advantageous speculative…
We study a simple stochastic differential equation driven by one Brownian motion on a general oriented metric graph whose solutions are stochastic flows of kernels. Under some condition, we describe the laws of all solutions. This work is a…
We study a class of mass transport models where mass is transported in a preferred direction around a one-dimensional periodic lattice and is globally conserved. The model encompasses both discrete and continuous masses and parallel and…
This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…
This paper introduces assignment flows for density matrices as state spaces for representing and analyzing data associated with vertices of an underlying weighted graph. Determining an assignment flow by geometric integration of the…
This study introduces a procedure to obtain general expressions, $y = f(x)$, subject to linear constraints on the function and its derivatives defined at specified values. These constrained expressions can be used describe functions with…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
In the Optimal Velocity Model proposed as a new version of Car Following Model, it has been found that a congested flow is generated spontaneously from a homogeneous flow for a certain range of the traffic density. A well-established…