Our results are concerned with couplings, component counts of combinatorial objects, andprobabilistic number theory. In the theory of couplings, we are concerned with the generalproblem of proving the existence of joint distributions p(i,j) of two discrete random variables M andN subject to infinitely many constraints of the form p(M=i, N=j)=0. The constraints placed on the joint distributions will require, for manyelements j in the range of N, p(M=i, N=j)=0 for infinitely many values of i in therange of M, where the corresponding values of i depend on j. To prove the existence ofsuch joint distributions, we apply a theorem proved by Volker Strassen on the existence of jointdistributions with prespecified marginal distributions. In the case...
Probabilistic Combinatorics is an interface between Probability and Discrete Mathematics. Initiated ...
Compositions of integers are used as theoretical models for many applications. The degree of distinc...
International audienceCouplings are a powerful mathematical tool for reasoning about pairs of probab...
Our results are concerned with couplings, component counts of combinatorial objects, andprobabilisti...
AbstractMany random combinatorial objects have a component structure whose joint distribution is equ...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
When approximating the joint distribution of the component counts of a decomposable combinatorial st...
This thesis explores proofs by coupling from the perspective of formal verification. Long employed i...
International audienceProbabilistic coupling is a powerful tool for analyzing prob-abilistic process...
Limit theorems are ubiquitous in probability theory. The present work samples contributionsof the au...
This thesis explores proofs by coupling from the perspective of formal verification. Long employed i...
On s'intéresse à deux classes de chaînes de Markov combinatoires. On commence avec les chaînes de Ma...
Abstract We give a series of combinatorial results that can be obtained from any two collections (bo...
The Riemann Zeta distribution is one of many ways to sample a positive integer at random. Many prope...
We give a necessary and sufficient condition for the existence of an increasing coupling of N (N[gre...
Probabilistic Combinatorics is an interface between Probability and Discrete Mathematics. Initiated ...
Compositions of integers are used as theoretical models for many applications. The degree of distinc...
International audienceCouplings are a powerful mathematical tool for reasoning about pairs of probab...
Our results are concerned with couplings, component counts of combinatorial objects, andprobabilisti...
AbstractMany random combinatorial objects have a component structure whose joint distribution is equ...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
When approximating the joint distribution of the component counts of a decomposable combinatorial st...
This thesis explores proofs by coupling from the perspective of formal verification. Long employed i...
International audienceProbabilistic coupling is a powerful tool for analyzing prob-abilistic process...
Limit theorems are ubiquitous in probability theory. The present work samples contributionsof the au...
This thesis explores proofs by coupling from the perspective of formal verification. Long employed i...
On s'intéresse à deux classes de chaînes de Markov combinatoires. On commence avec les chaînes de Ma...
Abstract We give a series of combinatorial results that can be obtained from any two collections (bo...
The Riemann Zeta distribution is one of many ways to sample a positive integer at random. Many prope...
We give a necessary and sufficient condition for the existence of an increasing coupling of N (N[gre...
Probabilistic Combinatorics is an interface between Probability and Discrete Mathematics. Initiated ...
Compositions of integers are used as theoretical models for many applications. The degree of distinc...
International audienceCouplings are a powerful mathematical tool for reasoning about pairs of probab...