Related papers: Numerical studies of variable-range hopping in one…
In this paper, we study different types of phase space structures which appear in the context of relativistic chaotic scattering. By using the relativistic version of the H\'{e}non-Heiles Hamiltonian, we numerically study the topology of…
This paper formulates a variational approach for treating observational uncertainty and/or computational model errors as stochastic transport in dynamical systems governed by action principles under nonholonomic constraints. For this…
We address some open questions regarding the phase diagram of the one-dimensional Hubbard model with asymmetric hopping coefficients and balanced species. In the attractive regime we present a numerical study of the passage from on-site…
The mobility of an overdamped particle, in a periodic potential tilted by a constant external field and moving in a medium with periodic friction coefficient is examined. When the potential and the friction coefficient have the same…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…
Optimal transport (OT) is a versatile framework for comparing probability measures, with many applications to statistics, machine learning, and applied mathematics. However, OT distances suffer from computational and statistical scalability…
Statistical mechanics of a small system of cars on a single-lane road is developed. The system is not characterized by a Hamiltonian but by a conditional probability of a velocity of a car for the given velocity and distance of the car…
We consider the dynamics of the disordered, one-dimensional, symmetric zero range process in which a particle from an occupied site $k$ hops to its nearest neighbour with a quenched rate $w(k)$. These rates are chosen randomly from the…
This is a preliminary study for bifurcation in fractional order dynamical systems. Stability, persistence and hopf bifurcation are studied. Some studies are also done for functional equations.
A mechanism of $1/f$ noise due to traps formed by impurities which have no neighbors with close energies in their vicinity is studied. Such traps slowly exchange electrons with the rest of conducting media. The concentration of traps and…
Stochastic systems characterised by a random driving in a form of the general stable noise are considered. The particle experiences long rests due to the traps the density of which is position-dependent and obeys a power-law form attributed…
We studied electrical resistance of a single-crystalline SmB6 sample with a focus on the region of the "low-temperature resistivity plateau". Our observations did not show any true saturation of the electrical resistance at temperatures…
We review various numerical approaches to compute transport coefficients in molecular dynamics. These approaches can be broadly classified into three groups: (i) nonequilibrium methods based on applying an external driving field to the…
The transport properties of discrete-time random walks on ring networks with deterministic shortcuts are investigated through analytical and numerical methods. The network consists of a periodic chain where each node is connected to its…
We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements,…
We study, via combinatorial enumeration, the probability of k-hop connection between two nodes in a wireless multi-hop network. This addresses the difficulty of providing an exact formula for the scaling of hop counts with Euclidean…
In our paper we provide mathematical analysis of a probabilistic long-hop routing algorithms which uses as the randomizing factor the estimate of distance of a station from the previous-hop source of the message.
For a random walk on a confined one-dimensional domain, we consider mean first passage times (MFPT) in the presence of a mobile trap. The question we address is whether a mobile trap can improve capture times over a stationary trap. We…
We introduce a path sampling method for obtaining statistical properties of an arbitrary stochastic dynamics. The method works by decomposing a trajectory in time, estimating the probability of satisfying a progress constraint, modifying…