Related papers: Universal adaptive self-stabilizing traversal sche…
In this work we seek to generalize the connection between traversable wormholes and quantum channels. We do this via a connection between traversable wormholes and graph geometries on which we can perform quantum random walks for signal…
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…
We address continuous-time quantum walks on graphs in the presence of time- and space-dependent noise. Noise is modeled as generalized dynamical percolation, i.e. classical time-dependent fluctuations affecting the tunneling amplitudes of…
We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…
Learning a diverse set of skills by interacting with an environment without any external supervision is an important challenge. In particular, obtaining a goal-conditioned agent that can reach any given state is useful in many applications.…
We examine a class of random walks in random environments on $\mathbb{Z}$ with bounded jumps, a generalization of the classic one-dimensional model. The environments we study have i.i.d. transition probability vectors drawn from Dirichlet…
Applied to statistical physics models, the random cost algorithm enforces a Random Walk (RW) in energy (or possibly other thermodynamic quantities). The dynamics of this procedure is distinct from fixed weight updates. The probability for a…
Dynamic systems characterized by diversified evolutions are not only more flexible, but also more resilient to attacks, failures and changing conditions. This article addresses the quantification of the diversity of non-linear transient…
With the ease of deployment, capabilities of evading the jammers and obscuring their existence, unmanned aerial vehicles (UAVs) are one of the most suitable candidates to perform surveillance. There exists a body of literature in which the…
We introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…
Over the last few years, network science has proved to be useful in modeling a variety of complex systems, composed of a large number of interconnected units. The intricate pattern of interactions often allows the system to achieve complex…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
We consider a dynamical process in a network which distributes all particles (tokens) located at a node among its neighbors, in a round-robin manner. We show that in the recurrent state of this dynamics (i.e., disregarding a polynomially…
We study in-network computation on general network topologies. Specifically, we are given the description of a function, and a network with distinct nodes at which the operands of the function are made available, and a designated sink where…
We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…
Quantum walk research has mainly focused on evolutions due to repeated applications of time-independent unitary coin operators. However, the idea of controlling the single particle evolution using time-dependent unitary coins has still been…
The random walk in Dirichlet environment is a random walk in random environment where the transition probabilities are independent Dirichlet random variables. This random walk exhibits a property of statistical invariance by time-reversal…
We study the cover time of random walk on dynamical percolation on the torus $\mathbb{Z}_n^d$ in the subcritical regime. In this model, introduced by Peres, Stauffer and Steif, each edge updates at rate $\mu$ to open with probability $p$…
Efficiently exploiting the resources of data centers is a complex task that requires efficient and reliable load balancing and resource allocation algorithms. The former are in charge of assigning jobs to servers upon their arrival in the…
We study the transport properties of nonautonomous chaotic dynamical systems over a finite time duration. We are particularly interested in those regions that remain coherent and relatively non-dispersive over finite periods of time,…