相关论文: The weak Bruhat order for random walks on Coxeter …

If $K$ is a closed subgroup of a compact group $G$, the probability that randomly chosen pair of elements from $K$ and $G$ commute is denoted by $Pr(K,G)$. Say that a subgroup $K\leq G$ is $\epsilon$-central in $G$ if $Pr(\langle g…

Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked…

It is well known that random walks in one dimensional random environment can exhibit subdiffusive behavior due to presence of traps. In this paper we show that the passage times of different traps are asymptotically independent exponential…

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

We consider a branching random walk in a random space-time environment of disasters where each particle is killed when meeting a disaster. This extends the model of the "random walk in a disastrous random environment" introduced by [15]. We…

Random walks play an important role in probing the structure of complex networks. On traditional networks, they can be used to extract community structure, understand node centrality, perform link prediction, or capture the similarity…

Let $\{X_n\}_{n\in\mathbb{N}}$ be a sequence of i.i.d. random variables in $\mathbb{Z}^d$. Let $S_k=X_1+...+X_k$ and $Y_n(t)$ be the continuous process on $[0,1]$ for which $Y_n(k/n)=S_k/\sqrt{n}$ $k=1,...,n$ and which is linearly…

We present our recent work on stochastic particle systems on complex networks. As a noninteracting system we first consider the diffusive motion of a random walker on heterogeneous complex networks. We find that the random walker is…

Consider a system of coalescing random walks where each individual performs random walk over a finite graph G, or (more generally) evolves according to some reversible Markov chain generator Q. Let C be the first time at which all walkers…

Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…

We introduce a model of interacting random walkers on a finite one dimensional chain with absorbing boundaries or targets at the ends. Walkers are of two types: informed particles that move ballistically towards a given target, and…

We construct the algebra of fractions of a Weak Bialgebra relative to a suitable denominator set of group-like elements that is `almost central', a condition we introduce in the present article which is sufficient in order to guarantee…

Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph…

In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…

The investigation of random walks is central to a variety of stochastic processes in physics, chemistry, and biology. To describe a transport phenomenon, we study a variant of the one-dimensional persistent random walk, which we call a…

When it comes to random walk on the integers $\mathbb{Z}$, the arguably first step of generalization beyond simple random walk is the class of one-sidedly continuous random walk, where the stepsize in only one direction is bounded by 1.…

For right-angled Coxeter groups $W_{\Gamma}$, we obtain a condition on $\Gamma$ that is necessary and sufficient to ensure that $W_{\Gamma}$ is thick and thus not relatively hyperbolic. We show that Coxeter groups which are not thick all…

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

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a…

The random walk of test particle in low-density gas is considered basing on approximate coarsened version of the collisional representation of the BBGKY equations. The coarsening presumes that momentum relaxation rates of the test particle…