中文
相关论文

相关论文: Regular sets and counting in free groups

200 篇论文

We study the empirical process indexed by F^2=\{f^2 : f \in F\}, where F is a class of mean-zero functions on a probability space. We present a sharp bound on the supremum of that process which depends on the \psi_1 diameter of the class F…

泛函分析 · 数学 2010-05-06 Shahar Mendelson

A random spherical polytope $P_n$ in a spherically convex set $K \subset S^d$ as considered here is the spherical convex hull of $n$ independent, uniformly distributed random points in $K$. The behaviour of $P_n$ for a spherically convex…

概率论 · 数学 2015-05-19 Imre Bárány , Daniel Hug , Matthias Reitzner , Rolf Schneider

Let $G$ denote a finite abelian group with identity 1 and let $S$ denote an inverse-closed subset of $G \setminus {1}$, which generates $G$ and for which there exists $s \in S$, such that $\la S \setminus \{s,s^{-1}\} \ra \ne G$. In this…

组合数学 · 数学 2012-06-01 Stefko Miklavic , Primoz Sparl

Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…

统计理论 · 数学 2023-10-23 Adam B Kashlak

We study the Furstenberg-entropy realization problem for stationary actions. It is shown that for finitely supported probability measures on free groups, any a-priori possible entropy value can be realized as the entropy of an ergodic…

动力系统 · 数学 2019-02-20 Yair Hartman , Ariel Yadin

The intersection growth of a group $G$ is the asymptotic behavior of the index of the intersection of all subgroups of $G$ with index at most $n$, and measures the Hausdorff dimension of $G$ in profinite metrics. We study intersection…

Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…

群论 · 数学 2017-05-17 Michael W. Davis , Matthew Kahle

In this paper, the author (1) compares subnormal closures of finite sets in free groups; (2) proves that the exponential growth rate (e.g.r.), i.e., the limit of the n-th roots of g(n), where g(n) is the growth function of a subgroup H with…

群论 · 数学 2014-07-29 Alexander Olshanskii

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

数论 · 数学 2007-05-23 Igor Rivin

We consider the asymptotic joint distributions among several families of well-known metrics on $S_n$, the symmetric group. These include the bi-invariant metrics such as the Cayley and Hamming distance, and the left-invariant metrics such…

统计理论 · 数学 2011-10-05 Yunjiang Jiang

We introduce and study the concept of cyclicity degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be cyclic. Explicit formulas are obtained for some particular classes of finite groups. An…

群论 · 数学 2015-04-08 Marius Tărnăuceanu , László Tóth

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

概率论 · 数学 2018-10-09 Ruojun Huang

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…

几何拓扑 · 数学 2021-10-04 C. Abbott , M. Hull

In this paper, we give out a setting of an Diaconis and Freedman's chain in a multidimensional simplex and consider its asymptotic behavior. By using techniques in random iterated functions theory and quasi-compact operators theory, we…

概率论 · 数学 2020-06-04 Marc Peigné , Tat Dat Tran

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

组合数学 · 数学 2025-01-06 William Gasarch , James Glenn , Clyde Kruskal

For any countable group with infinite conjugacy classes we construct a family of forests on the group. For each of them there is a random walk on the group with the property that its sample paths almost surely converge to the geometric…

群论 · 数学 2019-03-07 Anna Erschler , Vadim Kaimanovich

Consider continuous-time random walks on Cayley graphs where the rate assigned to each edge depends only on the corresponding generator. We show that the limiting speed is monotone increasing in the rates for infinite Cayley graphs that…

概率论 · 数学 2022-10-03 Russell Lyons , Graham White

We continue the study of probabilistic and topological properties of the set of reals that are being guessed by a diamond sequence from \cite{Benhamou_Wu}. We show that the existence of sequence of a asymptotic growth $\pi$ which infinitely…

逻辑 · 数学 2026-01-27 Tom Benhamou , Sean LeClair

The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…

概率论 · 数学 2009-01-07 Miklos Bona , Philippe Flajolet

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

组合数学 · 数学 2012-06-15 Teena Carroll , David Galvin , Prasad Tetali
‹ 上一页 1 8 9 10 下一页 ›