Identitäten bei den Stirling-Zahlen 2.Art aus kombinatorischen Überlegungen beim Würfelspiel.
Page 1
Displaying 1 – 14 of 14
Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes.
Dohmen, Klaus (1999)
Electronic Journal of Probability [electronic only]
Inclusion-exclusion and network reliability.
Dohmen, Klaus (1998)
The Electronic Journal of Combinatorics [electronic only]
Inclusion-exclusion redux.
Kessler, David, Schiff, Jeremy (2002)
Electronic Communications in Probability [electronic only]
Inequalities and limit theorems for random allocations
István Fazekas, Alexey Chuprunov, József Túri (2011)
Annales UMCS, Mathematica
Random allocations of balls into boxes are considered. Properties of the number of boxes containing a fixed number of balls are studied. A moment inequality is obtained. A merge theorem with Poissonian accompanying laws is proved. It implies an almost sure limit theorem with a mixture of Poissonian laws as limiting distribution. Almost sure versions of the central limit theorem are obtained when the parameters are in the central domain.
Inequalities of Bonferroni-Galambos type with applications to the Tutte polynomial and the chromatic polynomial.
Dohmen, Klaus, Tittmann, Peter (2004)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Inequality of two critical probabilities for percolation.
Kahn, Jeff (2003)
Electronic Communications in Probability [electronic only]
Infinite paths and cliques in random graphs
Alessandro Berarducci, Pietro Majer, Matteo Novaga (2012)
Fundamenta Mathematicae
We study the thresholds for the emergence of various properties in random subgraphs of (ℕ, <). In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.
Information recovery from randomly mixed-up message text.
Lember, Jüri, Matzinger, Heinrich (2008)
Electronic Journal of Probability [electronic only]
Intégration d'une suite récurrente qui se présente dans une question de probabilité
Maurice D'Ocagne (1887)
Bulletin de la Société Mathématique de France
Intersections of randomly embedded sparse graphs are Poisson.
Bender, Edward A., Canfield, E.Rodney (1999)
The Electronic Journal of Combinatorics [electronic only]
Irreducible compositions and the first return to the origin of a random walk.
Bender, Edward A., Lawler, Gregory F., Pemantle, Robin, Wilf, Herbert S. (2003)
Séminaire Lotharingien de Combinatoire [electronic only]
Isolated trees in a bichromatic random graph
Zbigniew Pałka (1982)
Colloquium Mathematicae
Isolated trees in a random graph
Z. Palka (1982)
Applicationes Mathematicae
Currently displaying 1 – 14 of 14
Page 1