相关论文: Trapping of Continuous-Time Quantum walks on Erdos…
We consider random walks on $\Z^d$ among nearest-neighbor random conductances which are i.i.d., positive, bounded uniformly from above but whose support extends all the way to zero. Our focus is on the detailed properties of the paths of…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
We study the long-time tails of the survival probability $P(t)$ of an $A$ particle diffusing in $d$-dimensional media in the presence of a concentration $\rho$ of traps $B$ that move sub-diffusively, such that the mean square displacement…
We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with…
The dynamics of quantum degenerate two-dimensional dipolar excitons confined in electrostatic traps is analyzed and compared to recent experiments. The model results stress the importance of artificial trapping for achieving and sustaining…
We consider a one-dimensional simple random walk surviving among a field of static soft traps : each time it meets a trap the walk is killed with probability 1--e --$\beta$ , where $\beta$ is a positive and fixed parameter. The positions of…
Motivated by the dissipative abelian sandpile model, we analyze the trajectories of a one-dimensional random walk in a landscape of soft traps. These traps, placed at increasing distances from each other, correspond to dissipative sites in…
We study the existence and charaterization of self-trapping phenomena in discrete-time quantum walks. By considering a Kerr-like nonlinearity, we associate an acquisition of the intensity-dependent phase to the walker while it propagates on…
One of the key performance measures in queueing systems is the exponential decay rate of the steady-state tail probabilities of the queue lengths. It is known that if a corresponding fluid model is stable and the stochastic primitives have…
We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…
Coherent transport of an excitation through a network corresponds to continuous-time quantum walk on a graph, and the transport properties of the system may be radically different depending on the graph and on the initial state. The…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
We introduce a general model of trapping for random walks on graphs. We give the possible scaling limits of these Randomly Trapped Random Walks on $\mathbb {Z}$. These scaling limits include the well-known fractional kinetics process, the…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked…
We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…
Incoherent transport of excitations in one-dimensional disordered lattices with pairs of traps placed at random is studied by numerically solving the corresponding master equation. Results are compared to the case of lattices with the same…
Discrete time quantum walks (DTQWs) are nontrivial generalizations of random walks with a broad scope of applications. In particular, they can be used as computational primitives, and they are suitable tools for simulating other quantum…
In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…
We undertake a detailed analysis of ergodicity for homogeneous discrete-time quantum walks on the integer lattice. The most significant result of our paper holds in dimension one, and gives a complete equivalence between the absolutely…