Results 231 to 240 of about 45,347 (259)
Modelling the time to cervical cancer elimination in England: strategies for achieving elimination by 2040. [PDF]
BMJ Public HealthPalmer C +8 more
europepmc +1 more source
Integrated relative humidity as a layer-resolved indicator for moisture-precipitation interactions. [PDF]
Sci RepWan M +5 more
europepmc +1 more source
Sharp thresholds for constraint satisfaction problems and homomorphisms [PDF]
Random Structures and Algorithms, 2008 AbstractWe determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the (d,k,t)‐model, and binary constraint satisfaction problems with domain size three. © 2008 Wiley Periodicals, Inc. Random Struct.
Hamed Hatami, Michael Molloy
exaly +3 more sources
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs [PDF]
Random Structures and Algorithms, 2020 For positive integers r>ℓ, an r‐uniform hypergraph is called an ℓ‐cycle if there exists a cyclic ordering of its vertices such that each of its edges consists of r consecutive vertices, and such that every pair of consecutive edges (in the natural ordering of the edges) intersect in precisely ℓ vertices; such cycles are said to be linear when ℓ=1 ...
Bhargav Narayanan, Mathias Schacht
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Sharp Threshold fork-Colorability
Random Structures and Algorithms, 1999Summary: Let \(k\) be a fixed integer and \(f_k(n, p)\) denote the probability that the random graph \(G(n,p)\) is \(k\)-colorable. We show that for \(k\geq 3\), there exists \(d_k(n)\) such that for any \(\varepsilon> 0\), \[ \lim_{n\to \infty} f_k\Biggl(n, {d_k(n)- \varepsilon\over n}\Biggr)= 1,\quad\text{and}\quad \lim_{n\to\infty} f_k\Biggl(n,{d_k ...
Dimitris Achlioptas, Ehud Friedgut
openaire +2 more sources
A Sharp Threshold for Network Reliability
Combinatorics, Probability and Computing, 2002Given a graph G on n vertices with average degree d, form a random subgraph Gp by choosing each edge of G independently with probability p. Strengthening a classical result of Margulis we prove that, if the edge connectivity k(G) satisfies k(G) [Gt ] d/log n, then the connectivity threshold in Gp is sharp. This result is asymptotically tight.
Michael Krivelevich +2 more
openaire +2 more sources
Sharp thresholds of two-components Bose–Einstein condensates
Computers and Mathematics With Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu Zhongxue, Liu Zuhan
exaly +3 more sources
Sharp thresholds in Bootstrap percolation
Physica A: Statistical Mechanics and its Applications, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Balogh, József, Bollobás, Béla
openaire +2 more sources