Results 81 to 90 of about 8,755 (208)
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
Communications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1973-2102, August 2026.ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
Vector Bundles and Gromov–Hausdorff Distance [PDF]
Journal of K-Theory, 2009 AbstractWe show how to make precise the vague idea that for compact metric spaces that are close together for Gromov–Hausdorff distance, suitable vector bundles on one metric space will have counterpart vector bundles on the other. Our approach employs the Lipschitz constants of projection-valued functions that determine vector bundles. We develop some
openaire +2 more sources
On non-separable components of hyperspaces with the Hausdorff metric [PDF]
Математичні Студії, 2011 Let $(X,d)$ be a connected non compact metric space. Suppose the metric$d$ convex and such that every closed bounded subset of $X$ is compact. Let $F(X)$ bethe space of nonvoid closed subsets of $X$ with the Hausdorff distance associated to $d$.We prove ...
R. Cauty
doaj
On Oriented Colourings of Graphs on Surfaces
Journal of Graph Theory, Volume 112, Issue 4, Page 357-369, August 2026.ABSTRACT For an oriented graph G, the least number of colours required to oriented colour G is called the oriented chromatic number of G and denoted χ o ( G ). For a non‐negative integer g let χ o ( g ) be the least integer such that χ o ( G ) ≤ χ o ( g ) for every oriented graph G with Euler genus at most g.
Alexander Clow
wiley +1 more source
On the relationship between the Hausdorff distance and matrix distances of ellipsoids
Linear Algebra and its Applications, 1983 AbstractThe space of ellipsoids may be metrized by the Hausdorff distance or by the sum of the distance between their centers and a distance between matrices. Various inequalities between metrics are established. It follows that the square root of positive semidefinite symmetric matrices satisfies a Lipschitz condition, with a constant which depends ...
Goffin, Jean-Louis, Hoffman, Alan J.
openaire +2 more sources
IH-TCGAN: Time-Series Conditional Generative Adversarial Network with Improved Hausdorff Distance for Synthesizing Intention Recognition Data. [PDF]
Entropy (Basel), 2023 Wang S, Wang G, Fu Q, Song Y, Liu J.
europepmc +1 more source
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, Volume 112, Issue 4, Page 491-506, August 2026.ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar +3 more
wiley +1 more source
Correction: On the usage of average Hausdorff distance for segmentation performance assessment: hidden error when used for ranking. [PDF]
Eur Radiol Exp, 2022 Aydin OU +7 more
europepmc +1 more source
Rendering transparency to ranking in educational assessment via Bayesian comparative judgement
Review of Education, Volume 14, Issue 2, August 2026.Abstract Transparency in educational assessment has become an increasingly pressing concern, particularly in the aftermath of the pandemic, as institutions seek more equitable, robust and defensible methods of evaluating student work. Comparative judgement (CJ) has gained traction as a promising alternative to traditional rubric‐based marking. However,
Andy Gray +4 more
wiley +1 more source
COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
International Journal of Computational Geometry & Applications, 2008 The Hausdorff distance between two sets of curves is a measure for the similarity of these objects and therefore an interesting feature in shape recognition. If the curves are algebraic computing the Hausdorff distance involves computing the intersection points of the Voronoi edges of the one set with the curves in the other.
Alt, Helmut, Scharf, Ludmila
openaire +3 more sources