Related papers: A probabilistic approach toward the finite general…

Algorithmic probability has shown some promise in dealing with the probability problem in the Everett interpretation, since it provides an objective, single-case probability measure. Many find the Everettian cosmology to be overly…

In this paper, we develop a general approach to proving global and local uniform limit theorems for the Horvitz-Thompson empirical process arising from complex sampling designs. Global theorems such as Glivenko-Cantelli and Donsker…

This monograph aims at providing an introduction to key concepts, algorithms, and theoretical results in machine learning. The treatment concentrates on probabilistic models for supervised and unsupervised learning problems. It introduces…

A stochastic algorithm is proposed, finding the set of generalized means associated to a probability measure on a compact Riemannian manifold M and a continuous cost function on the product of M by itself. Generalized means include p-means…

We describe the variety of fixed points of a unipotent operator acting on the space of matrices. We compute the determinant and the rank of a generic (symmetric, or anti-symmetric) matrix in the fixed variety, yielding information about the…

In number theory, great efforts have been undertaken to study the Cohen-Lenstra probability measure on the set of all finite abelian $p$-groups. On the other hand, group theorists have studied a probability measure on the set of all…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

In this paper, using some properties of fundamental groups and covering spaces of connected polyhedra and CW-complexes, we present topological proof for some famous theorems about finitely presented groups.

In this paper, we give random matrix theory approach to the quantum mechanics using the quantum Hamilton-Jacobi formalism. We show that the bound state problems in quantum mechanics are analogous to solving Gaussian unitary ensemble of…

We explain how to use the probabilistic method to prove the existence of real polynomial singularities with rich topology, i.e. with total Betti number of the maximal possible order. We show how similar ideas can be used to produce real…

In recent years various results about locally symmetric manifolds were proven using probabilistic approaches. One of the approaches is to consider random manifolds by associating a probability measure to the space of discrete subgroups of…

Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…

Consider a probability measure supported by a regular geodesic ball in a manifold. For any p larger than or equal to 1 we define a stochastic algorithm which converges almost surely to the p-mean of the measure. Assuming furthermore that…

We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the lp-norm of the parameters. We discuss several implications of Lipschitz parametrization. We present an upper bound of the…

Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating…

In this paper we show, using Deligne-Lusztig theory and Kawanaka's theory of generalised Gelfand-Graev representations, that the decomposition matrix of the special linear and unitary group in non defining characteristic can be made…

We use character theory of finite groups of Lie type to establish new results on representation varieties of Fuchsian groups, and also on probabilistic generation of groups of Lie type.

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…