Related papers: Random Kleinian Groups I: Random Fuchsian Groups
In this paper we study random walks on a finitely generated group $G$ which has a free action on a $\mathbb{Z}^n$-tree. We show that if $G$ is non-abelian and acts minimally, freely and without inversions on a locally finite…
In this paper, we review the construction and large $N$ study of the continuous two-dimensional Yang--Mills theory with gauge group $\mathrm{U}(N)$ through probability, combinatorics and representation theory. In the first part, we define…
It has been shown recently [10] that Cauchy transforms of orthogonal polynomials appear naturally in general correlation functions containing ratios of characteristic polynomials of random NxN Hermitian matrices. Our main goal is to…
Invariance properties of semimartingales on Lie groups under a family of random transformations are defined and investigated, generalizing the random rotations of the Brownian motion. A necessary and sufficient explicit condition…
Reparameterizable densities are an important way to learn probability distributions in a deep learning setting. For many distributions it is possible to create low-variance gradient estimators by utilizing a `reparameterization trick'. Due…
In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…
We investigate a class of random graph ensembles based on the Feynman graphs of multidimensional integrals, representing statistical-mechanical partition functions. We show that the resulting ensembles of random graphs strongly resemble…
The purpose of this paper is to exhibit a quantitative stability result for the class of M\"obius transformations of $\mathbb{S}^{n-1}$ when $n\geq 3$. The main estimate is of local nature and asserts that for a Lipschitz map that is…
In a variety of applications it is important to extract information from a probability measure $\mu$ on an infinite dimensional space. Examples include the Bayesian approach to inverse problems and possibly conditioned) continuous time…
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…
Due to the invariance properties of cross-ratio, M\"obius transformations are often used to map a set of points or other geometric object into a symmetric position to simplify a problem studied. However, when the points are mapped under a…
We use ideas from topological dynamics (amenability), combinatorics (structural Ramsey theory) and model theory (Fra\" {i}ss\' e limits) to study closed amenable subgroups $G$ of the symmetric group $S_\infty$ of a countable set, where…
In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…
Consider bivariate observations $(X_1,Y_1), \ldots, (X_n,Y_n) \in \mathbb{R}\times \mathbb{R}$ with unknown conditional distributions $Q_x$ of $Y$, given that $X = x$. The goal is to estimate these distributions under the sole assumption…
Statistical models that possess symmetry arise in diverse settings such as random fields associated to geophysical phenomena, exchangeable processes in Bayesian statistics, and cyclostationary processes in engineering. We formalize the…
We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the…
We introduce a new quasi-isometry invariant for finitely generated groups and show that every group with this property admits a subshift which is effectively closed by patterns and that cannot be realized as the topological factor of any…
Let P be a set of points in R^d, and let M be a function that maps any subset of P to a positive real number. We examine the problem of computing the exact mean and variance of M when a subset of points in P is selected according to a…
In many fields of science, generalized likelihood ratio tests are established tools for statistical inference. At the same time, it has become increasingly common that a simulator (or generative model) is used to describe complex processes…
The generation of pseudo-random discrete probability distributions is of paramount importance for a wide range of stochastic simulations spanning from Monte Carlo methods to the random sampling of quantum states for investigations in…