相关论文: Expected Depth of Random Walks on Groups

Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq 1$, where $(g_n)_{n\geq 1}$ is a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group ${\rm GL}(V)$ with $V=\mathbb R^d$.…

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

Let $G$ be a connected Lie group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. In this paper, we introduce the notion of the length…

We study the problem of detecting a random walk on a graph from a sequence of noisy measurements at every node. There are two hypotheses: either every observation is just meaningless zero-mean Gaussian noise, or at each time step exactly…

Network geometries are typically characterized by having a finite spectral dimension (SD), $d_{s}$ that characterizes the return time distribution of a random walk on a graph. The main purpose of this work is to determine the SD of a…

We prove a new inequality bounding the probability that the random walk on a group has small total displacement in terms of the spectral and isoperimetric profiles of the group. This inequality implies that if the random walk on the group…

We define and study analogs of probabilistic tree embedding and tree cover for directed graphs. We define the notion of a DAG cover of a general directed graph $G$: a small collection $D_1,\dots D_g$ of DAGs so that for all pairs of…

Gray and Ruskuc have shown that any group G occurs as the maximal subgroup of some free idempotent generated semigroup IG(E) on a biordered set of idempotents E, thus resolving a long standing open question. Given the group G, they make a…

The {\it Randi\'c index} $R(G)$ of a graph $G$ is defined as the sum of 1/\sqrt{d_ud_v} over all edges $uv$ of $G$, where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v,$ respectively. Let $D(G)$ be the diameter of $G$ when $G$ is…

Let G be a group, and let M=(m_n) be a sequence of finitely supported probability measures on G. Consider the probability that two elements chosen independently according to m_n commute. Antolin, Martino and Ventura define the 'degree of…

PageRank, the prestige measure for Web pages used by Google, is the stationary probability of a peculiar random walk on directed graphs, which interpolates between a pure random walk and a process where all nodes have the same probability…

In this paper, we study random walks on groups that contain superlinear divergent geodesics, in the line of thoughts of Goldsborough-Sisto. The existence of a superlinear divergent geodesic is a quasi-isometry invariant which allows us to…

For a connected graph $G$ with order $n$ and an integer $k\geq 1$, we denote by $$S_k(D(G))=\lambda_1(D(G))+\cdots+\lambda_k(D(G))$$ the sum of $k$ largest distance eigenvalues of $G$. In this paper, we consider the sharp upper bound and…

Random walks in random scenery are processes defined by $$Z_n:=\sum_{k=1}^n\omega_{S_k}$$ where $S:=(S_k,k\ge 0)$ is a random walk evolving in $\mathbb{Z}^d$ and $\omega:=(\omega_x, x\in{\mathbb Z}^d)$ is a sequence of i.i.d. real random…

Researchers have designed many algorithms to measure the distances between graph nodes, such as average hitting times of random walks, cosine distances from DeepWalk, personalized PageRank, etc. Successful although these algorithms are,…

Normal residual finiteness growth measures how well a finitely generated group is approximated by its finite quotients. We show that any linear group $\Gamma \leq \mathrm{GL}_d(K)$ has normal residual finiteness growth asymptotically…

We define a notion of depth for an inclusion of multimatrix algebras B < A based on a comparison of powers of the induction-restriction table M (and its transpose matrix). This notion of depth coincides with the depth from [Kadison, 2008].…

It is known that every infinite index quasi-convex subgroup $H$ of a non-elementary hyperbolic group $G$ is a free factor in a larger quasi-convex subgroup of $G$. We give a probabilistic generalization of this result. That is, we show that…

Let $G$ be a finite group and let $H$ be a subgroup of $G$. The left-invariant random walk driven by a probability measure $w$ on $G$ is the Markov chain in which from any state $x \in G$, the probability of stepping to $xg \in G$ is…

We study the average probability that a discrete-time quantum walk finds a marked vertex on a graph. We first show that, for a regular graph, the spectrum of the transition matrix is determined by the weighted adjacency matrix of an…