Results 31 to 40 of about 45,347 (259)
Sharp Threshold for Hamiltonicity of Random Geometric Graphs [PDF]
10 pages, 2 ...
Josep Díaz +2 more
openaire +2 more sources
The sharp threshold for making squares [PDF]
Consider a random sequence of $N$ integers, each chosen uniformly and independently from the set $\{1,\dots,x\}$. Motivated by applications to factorisation algorithms such as Dixon's algorithm, the quadratic sieve, and the number field sieve, Pomerance in 1994 posed the following problem: how large should $N$ be so that, with high probability, this ...
Balister, P, Bollobás, B, Morris, R
openaire +4 more sources
In this paper, we consider the sharp thresholds of blow-up and global existence for the nonlinear Schrödinger–Choquard equation i ψ t + Δ ψ = λ 1 | ψ | p 1 ψ + λ 2 ( I α ∗ | ψ | p 2 ) | ψ | p 2 − 2 ψ .
Yongbin Wang, Binhua Feng
doaj +1 more source
Triply Resonant Double Diffusive Convection in a Fluid Layer
We study the problem of double-diffusive convection in a horizontal plane fluid layer when there is a heat sink/source which is linear in the vertical coordinate which is in the opposite direction to gravity.
Akil J. Harfash, Fahad K. Nashmi
doaj +1 more source
Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms
Given a simple directed graph D = (V,A), let the size of the largest induced acyclic tournament be denoted by mat(D). Let D ∈ D(n, p) (with p = p(n)) be a random instance, obtained by randomly orienting each edge of a random graph drawn from Ϟ(n, 2p). We
Dutta Kunal, Subramanian C.R.
doaj +1 more source
Sharp threshold rates for random codes.
Suppose that 𝒫 is a property that may be satisfied by a random code C ⊂ Σⁿ. For example, for some p ∈ (0,1), 𝒫 might be the property that there exist three elements of C that lie in some Hamming ball of radius pn. We say that R^* is the threshold rate for 𝒫 if a random code of rate R^* + ε is very likely to satisfy 𝒫, while a random code of rate R ...
Venkatesan Guruswami +4 more
openaire +4 more sources
Contour detection with good accuracy is challenging in various computer-aided measurement applications. This paper evaluates the performance and comparison of thresholding and edge detection techniques for contour measurement along with character ...
Nehal Abdul Rehman, Farah Haroon
doaj +1 more source
Optimising Point Cloud to Wireframe Conversion for 3D City Modeling [PDF]
Urban planning increasingly relies on structured 3D city models for analysis and decision-making, but while point clouds capture rich detail, their unstructured nature complicates direct use in CityJSON-based workflows.
S. Soo Chin Yee +4 more
doaj +1 more source
Non-standard interactions of solar neutrinos in dark matter experiments
We show that non-standard neutrino interactions (NSI) can be probed in future direct dark matter detection experiments through both elastic neutrino-electron scattering and coherent neutrino-nucleus scattering. We show NSI can increase the event rate due
Bhaskar Dutta +3 more
doaj +1 more source
Sharp Choice Number Thresholds for Complete Bipartite Graphs
Fix m≥3. The choice number ch(Km,n) of the complete bipartite graph Km,n has two sharp thresholds as n grows. We give complete proofs of the Hoffman–Johnson values at levels m+1 and m, and we pin down the extremal list assignments at the lower threshold ...
Julian Allagan +4 more
doaj +1 more source

