Logarithmic Combinatorial Structures: A Probabilistic Approach

  title={Logarithmic Combinatorial Structures: A Probabilistic Approach},
  author={Richard Arratia and Andrew D. Barbour and Simon Tavar{\'e}},
The elements of many classical combinatorial structures can be naturally decomposed into components. Permutations can be decomposed into cycles, polynomials over a finite field into irreducible factors, mappings into connected components. In all of these examples, and in many more, there are strong similarities between the numbers of components of different sizes that are found in the decompositions of `typical' elements of large size. For instance, the total number of components grows… 

Figures and Tables from this paper

Random Combinatorial structures:the convergent case

This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible)

On random combinatorial structures: partitions, permutations and asymptotic normality

Random combinatorial structures form an active field of research at the interface between combinatorics and probability theory. From a theoretical point of view, some of the main objectives are to

Permute, Graph, Map, Derange

A random object is chosen uniformly from a set, e.g., all permutations/derangements on n symbols, all 2-regular graphs with n vertices, and all mappings {1, 2, . . . , n} → {2, 3, 4, 5, 6}, weighted with equal probability.

Mod-$\phi $ convergence: Approximation of discrete measures and harmonic analysis on the torus

This paper relates the framework of mod-$\phi$ convergence to the construction of approximation schemes for lattice-distributed random variables with Fourier analysis in the Wiener algebra, allowing the computation of asymptotic equivalents in the local, Kolmogorov and total variation distances.

An Introduction to Probabilistic Number Theory

This book develops probabilistic number theory from scratch, with short appendices summarizing the most important background results from number theory, analysis and probability, making it a readable and incisive introduction to this beautiful area of mathematics.

The distribution of eigenvalues of randomized permutation matrices

In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter $\theta>0$)

Counting prime polynomials and measuring complexity and similarity of information

An analogue of the prime number theorem for polynomials over night as well as its connection to the necklace factorization algorithm T-transform and the string complexity measure T-complexity are explored.

Approximation by the Dickman Distribution and Quasi-Logarithmic Combinatorial Structures

Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavare (2003). In order to obtain

Random Combinatorial Structures and Prime Factorizations

Introduction Many combinatorial structures decompose into components, with the list of component sizes carrying substantial information. An integer factors into primes—this is a similar situation,

Independent Process Approximations for Random Combinatorial Structures

Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted

Gaussian limiting distributions for the number of components in combinatorial structures

On random polynomials over finite fields

Abstract We consider random monic polynomials of degree n over a finite field of q elements, chosen with all qn possibilities equally likely, factored into monic irreducible factors. More generally,

Combinatorial species and tree-like structures

The combinatorial theory of species, introduced by Joyal in 1980, provides a unified understanding of the use of generating functions for both labelled and unlabelled structures and as a tool for the

Total Variation Asymptotics for Poisson Process Approximations of Logarithmic Combinatorial Assemblies

Assemblies are the decomposable combinatorial constructions characterized by the exponential formula for generating functions : Σp(n)s n /n ! = exp(Σm i s i /i !). Here p(n) is the total number of

Limit Theorems for Combinatorial Structures via Discrete Process Approximations

The power ofrete functional limitTheorems to provide elementary proofs of a variety of new and old limit theorems, including results previously proved by complicated analytical methods are demonstrated.

Order Statistics for Decomposable Combinatorial Structures

  • J. Hansen
  • Mathematics
    Random Struct. Algorithms
  • 1994
It is shown that when the generating function for the components of a structure is a logarithmic function, then the joint distribution of the normalized order statistics of the component sizes of a random object of size n coverges to the Poisson–Dirichlet distribution on the simplex.

Exact Largest and Smallest Size of Components

The number of decomposable combinatorial structures with largest and smallest components of a given size is provided for the number of permutations of size n with largest cycle length equal to k.

On the asymptotic distribution of large prime factors

A random integer N, drawn uniformly from the set {1,2,..., n), has a prime factorization of the form N = a1a2...aM where ax ^ a2 > ... ^ aM. We establish the asymptotic distribution, as «-»• oo, of