Zobrazeno 1 - 10
of 1 720
pro vyhledávání: '"Martin, Ryan A"'
Autor:
Gomez-Leos, Enrique, Martin, Ryan R.
A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that covers all vertices of $G$. Motivated by papers of Bush and Zhao and of Balogh, Treglown, and Wagner, we determine the threshold for the existenc
Externí odkaz:
http://arxiv.org/abs/2411.12738
Autor:
Martin, Ryan
Classical statistical methods have theoretical justification when the sample size is predetermined. In applications, however, it's often the case that sample sizes aren't predetermined; instead, they're often data-dependent. Since those methods desig
Externí odkaz:
http://arxiv.org/abs/2410.01427
Autor:
Baker, Dustin, Gomez-Leos, Enrique, Halfpap, Anastasia, Heath, Emily, Martin, Ryan R., Miller, Joe, Parker, Alex, Pungello, Hope, Schwieder, Coy, Veldt, Nick
Given a graph $H$, we say a graph $G$ is properly rainbow $H$-saturated if there is a proper edge-coloring of $G$ which contains no rainbow copy of $H$, but adding any edge to $G$ makes such an edge-coloring impossible. The proper rainbow saturation
Externí odkaz:
http://arxiv.org/abs/2409.15258
Autor:
Martin, Ryan R., Patkós, Balázs
A classical result of Kleitman determines the maximum number $f(n,s)$ of subsets in a family $\mathcal{F}\subseteq 2^{[n]}$ of sets that do not contain distinct sets $F_1,F_2,\dots,F_s$ that are pairwise disjoint in the case $n\equiv 0,-1$ (mod $s$).
Externí odkaz:
http://arxiv.org/abs/2409.08694
Autor:
Martin, Ryan R, Veldt, Nick
Given a set $X$, the power set $\mathbb{P}(X)$, and a finite poset $P$, a family $F\subset \mathbb{P}(X)$ is said to be induced-$P$-free if there is no injection $\phi: P\rightarrow \mathbb{P}(X)$ such that $\phi(p)\subseteq\phi(q)$ if and only if $p
Externí odkaz:
http://arxiv.org/abs/2408.14648
A coloring of the edges of a graph $G$ in which every $K_{1,2}$ is totally multicolored is known as a proper coloring and a coloring of the edges of $G$ in which every $K_{1,2}$ and every $K_{2,2}$ is totally multicolored is called a B-coloring. In t
Externí odkaz:
http://arxiv.org/abs/2408.09081
We call a proper edge coloring of a graph $G$ a B-coloring if every 4-cycle of $G$ is colored with four different colors. Let $q_B(G)$ denote the smallest number of colors needed for a B-coloring of $G$. Motivated by earlier papers on B-colorings, he
Externí odkaz:
http://arxiv.org/abs/2408.09059
Uncovering genuine relationships between a response variable of interest and a large collection of covariates is a fundamental and practically important problem. In the context of Gaussian linear models, both the Bayesian and non-Bayesian literature
Externí odkaz:
http://arxiv.org/abs/2408.04359
Autor:
Cella, Leonardo, Martin, Ryan
Inferential models (IMs) offer reliable, data-driven, possibilistic statistical inference. But despite IMs' theoretical/foundational advantages, efficient computation in applications is a major challenge. This paper presents a simple and apparently p
Externí odkaz:
http://arxiv.org/abs/2404.19224
Autor:
Martin, Ryan
The false confidence theorem establishes that, for any data-driven, precise-probabilistic method for uncertainty quantification, there exists (non-trivial) false hypotheses to which the method tends to assign high confidence. This raises concerns abo
Externí odkaz:
http://arxiv.org/abs/2404.16228