中文
相关论文

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

200 篇论文

This paper studies the asymptotic behavior of eigenvalues of random abelian G-circulant matrices, that is, matrices whose structure is related to a finite abelian group G in a way that naturally generalizes the relationship between…

概率论 · 数学 2012-08-17 Mark W. Meckes

We prove a collection of asymptotic density results for several interesting classes of the $I$-graphs. Specifically, we quantify precisely the proportion of $I$-graphs that are generalised Petersen graphs as well as those that are…

组合数学 · 数学 2024-12-30 Harrison Bohl , Adrian W. Dudek

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

群论 · 数学 2011-04-11 László Pyber , Endre Szabó

In this paper we study convergence of random walks, on finite quantum groups, arising from linear combination of irreducible characters. We bound the distance to the Haar state and determine the asymptotic behavior, i.e. the limit state if…

量子代数 · 数学 2019-05-14 Isabelle Baraquin

We calculate the spectra and spectral measures associated to random walks on restricted wreath products of finite groups with the infinite cyclic group, by calculating the Kesten-von Neumann-Serre spectral measures for the random walks on…

群论 · 数学 2007-05-23 Mark Kambites , Pedro V. Silva , Benjamin Steinberg

In this paper we establish asymptotics (as the size of the graph grows to infinity) for the expected number of cliques in the Chung--Lu inhomogeneous random graph model in which vertices are assigned independent weights which have tail…

概率论 · 数学 2024-11-08 Fraser Daly , Alastair Haig , Seva Shneer

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

组合数学 · 数学 2007-05-23 Bernhard Krön , Elmar Teufl

We show that some classical results on expander graphs imply growth results on normal subsets in finite simple groups. As one application, it is shown that given a nontrivial normal subset $ A $ of a finite simple group $ G $ of Lie type of…

群论 · 数学 2024-06-19 Saveliy V. Skresanov

In this article we investigate consistency and asymptotic normality of the maximum likelihood and the posterior distribution of the parameters in the context of state space stochastic differential equations (SDEs). We then extend our…

统计理论 · 数学 2018-11-13 Trisha Maitra , Sourabh Bhattacharya

Let M be a compact smooth manifold of dimension n with or without boundary, and f : M $\rightarrow$ R be a smooth Gaussian random field. It is very natural to suppose that for a large positive real u, the random excursion set {f $\ge$ u} is…

概率论 · 数学 2021-04-13 Damien Gayet

We obtain bivariate asymptotics for the number of (unicellular) combinatorial maps (a model of discrete surfaces) as both the size and the genus grow. This work is related to two research topics that have been very active recently:…

组合数学 · 数学 2026-04-14 Andrew Elvey Price , Wenjie Fang , Baptiste Louf , Michael Wallner

The paper investigates the asymptotic behavior of (non-normalized) traces of certain classes of matrices with non-commutative random variables as entries. We show that, unlike in the commutative framework, the asymptotic behavior of…

算子代数 · 数学 2013-04-02 Mihai Popa , yong Jiao

We are interested in various aspects of spectral rigidity of Cayley and Schreier graphs of finitely generated groups. For each pair of integers $d\geq 2$ and $m \ge 1$, we consider an uncountable family of groups of automorphisms of the…

群论 · 数学 2025-12-19 Rostislav Grigorchuk , Tatiana Nagnibeda , Aitor Pérez

We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…

概率论 · 数学 2007-05-23 Konstantin Borovkov , Vladimir Vatutin

The density of a subgroupoid with respect to a free groupoid is defined as the asymptotic ratio of their growths. This notion can be interpreted as a generalisation of the index's inverse for groups or as the probability of an element…

组合数学 · 数学 2024-07-24 Carles Cardó

The purpose of this paper is twofold. First, we present a conjecture to the effect that the ranks of the syzygy modules of a smooth projective variety become normally distributed as the positivity of the embedding line bundle grows. Then,…

代数几何 · 数学 2018-04-30 Lawrence Ein , Daniel Erman , Robert Lazarsfeld

Frequentists' inference often delivers point estimators associated with confidence intervals or sets for parameters of interest. Constructing the confidence intervals or sets requires understanding the sampling distributions of the point…

统计理论 · 数学 2016-10-18 Xinran Li , Peng Ding

We study some spectral properties of random walks on infinite countable amenable groups with an emphasis on locally finite groups, e.g. the infinite symmetric group. On locally finite groups, the random walks under consideration are driven…

谱理论 · 数学 2016-08-26 Alexander Bendikov , Barbara Bobikau , Christophe Pittet

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

数论 · 数学 2009-05-20 Gyan Prakash

Given a class $\mathcal G$ of graphs, let ${\mathcal G}_n$ denote the set of graphs in $\mathcal G$ on vertex set $[n]$. For certain classes $\mathcal G$, we are interested in the asymptotic behaviour of a random graph $R_n$ sampled…

组合数学 · 数学 2022-09-22 Colin McDiarmid