Related papers: The Coppersmith-Tetali-Winkler Identity for Mechan…
We use simple deterministic dynamical systems as coins in studying quantum walks. These dynamical systems can be chosen to display, in the classical limit, a range of behaviors from the integrable to chaotic, or deterministically random. As…
A $(K+1)-$plet of non-Hermitian and time-dependent operators (say, $\Lambda_j(t)$, $j=0,1,\ldots,K$) can be interpreted as the set of observables characterizing a unitary quantum system. What is required is the existence of a self-adjoint…
The authors propose a new variation of random walks called ladder chains $L(r,s,p)$. We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take $L(2,2,p)$ for instance, we find…
We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…
We study asymptotic properties of spatially non-homogeneous random walks with non-integrable increments, including transience, almost-sure bounds, and existence and non-existence of moments for first-passage and last-exit times. In our…
The characterization of the Hamiltonian parameters defining a quantum walk is of paramount importance when performing a variety of tasks, from quantum communication to computation. When dealing with physical implementations of quantum…
Focusing on a continuous-time quantum walk on $\mathbb{Z}=\left\{0,\pm 1,\pm 2,\ldots\right\}$, we analyze a probability distribution with which the quantum walker is observed at a position. The walker launches off at a localized state and…
A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
A Ward-Takahashi identity, as a consequence of gauge invariance and in a form that relates self-energy to the two-particle Bethe-Salpeter scattering kernel, was first derived by Vollhardt and W\"{o}lfle for a system of independent particles…
Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition…
By using the Hamilton-Jacobi [HJ] framework the topological theories associated with Euler and Pontryagin classes are analyzed. We report the construction of a fundamental $HJ$ differential where the characteristic equations and the…
We study random walks on a family of treelike regular fractals with a trap fixed on a central node. We obtain all the eigenvalues and their corresponding multiplicities for the associated stochastic master equation, with the eigenvalues…
We consider the possible visits to visible points of a random walker moving up and right in the integer lattice (with probability $\alpha$ and $1-\alpha$, respectively) and starting from the origin. We show that, almost surely, the…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
We study Hamiltonian walks (HWs) on Sierpinski and $n$--simplex fractals. Via numerical analysis of exact recursion relations for the number of HWs we calculate the connectivity constant $\omega$ and find the asymptotic behaviour of the…
Gauge invariance of systems whose Hamilton-Jacobi equation is separable is improved by adding surface terms to the action fuctional. The general form of these terms is given for some complete solutions of the Hamilton-Jacobi equation. The…
We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…
Hybrid dynamical systems with nonlinear dynamics are one of the most general modeling tools for representing robotic systems, especially contact-rich systems. However, providing guarantees regarding the safety or performance of nonlinear…
Several cycle lexicographical orders are found to describe the relative likelihood of elements of the random walks on the symmetric group generated by the conjugacy classes of transpositions, 3-cycles, and n-cycles. Spectral analysis finds…