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

In this article, we propose to initiate the general study of involution systems. An {\em involution system}, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a {\em weak order} arising from orienting the…

For a discrete two-state quantum walk (QW) on the half-line with a general condition at the boundary, we formulate and prove a weak limit theorem describing the terminal behavior of its transition probabilities. In this context,…

We consider a qubit governed by a sequence of weak measurements, with the measurement strength modified in a time- and state-dependent manner. The resulting trajectory of the qubit in the phase space can be weakly controlled without any…

We consider the simple random walk on random graphs generated by discrete point processes. This random graph has a random subset of a cubic lattice as the vertices and lines between any consecutive vertices on lines parallel to each…

Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…

Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…

We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…

We consider weakly interacting diffusions on time varying random graphs. The system consists of a large number of nodes in which the state of each node is governed by a diffusion process that is influenced by the neighboring nodes. The…

We classify all quotients $W/W_J$ up to isomorphism in Bruhat order, with $(W,S)$ a Coxeter system and $W_J$ a parabolic subgroup of $W$. In particular, the non-trivial isomorphisms fall into a small number of cases which are highly…

Let $G$ be a finitely generated group of polynomial volume growth equipped with a word-length $|\cdot|$. The goal of this paper is to develop techniques to study the behavior of random walks driven by symmetric measures $\mu$ such that, for…

Consider the invariance principle for a random walk with random environment (denoted by $\mu$) in time on $\bfR$ in a weak quenched sense. We show that a sequence of the random probability measures on $\bfR$ generated by a bounded Lipschitz…

We investigate the first-passage properties of bursty random walks on a finite one-dimensional interval of length L, in which unit-length steps to the left occur with probability close to one, while steps of length b to the right --…

There is a well-known classification of conjugacy classes of involutions in finite Coxeter groups, in terms of subsets of nodes of their Coxeter graphs. In many cases, the product of an involution with the longest element is again an…

We begin by giving a new proof of the equivalence between the Liouville property and vanishing of the drift for symmetric random walks with finite first moments on finitely generated groups; a result which was first established by…

Algorithms for node clustering typically focus on finding homophilous structure in graphs. That is, they find sets of similar nodes with many edges within, rather than across, the clusters. However, graphs often also exhibit heterophilous…

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…

Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…

We formulate and prove a general weak limit theorem for quantum random walks in one and more dimensions. With $X_n$ denoting position at time $n$, we show that $X_n/n$ converges weakly as $n \to \infty$ to a certain distribution which is…

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…

We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…