Related papers: Walks in the quadrant with interacting boundaries …
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
Genetic and evolution algebras arise naturally from applied probability and stochastic processes. Gibbs measures describe interacting systems commonly studied in thermodynamics and statistical mechanics with applications in several fields.…
We discuss time-dependent factorial cumulants in interacting nano-scale systems. Recent theoretical work has shown that the full counting statistics of non-interacting electrons in a two-terminal conductor is always generalized binomial and…
We establish a novel type of connection between random walks and analytic number theory. Working with a random walk on the circle group $\mathbb{R}/\mathbb{Z}$ in which each step is a random integer multiple of a given quadratic irrational…
Growing dimensionality of data calls for beyond-pairwise interactions quantification. Measures of multidimensional interactions quantification are hindered, among others, by two issues: 1. Interpretation difficulties, 2. the curse of…
Some stochastic systems are particularly interesting as they exhibit critical behavior without fine-tuning of a parameter, a phenomenon called self-organized criticality. In the context of driven-dissipative steady states, one of the main…
In this paper we study the kinetics of diffusion-limited, pseudo-first-order A + B -> B reactions in situations in which the particles' intrinsic reactivities vary randomly in time. That is, we suppose that the particles are bearing "gates"…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…
In this paper, we present a novel approach based on the random walk process for finding meaningful representations of a graph model. Our approach leverages the transient behavior of many short random walks with novel initialization…
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…
Community assembly is studied using individual-based multispecies models. The models have stochastic population dynamics with mutation, migration, and extinction of species. Mutants appear as a result of mutation of the resident species,…
We develop an agent-based model on a lattice to investigate territorial development motivated by markings such as graffiti, generalizing a previously-published model to account for $K$ groups instead of two groups. We then analyze this…
Gessel walks are lattice paths confined to the quarter plane that start at the origin and consist of unit steps going either West, East, South-West or North-East. In 2001, Ira Gessel conjectured a nice closed-form expression for the number…
In this paper, we construct families of polynomials defined by recurrence relations related to mean-zero random walks. We show these families of polynomials can be used to approximate $z^n$ by a polynomial of degree $\sim \sqrt{n}$ in…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is extended to include the possibility of creating and annihilating random walkers. Steady-state…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that…
Random walks on general graphs play an important role in the understanding of the general theory of stochastic processes. Beyond their fundamental interest in probability theory, they arise also as simple models of physical systems. A brief…
We consider the edge-reinforced random walk with multiple (but finitely many) walkers which influence the edge weights together. The walker which moves at a given time step is chosen uniformly at random, or according to a fixed order.…