Abstract We present a stand-alone simple proof of a probabilistic interpretation of the Gaussian binomial coefficients by conditioning a random walk to hit a given lattice point at a given time. </jats:p
These lecture notes are intended to be used for master courses, where the students have a limited pr...
This thesis is at the interface between combinatorics and probability,and contributes to the study o...
This thesis is at the interface between combinatorics and probability,and contributes to the study o...
We give a combinatorial proof that the standard part of Anderson's hyperfinite random walk has the G...
We give a combinatorial proof that the standard part of Anderson's hyperfinite random walk has the G...
November 2004In this paper a general class of tree algorithms is analyzed. It is shown that, by usin...
AbstractUsing a Markov chain approach and a polyomino-like description, we study some asymptotic pro...
The Probabilistic Method was primarily used in Combinatorics and pioneered by Erdös Pai, better know...
Consider a random walk Si = ξ1 + . . . + ξi , i ∈ N, whose increments ξ1, ξ2, . . . are independent ...
AbstractThe Bayesian program in statistics starts from the assumption that an individual can always ...
AbstractA simple combinatorial approach is given for handling certain conditioning problems that ari...
AbstractUsing order statistics, we prove Gauss' 2F1 identity probabilistically. As a consequence, we...
AbstractConsider the number of cycles in a random permutation or a derangement, the number of compon...
The Probabilistic Method was primarily used in Combinatorics and pioneered by Erdös Pai, better know...
Cette thèse porte sur l étude du comportement d arbres aléatoires issus de l algorithmique.Nous util...
These lecture notes are intended to be used for master courses, where the students have a limited pr...
This thesis is at the interface between combinatorics and probability,and contributes to the study o...
This thesis is at the interface between combinatorics and probability,and contributes to the study o...
We give a combinatorial proof that the standard part of Anderson's hyperfinite random walk has the G...
We give a combinatorial proof that the standard part of Anderson's hyperfinite random walk has the G...
November 2004In this paper a general class of tree algorithms is analyzed. It is shown that, by usin...
AbstractUsing a Markov chain approach and a polyomino-like description, we study some asymptotic pro...
The Probabilistic Method was primarily used in Combinatorics and pioneered by Erdös Pai, better know...
Consider a random walk Si = ξ1 + . . . + ξi , i ∈ N, whose increments ξ1, ξ2, . . . are independent ...
AbstractThe Bayesian program in statistics starts from the assumption that an individual can always ...
AbstractA simple combinatorial approach is given for handling certain conditioning problems that ari...
AbstractUsing order statistics, we prove Gauss' 2F1 identity probabilistically. As a consequence, we...
AbstractConsider the number of cycles in a random permutation or a derangement, the number of compon...
The Probabilistic Method was primarily used in Combinatorics and pioneered by Erdös Pai, better know...
Cette thèse porte sur l étude du comportement d arbres aléatoires issus de l algorithmique.Nous util...
These lecture notes are intended to be used for master courses, where the students have a limited pr...
This thesis is at the interface between combinatorics and probability,and contributes to the study o...
This thesis is at the interface between combinatorics and probability,and contributes to the study o...
DOI
Add to ORKG