Related papers: Comment on "Efficient, multiple-range random walk …

The problem of missing link prediction in complex networks has attracted much attention recently. Two difficulties in link prediction are the sparsity and huge size of the target networks. Therefore, the design of an efficient and effective…

We reply to Comment by J. Gemmer, L. Knipschild, R. Steinigeweg (arXiv:1712.02128) on our paper Phys. Rev. Lett. 119, 100601 (2017).

Triangulations are important objects of study in combinatorics, finite element simulations and quantum gravity, where its entropy is crucial for many physical properties. Due to their inherent complex topological structure even the number…

We implement the Wang-Landau algorithm in the context of SU(N) lattice gauge theories. We study the quenched, reduced version of the lattice theory and calculate its density of states for N=20,30,40,50. We introduce a variant of the…

In a recent Brief Report, Lee et al. [L. Lee, D. Ahn, and S.W. Hwang, Phys. Rev. A 66, 024304 (2002)] have claimed that using pairwise entangled qubits gives rise to an exponentially more efficient dense coding when two parties are involved…

In this paper, we study the properties of lackadaisical quantum walks on a line. This model is first proposed in~\cite{wong2015grover} as a quantum analogue of lazy random walks where each vertex is attached $\tau$ self-loops. We derive an…

In a recent paper, the authors proposed a new class of low-complexity iterative thresholding algorithms for reconstructing sparse signals from a small set of linear measurements \cite{DMM}. The new algorithms are broadly referred to as AMP,…

This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the…

Computing the reachability probability in infinite state probabilistic models has been the topic of numerous works. Here we introduce a new property called \emph{divergence} that when satisfied allows to compute reachability probabilities…

In the eighties, A. Connes and E. J. Woods made a connection between hyperfinite von Neumann algebras and Poisson boundaries of time dependent random walks. The present paper explains this connection and gives a detailed proof of two…

In [1] Zhu and Rabitz presented a rapidly convergent iterative algorithm for optimal control of the expectation value of a positive definite observable in a pure-state quantum system. In this paper we generalize this algorithm to a quantum…

This paper extends the result of Broniatowski and Caron (2013) pertaining to the asymptotic distribution of a random walk conditioned on its final value as the number of summands increase. We consider multivariate light-tailed random walk…

This article is concerned with numerical methods to approximate effective coefficients in stochastic homogenization of discrete linear elliptic equations, and their numerical analysis --- which has been made possible by recent contributions…

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…

After beginning with a short historical review of the concept of displaced (coherent) and squeezed states, we discuss previous (often forgotten) work on displaced and squeezed number states. Next, we obtain the most general displaced and…

Randomness plays a key role in the design of attacks on cryptographic systems and cyber security algorithms in general. Random walks and quantum walks are powerful tools for mastering random phenomena. In this article, I propose a…

In dealing with thermal transport in composite systems, high contrast materials pose a special problem for numerical simulation: the time scale or step size in the high conductivity material must be much smaller than in the low conductivity…

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.

We propose a class of models of random walks in a random environment where an exact solution can be given for a stationary distribution. The tool is the detailed balance equations.

Random walk is a fundamental concept with applications ranging from quantum physics to econometrics. Remarkably, one specific model of random walks appears to be ubiquitous across many fields as a tool to analyze transport phenomena in…