相关论文: Random Walk and Diffusion on a Smash Line Algebra

We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…

This paper studies particle propagation in a one-dimensional inhomogeneous medium where the laws of motion are generated by chaotic and deterministic local maps. Assuming that the particle's initial location is random and uniformly…

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…

The comb model is a simplified description for anomalous diffusion under geometric constraints. It represents particles spreading out in a two-dimensional space where the motions in the x-direction are allowed only when the y coordinate of…

* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…

We analyse diffusion dynamics on weakly-coupled networks (interconnected networks) by means of separation of time scales. Using an adiabatic approximation we reduced the system dynamics to a Markov chain with aggregated variables and…

We extend the random-walk model of Vitvitska et al. for predicting the spins of dark matter halos from their merger histories. Using updated merger rates, orbital parameter distributions, and N-body constraints we show that this model can…

We investigate the linear statistics of random matrices with purely imaginary Bernoulli entries of the form $H_{pq} = \overline{H}_{qp} = \pm i$, that are either independently distributed or exhibit global correlations imposed by the…

The motion of self-propelled particles is modeled as a persistent random walk. An analytical framework is developed that allows the derivation of exact expressions for the time evolution of arbitrary moments of the persistent walk's…

The cover-time problem, i.e., time to visit every site in a system, is one of the key issues of random walks with wide applications in natural, social, and engineered systems. Addressing the full distribution of cover times for random walk…

We introduce the concept of a $\lambda$-Hopf algebra as a Hopf algebra obtained as the partial smash product algebra of a Hopf algebra and its base field, and show that every Hopf algebra is a $\lambda$-Hopf algebra. Moreover, a method to…

We consider a model of interacting random walkers on a triangular chain and triangular lattice, where a particle can move only if the other two sites of the triangle are unoccupied -- a kinetically-constrained hopping process (KCHP)…

We argue that existing training-free segmentation methods rely on an implicit and limiting assumption, that segmentation is a spectral graph partitioning problem over diffusion-derived affinities. Such approaches, based on global graph…

We consider a continuous-time random walk which is the generalization, by means of the introduction of waiting periods on sites, of the one-dimensional nonhomogeneous random walk with a position-dependent drift known in the mathematical…

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

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…

In this paper we study a one-dimensional quantum random walk with the Hadamard transformation which is often called the Hadamard walk. We construct the Hadamard walk using a transition matrix on probability amplitude and give some results…

We study a particle system with hopping (random walk) dynamics on the integer lattice $\mathbb Z^d$. The particles can exist in two states, active or inactive (sleeping); only the former can hop. The dynamics conserves the number of…

For an $n$-element subset $U$ of $\mathbb{Z}^2$, select $x$ from $U$ according to harmonic measure from infinity, remove $x$ from $U$, and start a random walk from $x$. If the walk leaves from $y$ when it first enters $U$, add $y$ to $U$.…

In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…