Uncertainty Quantification

We study the enumeration of graph orientations under local degree constraints. Given a finite graph $G = (V, E)$ and a family of admissible sets ${\mathsf P_v \subseteq \mathbb{Z} : v \in V}$, let $…

Related Papers:

• Counting degree-constrained orientations
• Interpretable Uncertainty Quantification in AI for HEP
• Probabilistic neural networks for fluid flow surrogate modeling and data recovery
• A Modular Deep Learning Pipeline for Galaxy-Scale Strong Gravitational Lens Detection and Modeling