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

We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new…

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

Known and new results on free Boolean topological groups are collected. An account of properties which these groups share with free or free Abelian topological groups and properties specific of free Boolean groups is given. Special emphasis…

We consider sequences of needlet random fields defined as weighted averaged forms of spherical Gaussian eigenfunctions. Our main result is a Central Limit Theorem in the high energy setting, for the boundary lengths of their excursion sets.…

Approximate Bayesian computation allows for statistical analysis in models with intractable likelihoods. In this paper we consider the asymptotic behaviour of the posterior distribution obtained by this method. We give general results on…

Random geometric graphs are widely used in modeling geometry and dependence structure in networks. In a random geometric graph, nodes are independently generated from some probability distribution $F$ over a metric space, and edges link…

For every finite generating set on the integer Heisenberg group H(Z), Pansu showed that the word metric has the large-scale structure of a Carnot-Caratheodory Finsler metric on the real Heisenberg group H(R). We study the properties of…

We study the number of $k$-element sets $A \subset \{1,\ldots,N\}$ with $|A + A| \leq K|A|$ for some (fixed) $K > 0$. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a…

Much is known about random right-angled Coxeter groups (i.e., right-angled Coxeter groups whose defining graphs are random graphs under the Erd\"os-R\'enyi model). In this paper, we extend this model to study random general Coxeter groups…

We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…

We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…

Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the first type are permutations turning the order upside down, and…

We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…

We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to…

Random forests remain among the most popular off-the-shelf supervised learning algorithms. Despite their well-documented empirical success, however, until recently, few theoretical results were available to describe their performance and…

We exhibit an infinite family of snowflake groups all of whose asymptotic cones are simply connected. Our groups have neither polynomial growth nor quadratic Dehn function, the two usual sources of this phenomenon. We further show that each…

We prove that a suitably de-biased version of Chatterjee's rank correlation based on i.i.d. copies of a random vector $(X,Y)$ is asymptotically normal whenever $Y$ is not almost surely constant. No further conditions on the joint…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

In this work we characterise Cayley graphs of Coxeter groups with respect to the standard generating set that admit uncountable vertex stabilisers. As a corollary, we fully identify finitely generated Coxeter groups for which the…

Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word counts exhibits a rich asymptotic structure. We investigate all…