Results 31 to 40 of about 364 (127)

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

Structural Parameterizations of $k$-Planarity

Journal of Graph Algorithms and Applications
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times.
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada   +2 more
doaj   +1 more source

Addressing Bias in Non‐Probability Fisheries Surveys Using Multilevel Regression and Poststratification Approaches

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, Wendy Edwards, Samantha Hook, Bridgid Bell, Rebecca Mills, Grace Farrell, Martin J. Genner, Stephen D. Simpson, Kieran Hyder   +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, Mustafa Ibrahim Ahmed Araibi, Selasi Kwaku Ocloo, Ehab M. Almetwally, Laxmi Prasad Sapkota, Ahmed M. Gemeay   +5 more
wiley   +1 more source

Bayesian Hierarchical Penalized Spline Models for Immediate and Time‐Varying Intervention Effects in Stepped Wedge Cluster Randomized Trials

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, Hyung G. Park, Corita R. Grudzen, Keith S. Goldfeld   +3 more
wiley   +1 more source

How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? [PDF]

Algorithmica, 2016
In the last years, kernelization with structural parameters has been an active area of research within the field of parameterized complexity. As a relevant example, Gajarský et al.
M. Bougeret, Ignasi Sau
semanticscholar   +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, Talat Şenel, Xian-Ming Gu   +2 more
wiley   +1 more source

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, Linda Cook, Meike Hatzel, Claire Hilaire, Freddie Illingworth, Rose McCarty   +5 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 arbitrary treedepth but 2 ...
Hodor, Jędrzej, Illingworth, Freddie, Mazur, Tomasz   +2 more
openaire   +2 more sources

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, Colin Lewis‐Beck, Jarad B. Niemi, William Q. Meeker   +3 more
wiley   +1 more source