Related papers: Algebraic decay in hierarchical graphs

The behaviors of one-dimensional quantum random walks are strikingly different from those of classical ones. However, when decoherence is involved, the limiting distributions take on many classical features over time. In this paper, we…

We consider the range of a one-parameter family of self-interacting walks on the integers up to the time of exit from an interval. We derive the weak convergence of an appropriately scaled range. We show that the distribution functions of…

Stationary probability distributions of one-dimensional random walks on lattices with aperiodic disorder are investigated. The pattern of the distribution is closely related to the diffusional behavior, which depends on the wandering…

We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…

We consider Gallai's graph Modular Decomposition theory for network analytics. On the one hand, by arguing that this is a choice tool for understanding structural and functional similarities among nodes in a network. On the other, by…

Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient. Other properties like a giant component, the small world…

We consider one-dimensional discrete Dirac models in vanishing random environments. In a previous work [6], we showed that these models exhibit a rich phase diagram in terms of their spectrum as a function of the rate of decay of the random…

We provide a detailed analysis of the survival probability of the Grover walk on the ladder graph with an absorbing sink. This model was discussed in Mare\v s et al., Phys. Rev. A 101, 032113 (2020), as an example of counter-intuitive…

We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…

We focus on the algebraic area probability distribution of planar random walks on a square lattice with $m_1$, $m_2$, $l_1$ and $l_2$ steps right, left, up and down. We aim, in particular, at the algebraic area generating function…

We provide a sufficient criterion for the recurrence of spatial random graphs on the real line based on the scarceness of long-edges. In particular, this complements earlier recurrence results obtained by Gracar et al. (Electron. J. Probab.…

In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step towards this objective, the following question is being…

Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…

Discrete time random walks, in which a step of random sign but constant length $\delta x$ is performed after each time interval $\delta t$, are widely used models for stochastic processes. In the case of a correlated random walk, the next…

We study a random walk model in which the jumping probability to a site is dependent on the number of previous visits to the site, as a model of the mobility with memory. To this end we introduce two parameters called the memory parameter…

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 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…

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

We study the statistical properties of the area and the absolute area under the trajectories of subdiffusive random walks. Using different frameworks to describe subdiffusion (as the scaled Brownian motion, fractional Brownian motion, the…

In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process, which may serve as a mobile wireless network model. The transition probability matrix…