Related papers: Birth-death chains on a spider: spectral analysis …
We construct a finite spin-1/2 chain model (quantum domino) interacting with a Fermi field, capable of emitting a scalar fermion from the last spin in the chain. The chain with dynamics gradually reversing the neighbouring spins emits…
In this work we consider open quantum random walks on the non-negative integers. By considering orthogonal matrix polynomials we are able to describe transition probability expressions for classes of walks via a matrix version of the…
It is shown that particles undergoing discrete-time jumps in 3D, starting at a distance r0 from the center of an adsorbing sphere of radius R, are captured with probability (R - c sigma)/r0 for r0 much greater than R, where c is related to…
We consider a discrete-time random motion, Markov chain on the Poincar\'{e} disk. In the basic variant of the model a particle moves along certain circular arcs within the disk, its location is determined by a composition of random…
We study the trace reconstruction problem for spider graphs. Let $n$ be the number of nodes of a spider and $d$ be the length of each leg, and suppose that we are given independent traces of the spider from a deletion channel in which each…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such a walk by studying the phase diagram…
Aldous' spectral gap conjecture, proven by Caputo, Liggett and Richthammer, states the following: for any set of transpositions in the symmetric group $\mathrm{Sym}(n)$, the spectral gap of the corresponding random walk on the group -- an…
We study the two-species symbiotic contact process (2SCP), recently proposed in [de Oliveira, Santos and Dickman, Phys. Rev. E {\bf 86}, 011121 (2012)] . In this model, each site of a lattice may be vacant or host single individuals of…
We investigate absorption, i.e., almost sure convergence to an absorbing state, in time-varying (non-homogeneous) discrete-time Markov chains with finite state space. We consider systems that can switch among a finite set of transition…
We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…
We investigate a model of a parasite population invading spatially distributed immobile hosts on a graph, which is a modification of the frog model. Each host has an unbreakable immunity against infection with a certain probability $1-p$…
In part 1 we identified a new coupling between death spikes and birth dips that occurs following catastrophic events such as influenza pandemics and earthquakes. Here we seek to characterize some of the key features. We introduce a transfer…
Many phenomena in solid-state physics can be understood in terms of their topological properties. Recently, controlled protocols of quantum walks are proving to be effective simulators of such phenomena. Here we report the realization of a…
We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of random-walk matrix-polynomial $$L_\alpha(G)=D-\sum_{r=1}^d\alpha_rD(D^{-1}A)^r$$ where $A$ is the adjacency matrix of a weighted,…
In recent years, non-parametric methods utilizing random walks on graphs have been used to solve a wide range of machine learning problems, but in their simplest form they do not scale well due to the quadratic complexity. In this paper, a…
This article is devoted to the development of analytical and numerical approaches to the problem of the end-to-end quantum state transfer along the spin-1/2 chain using two methods: (a) a homogeneous spin chain with week end bonds and equal…
The spectral form factor (SFF) is a powerful diagnostic of random matrix behavior in quantum many-body systems. We introduce a family of random circuit ensembles whose SFFs can be computed \textit{exactly}. These ensembles describe the…
We study the discrete-time evolution of a transformation on a set of probability measures that is up-dated combining independently the marginals on the atoms of partitions. This model was recently introduced in Baake, Baake and Salamat…
We address the discrete inverse conductance problem for well-connected spider networks; that is, to recover the conductance function on a well-connected spider network from the Dirichlet-to-Neumann map. It is well-known that this inverse…