Coalescents with simultaneous multiple collisions.
Schweinsberg, Jason (2000)
Electronic Journal of Probability [electronic only]
Similarity:
Schweinsberg, Jason (2000)
Electronic Journal of Probability [electronic only]
Similarity:
Feng, Shui, Xiong, Jie (2002)
Electronic Communications in Probability [electronic only]
Similarity:
Kargin, Vladislav (2007)
Electronic Communications in Probability [electronic only]
Similarity:
Arguin, Louis-Pierre (2007)
Electronic Communications in Probability [electronic only]
Similarity:
Heck, Matthias K., Maaouia, Faïza (2001)
Electronic Journal of Probability [electronic only]
Similarity:
Zeilberger, Doron (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dawson, Donald A., Greven, Andreas (1996)
Electronic Journal of Probability [electronic only]
Similarity:
Jean-Pierre Conze, Albert Raugi (2003)
ESAIM: Probability and Statistics
Similarity:
We present a spectral theory for a class of operators satisfying a weak “Doeblin–Fortet” condition and apply it to a class of transition operators. This gives the convergence of the series , , under some regularity assumptions and implies the central limit theorem with a rate in for the corresponding Markov chain. An application to a non uniformly hyperbolic transformation on the interval is also given.
Alice Guionnet (1999)
ESAIM: Probability and Statistics
Similarity:
Tripsiannis, Gregory A., Philippou, Andreas N. (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Evripidis Bampis, R. Giroudeau, J.-C. König (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We consider the unit execution time unit communication time (UET-UCT) scheduling model with hierarchical communications [1], and we study the impact of the hierarchical communications hypothesis on the hardness of approximation. We prove that there is no polynomial time approximation algorithm with performance guarantee smaller than (unless ). This result is an extension of the result of Hoogeveen et al. [6] who proved that there is no polynomial time -approximation algorithm with...
Snellman, Jan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: