Related papers: Determinism in the one-way model
In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as products of unitary transformations, which are the…
We introduce the notion of a generalized flow on a graph with coefficients in a R-representation and show that the module of flows is isomorphic to the first derived functor of the colimit. We generalize Kirchhoff's laws and build an exact…
We consider a basic model of a dynamical distribution network, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
We propose a minimal model for the emergence of a directed flow in autonomous Hamiltonian systems. It is shown that internal breaking of the spatio-temporal symmetries, via localised initial conditions, that are unbiased with respect to the…
A variational principle is derived for two-dimensional incompressible rotational fluid flow with a free surface in a moving vessel when both the vessel and fluid motion are to be determined. The fluid is represented by a stream function and…
We propose OneFlow - a flow-based one-class classifier for anomaly (outlier) detection that finds a minimal volume bounding region. Contrary to density-based methods, OneFlow is constructed in such a way that its result typically does not…
We define two conformal structures on $S^1$ which give rise to a different view of the affine curvature flow and a new curvature flow, the ``$Q$-curvature flow". The steady state of these flows are studied. More specifically, we prove four…
We extend flow matching to ensembles of linear systems in both deterministic and stochastic settings. Averaging over system parameters induces memory leading to a non-Markovian interpolation problem for the stochastic case. In this setting,…
The spectra of parallel flows (that is, flows governed by first-order differential operators parallel to one direction) are investigated, on both $L^2$ spaces and weighted-$L^2$ spaces. As a consequence, an example of a flow admitting a…
Stochastic mass transport models are usually described by specifying hopping rates of particles between sites of a given lattice, and the goal is to predict the existence and properties of the steady state. Here we ask the reverse question:…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
Understanding the dependencies among features of a dataset is at the core of most unsupervised learning tasks. However, a majority of generative modeling approaches are focused solely on the joint distribution $p(x)$ and utilize models…
We study time- and parameter-dependent ordinary differential equations in the geometric setting of vector fields and their flows. Various degrees of regularities in state are considered, including Lipschitz, finitely diferentiable, smooth,…
When using ordinal patterns, which describe the ordinal structure within a data vector, the problem of ties appeared permanently. So far, model classes were used which do not allow for ties; randomization has been another attempt to…
Flow-based generative modeling in continuous spaces exploit Tweedie's formula to express the denoiser (learned in training) as a score function (used in sampling). In contrast, this relation has been largely missing in the discrete setting…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
We study the dynamical evolution toward steady state of the stochastic non-equilibrium model known as totally asymmetric simple exclusion process, in both uniform and non-uniform (staggered) one-dimensional systems with open boundaries.…
We present parity conditions under which a toy rail network is one-way, i.e., whether a direction can be assigned across the network so that all train journeys are completely consistent with it or completely consistent with its opposite. We…