Related papers: Regular sets and counting in free groups

We study randomly stopped sums via their asymptotic scales. First, finiteness of moments is considered. To generalise this study, asymptotic scales applicable to the class of all heavy-tailed random variables are used. The stopping is…

We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis to estimate the return probabilities of these random walks,…

We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (log_{d-1}|G|)^{1/2}/2 and that random d-regular Cayley graphs of simple algebraic groups over F_q asymptotically almost…

A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is…

The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…

We start by studying the distribution of (cyclically reduced) elements of the free groups Fn with respect to their abelianization (or equivalently, their integer homology class. We derive an explicit generating function, and a limiting…

We study the asymptotic behavior of a family of functionals which penalize a short-range interaction of convolution type between a finite perimeter set and its complement. We first compute the pointwise limit and we obtain a lower estimate…

We consider statistics on permutations chosen uniformly at random from fixed parabolic double cosets of the symmetric group. We show that the distribution of fixed points is asymptotically Poisson and establish central limit theorems for…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

We study distributions $F$ on $[0,\infty)$ such that for some $T\le\infty$, $F^{*2}(x,x+T]\sim 2 F(x,x+T]$. The case $T=\infty$ corresponds to $F$ being subexponential, and our analysis shows that the properties for $T<\infty$ are, in fact,…

The paper counts the number of reduced quasigroup words of a particular length in a certain number of generators. Taking account of the relationship with the Catalan numbers, counting words in a free magma, we introduce the term…

The goal of this paper is to develop methodology for the systematic analysis of asymptotic statistical properties of data driven DRO formulations based on their corresponding non-DRO counterparts. We illustrate our approach in various…

In this article we consider transient random walks on free products of graphs. We prove that the asymptotic range of these random walks exists and is strictly positive. In particular, we show that the range varies real-analytically in terms…

Bayesian inference is a widely used statistical method. The free energy and generalization loss, which are used to estimate the accuracy of Bayesian inference, are known to be small in singular models that do not have a unique optimal…

In this paper we investigate the asymptotic distribution of likelihood ratio tests in models with several groups, when the number of groups converges with the dimension and sample size to infinity. We derive central limit theorems for the…

Preferential attachment in a directed scale-free graph is widely used to model the evolution of social networks. Statistical analyses of social networks often relies on node based data rather than conventional repeated sampling. For our…

We consider the \mnk{classical} problem of a controller activating (or sampling) sequentially from a finite number of $N \geq 2$ populations, specified by unknown distributions. Over some time horizon, at each time $n = 1, 2, \ldots$, the…

In this paper we study random representations of fundamental groups of surfaces into special unitary groups. The random model we use is based on a symplectic form on moduli space due to Atiyah, Bott, and Goldman. Let $\Sigma_{g}$ denote a…

We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating…

An important problem in statistics is the construction of confidence regions for unknown parameters. In most cases, asymptotic distribution theory is used to construct confidence regions, so any coverage probability claims only hold…