Random -sat: the limiting probability for satisfiability for moderately growing .
Coja-Oghlan, Amin, Frieze, Alan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Extremum-searching hierarchical parallel probabilistic algorithms”
Random -sat: the limiting probability for satisfiability for moderately growing .
Ramdom variables related to distributions of sums modulo an integer.
Sburlati, G. (2002)
Rendiconti del Seminario Matematico
Similarity:
Finding induced acyclic subgraphs in random digraphs.
Subramanian, C.R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On extremum-searching approximate probabilistic algorithms
Ivan Kramosil (1983)
Kybernetika
Similarity:
Large deviations for transient random walks in random environment on a Galton–Watson tree
Elie Aidékon (2010)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Consider a random walk in random environment on a supercritical Galton–Watson tree, and let be the hitting time of generation . The paper presents a large deviation principle for /, both in quenched and annealed cases. Then we investigate the subexponential situation, revealing a polynomial regime similar to the one encountered in one dimension. The paper heavily relies on estimates on the tail distribution of the first regeneration time.
Survival time of random walk in random environment among soft obstacles.
Gantert, Nina, Popov, Serguei, Vachkovskaia, Marina (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Neutrices and the product of distributions
B. Fisher (1976)
Studia Mathematica
Similarity: