Related papers: Transport on Adaptive Random Lattices
For chaotic cavities with scattering leads attached, transport properties can be approximated in terms of the classical trajectories which enter and exit the system. With a semiclassical treatment involving fine correlations between such…
In this paper, we present a neural network approach to address the dynamic unbalanced optimal transport problem on surfaces with point cloud representation. For surfaces with point cloud representation, traditional method is difficult to…
Active adaptive matter has attracted considerable interest due to its rich, largely unexplained dynamics and its relevance to a wide range of synthetic and biological materials. An important subclass of such systems consists of active…
While the transport of matter by wheeled vehicles or legged robots can be guaranteed in engineered landscapes like roads or rails, locomotion prediction in complex environments like collapsed buildings or crop fields remains challenging.…
Effective transport properties of heterogeneous structures are predicted by geometric microstructural parameters, but these can be difficult to calculate. Here, a boundary element code with a recurrent series method accurately and…
Recent work has studied fermion transport through a finite one-dimensional lattice of quantum dots, with localized particle loss from the central lattice site. The dots at each end of the lattice are connected to macroscopic leads,…
Precise control of quantum particles is required for many interesting or novel experiments. Here we consider the task of transporting an atom using an external harmonic potential from one well of an optical lattice to another without…
We introduce a new non-linear optimal transport formulation for a pair of probability measures on $\mathbb{R}^d$ sharing a common barycentre, in which admissible transference plans satisfy two martingale-type constraints. This bi-martingale…
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or node failures, traffic bursts, and topology changes, and…
We consider single-particle quantum transport on parametrized complex networks. Based on general arguments regarding the spectrum of the corresponding Hamiltonian, we derive bounds for a measure of the global transport efficiency defined by…
We theoretically show that the dynamics of a driven quantum harmonic oscillator subject to non-dissipative noise is formally equivalent to the single-particle dynamics propagating through an experimentally feasible dynamically-disordered…
Our work is motivated by the need for impromptu (or "as-you-go") deployment of relay nodes (for establishing a packet communication path with a control centre) by fire-men/commandos while operating in an unknown environment. We consider a…
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…
Inspired by the matching of supply to demand in logistical problems, the optimal transport (or Monge--Kantorovich) problem involves the matching of probability distributions defined over a geometric domain such as a surface or manifold. In…
The transport of many kinds of singular structures in a medium, such as vortex points/lines/sheets in fluids, dislocation loops in crystalline plastic solids, or topological singularities in magnetism, can be expressed in terms of the…
We introduce a new optimal transport distance between nonnegative finite Radon measures with possibly different masses. The construction is based on non-conservative continuity equations and a corresponding modified Benamou-Brenier formula.…
We address the dynamics of interacting particles on a disordered lattice formed by a random comb. The dynamics comprises that of the asymmetric simple exclusion process, whereby motion to nearest-neighour sites that are empty is more likely…
We consider transport over a strongly connected, directed graph. The scheduling amounts to selecting transition probabilities for a discrete-time Markov evolution which is designed to be consistent with certain initial and final marginals.…
We study a message passing model, applicable also to traffic problems. The model is implemented in a discrete lattice, where particles move towards their destination, with fluctuations around the minimal distance path. A repulsive…
This paper develops a systematic treatment of monotonicity-based pathwise dualities for Markov processes taking values in partially ordered sets. We show that every Markov process that takes values in a finite partially ordered set and…