Results 41 to 50 of about 467 (123)
Fractional List Packing for Layered Graphs
Journal of Graph Theory, Volume 113, Issue 1, Page 19-37, September 2026.ABSTRACT The fractional list packing number χ ℓ • ( G ) of a graph G is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N need to be to ensure the existence of a “perfectly balanced” probability distribution on proper L‐colourings, that is, such ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
Fish and Fisheries, Volume 27, Issue 5, Page 1088-1106, September 2026.ABSTRACT Quantifying harvest of fish stocks is challenging as census data are often unavailable, so surveys are required. Traditional probability‐based surveys use random sampling to obtain representative data that can be scaled to estimate total impact.
Zachary Radford +8 more
wiley +1 more source
Classical and Bayesian Methodology for a New Inverse Statistical Model
Engineering Reports, Volume 7, Issue 8, August 2025.This article introduces a two‐parameter statistical model derived by applying an inverse transformation to the cumulative distribution function of the Pham distribution. The proposed model offers a flexible and tractable framework for modeling skewed and heavy‐tailed data, making it well‐suited for applications in reliability engineering, survival ...
Ibrahim Elbatal +5 more
wiley +1 more source
PACE 2020 exact treedepth submission: sms
, 2020 Submission to the exact treedepth track of PACE 2020 by Tuukka Korhonen (University of Helsinki). The submission is based on an algorithm that branches on (small) minimal separators and thus is named ...
Tuukka Korhonen
core +1 more source
Statistics in Medicine, Volume 44, Issue 5, 28 February 2025.ABSTRACT Stepped wedge cluster randomized trials (SWCRTs) often face challenges related to potential confounding by time. Traditional frequentist methods may not provide adequate coverage of an intervention's true effect using confidence intervals, whereas Bayesian approaches show potential for better coverage of intervention effects. However, Bayesian
Danni Wu +3 more
wiley +1 more source
Bayesian Robust Data Envelopment Analysis With Heavy‐Tailed Priors
Journal of Mathematics, Volume 2025, Issue 1, 2025.Data envelopment analysis (DEA) remains one of the most widely used methods for evaluating the efficiency of decision‐making units (DMUs). However, it is highly sensitive to outliers, especially in cases involving imbalanced data. Classical Bayesian DEA models typically employ Beta distributions as priors, which are not effective in mitigating the ...
Mehmet Ali Cengiz +2 more
wiley +1 more source
Treedepth and 2-treedepth in graphs with no long induced paths
Huynh, Joret, Micek, Seweryn, and Wollan (Combinatorica, 2022) introduced a graph parameter, later referred to as 2-treedepth and denoted $\mathrm{td}_2(\cdot)$. The parameter is the natural 2-connected version of treedepth. For every graph, 2-treedepth is at most the treedepth but can be much smaller: long paths have arbitrarily large treedepth but 2 ...
Hodor, Jędrzej +2 more
openaire +2 more sources
On tree decompositions whose trees are minors
Journal of Graph Theory, Volume 106, Issue 2, Page 296-306, June 2024.Abstract In 2019, Dvořák asked whether every connected graph G $G$ has a tree decomposition ( T , B ) $(T,{\rm{ {\mathcal B} }})$ so that T $T$ is a subgraph of G $G$ and the width of ( T , B ) $(T,{\rm{ {\mathcal B} }})$ is bounded by a function of the treewidth of G $G$.
Pablo Blanco +5 more
wiley +1 more source
Specifying prior distributions in reliability applications
Applied Stochastic Models in Business and Industry, Volume 40, Issue 1, Page 5-62, January/February 2024.Especially when facing reliability data with limited information (e.g., a small number of failures), there are strong motivations for using Bayesian inference methods. These include the option to use information from physics‐of‐failure or previous experience with a failure mode in a particular material to specify an informative prior distribution ...
Qinglong Tian +3 more
wiley +1 more source
Computing Treedepth Obstructions
CoRRThe graph parameter treedepth is minor-monotone; hence, the class of graphs with treedepth at most $k$ is minor-closed. By the Graph Minor Theorem, such a class is characterized by a finite set of forbidden minors. A conjecture of Dvořák, Giannopoulou, and Thilikos states that every such forbidden minor has at most $2^k$ vertices.
openaire +2 more sources