Results 21 to 30 of about 45,347 (259)
Energy criteria of global existence for a class of Hartree equations with Coulomb potential
Mathematics in Applied Sciences and Engineering, 2023 This paper studies a class of Hartree equations with Coulomb potential. Combined with the conservation of mass and energy, we analyze the variational characteristics of the corresponding nonlinear elliptic equation.
Na Tang, Jian Zhang
doaj +1 more source
Sharp thresholds and percolation in the plane [PDF]
Random Structures & Algorithms, 2006 AbstractRecently, it was shown by Bollobás and Riordan Probab Theory Related Fields 136 (2006), 417–468 that the critical probability for random Voronoi percolation in the plane is 1/2. As a by‐product of the method, a short proof of the Harris–Kesten Theorem was given by Bollobás and Riordan Bull London Math Soc 38 (2006), 470–484.
Bollobas, B, Riordan, O
openaire +3 more sources
Sharp load thresholds for cuckoo hashing [PDF]
Random Structures & Algorithms, 2012 AbstractThe paradigm of many choices has influenced significantly the design of efficient data structures and, most notably, hash tables. Cuckoo hashing is a technique that extends this concept. There, we are given a table withnlocations, and we assume that each location can hold one item. Each item to be inserted chooses randomlyk≥ 2 locations and has
Nikolaos Fountoulakis +1 more
openaire +2 more sources
Research on the speed thresholds of trucks in a sharp turn based on dynamic rollover risk levels.
PLoS ONE, 2021 Truck rollover is a problem that seriously endangers the safety of human life. Under special conditions, when the driver takes a sharp turn, the truck is most prone to rollover.
Tian Xin +3 more
doaj +1 more source
Sharp Thresholds for Half-Random Games II [PDF]
Graphs and Combinatorics, 2016 ABSTRACTWe study biased Maker‐Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this paper we consider the scenario when Maker plays randomly and Breaker is “clever”, and determine the sharp threshold bias of classical graph games, such as connectivity, Hamiltonicity, and ...
Jonas Groschwitz, Tibor Szabó
openaire +4 more sources
Sharp thresholds in adaptive random graph processes
Random Structures & Algorithms, 2023 AbstractThe ‐process is a single player game in which the player is initially presented the empty graph on vertices. In each step, a subset of edges is independently sampled according to a distribution . The player then selects one edge from , and adds to its current graph.
Calum MacRury, Erlang Surya
openaire +2 more sources
Systematic clustering of transcription start site landscapes. [PDF]
PLoS ONE, 2011 Genome-wide, high-throughput methods for transcription start site (TSS) detection have shown that most promoters have an array of neighboring TSSs where some are used more than others, forming a distribution of initiation propensities. TSS distributions (
Xiaobei Zhao +3 more
doaj +1 more source
Sharp threshold for the Erdős–Ko–Rado theorem
Random Structures & Algorithms, 2022 AbstractFor positive integers and with , the Kneser graph is the graph with vertex set consisting of all ‐sets of , where two ‐sets are adjacent exactly when they are disjoint. The independent sets of are ‐uniform intersecting families, and hence the maximum size independent sets are given by the Erdős–Ko–Rado Theorem.
József Balogh +2 more
openaire +2 more sources
A Robust Approach for Blur and Sharp Regions’ Detection Using Multisequential Deviated Patterns
International Journal of Optics, 2021 Blur detection (BD) is an important and challenging task in digital imaging and computer vision applications. Accurate segmentation of homogenous smooth and blur regions, low-contrast focal regions, missing patches, and background clutter, without having
Awais Khan +3 more
doaj +1 more source
A sharp threshold for bootstrap percolation in a random hypergraph [PDF]
Electronic Journal of Probability, 2021 Given a hypergraph $\mathcal{H}$, the $\mathcal{H}$-bootstrap process starts with an initial set of infected vertices of $\mathcal{H}$ and, at each step, a healthy vertex $v$ becomes infected if there exists a hyperedge of $\mathcal{H}$ in which $v$ is the unique healthy vertex.
Morrison, Natasha, Noel, Jonathan A.
openaire +2 more sources