Tootfinder

Bounds on the Excess Minimum Risk via Generalized Information Divergence Measures
Ananya Omanwar, Fady Alajaji, Tam\'as Linder
https://arxiv.org/abs/2505.24117

Bounds on the Excess Minimum Risk via Generalized Information Divergence Measures
Given finite-dimensional random vectors $Y$, $X$, and $Z$ that form a Markov chain in that order (i.e., $Y \to X \to Z$), we derive upper bounds on the excess minimum risk using generalized information divergence measures. Here, $Y$ is a target vector to be estimated from an observed feature vector $X$ or its stochastically degraded version $Z$. The excess minimum risk is defined as the difference between the minimum expected loss in estimating $Y$ from $X$ and from $Z$. We present a family of …

Amsterdam – Atelier van Lieshout – The Monument Group
#kamafotos

This German Town Carefully Reconstructed a 5,500-Year-Old Monument Lifting 13 Tons of Stone https://www.goodnewsnetwork.org/this-german-town-carefully-reconstructed-a-5500-year-old-monument-lifting-13-tons-of-st…

This German Town Carefully Reconstructed a 5,500-Year-Old Monument Lifting 13 Tons of Stone
Archaeological work in the forests has identified ten settlements from the time, which may explain the monumentality of Küsterberg.

Edge-colouring and orientations: applications to degree-boundedness and $\chi$-boundedness
Arnab Char, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
https://arxiv.org/abs/2506.23054

Edge-colouring and orientations: applications to degree-boundedness and $χ$-boundedness
We prove that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. As a consequence, we deduce that some classes of graphs are degree-bounded. A class $\mathcal{G}$ is {\it degree-bounded} if, for every integer $s$, there exists $d=d(s)$ such that every graph $G\in \mathcal{G}$ either contains $K_{s,s}$ or has minimum degree at most $d$. We obtain that the following classes are degree-bounded: (i) fo…

Joint space-time modelling for upper daily maximum and minimum temperature record-breaking
Jorge Castillo-Mateo (University of Zaragoza), Zeus Gracia-Tabuenca (University of Zaragoza), Jes\'us As\'in (University of Zaragoza), Ana C. Cebri\'an (University of Zaragoza), Alan E. Gelfand (Duke University)
https://arxiv.o…

Joint space-time modelling for upper daily maximum and minimum temperature record-breaking
Record-breaking temperature events are now frequently in the news, proffered as evidence of climate change, and often bring significant economic and human impacts. Our previous work undertook the first substantial spatial modelling investigation of temperature record-breaking across years for any given day within the year, employing a dataset consisting of over sixty years of daily maximum temperatures across peninsular Spain. That dataset also supplies daily minimum temperatures (which, in fac…

Amsterdam – Atelier van Lieshout – The Monument Group
#kamafotos

The Weak Version of the Graph Complement Conjecture and Partial Results for the Delta Conjecture
Francesco Barioli, Shaun M. Fallat, Himanshu Gupta, Zhongshan Li
https://arxiv.org/abs/2505.24577

The Weak Version of the Graph Complement Conjecture and Partial Results for the Delta Conjecture
Since the transformative workshop by the American Institute of Mathematics on the minimum rank of a graph, two longstanding open problems have captivated the community interested in the minimum rank of graphs: the graph complement conjecture and the $δ$-conjecture. In this paper, we use a classical result of Mader (1972) to establish a weak version of the graph complement conjecture for all key minimum rank parameters. In addition, again using the same result of Mader, we present some extremal…

Amsterdam – Atelier van Lieshout – The Monument Group
#kamafotos

Amsterdam – Atelier van Lieshout – The Monument Group
#kamafotos

Amsterdam – Atelier van Lieshout – The Monument Group
#kamafotos