Munk, Axel

Home >> Publications >> Author >> Munk, Axel >> Page 2
Feature image not available
21.07.2024

Distributional limits of graph cuts on discretized grids

Authors Suchan L, Li H, Munk A Journal Arxiv Citation arXiv:2407.15297. Abstract Graph cuts are among the most prominent tools for clustering and classification analysis. While intensively studied from geometric and algorithmic perspectives, graph cut-based statistical inference still remains elusive to a certain extent. Distributional limits are fundamental in understanding
Learn More
Feature image not available
01.06.2024

Analyzing cross-talk between superimposed signals: Vector norm dependent hidden Markov models and applications to ion channels

Authors Vanegas LJ, Eltzner B, Rudolf D, Dura M, Lehnart SE, Munk A Journal The Annals of Applied Statistics Citation Ann. Appl. Stat. 18(2): 1445-1470. Abstract We propose and investigate a hidden Markov model (HMM) for the analysis of dependent, aggregated, superimposed two-state signal recordings. A major motivation for this
Learn More
Feature image not available
01.05.2024

Empirical Optimal Transport between Different Measures Adapts to Lower Complexity

Authors Hundrieser S, Staudt T, Munk A Journal Annales de l’Institut Henri Poincare (B) Probabilites et statistiques Citation Ann. Inst. H. Poincaré Probab. Statist. 60(2): 824-846. Abstract The empirical optimal transport (OT) cost between two probability measures from random data is a fundamental quantity in transport based data analysis. In
Learn More
Feature image not available
01.02.2024

Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces

Authors Hundrieser S, Klatt M, Munk A Journal The Annals of Applied Probability Citation Ann. Appl. Probab. 34(1B): 1403-1468. Abstract For probability measures on countable spaces we derive distributional limits for empirical entropic optimal transport quantities. More precisely, we show that the empirical optimal transport plan weakly converges to a
Learn More
Feature image not available
07.10.2023

The ultrametric Gromov-Wasserstein distance

Authors Mémoli F, Munk A, Wan Z, Weitkamp C Journal Discrete & Computational Geometry Citation Discrete Comput Geom (2023) Abstract We investigate compact ultrametric measure spaces which form a subset Uw of the collection of all metric measure spaces Mw. In analogy with the notion of the ultrametric Gromov–Hausdorff distance
Learn More
Feature image not available
18.08.2023

A scalable clustering algorithm to approximate graph cuts

Authors Suchan L, Li H, Munk A Journal Arxiv Citation arXiv:2308.09613. Abstract Due to its computational complexity, graph cuts for cluster detection and identification are used mostly in the form of convex relaxations. We propose to utilize the original graph cuts such as Ratio, Normalized or Cheeger Cut in order
Learn More
Feature image not available
18.07.2023

Minimax detection of localized signals in statistical inverse problems

Authors Pohlmann M, Werner F, Munk A Journal Information and Inference: A Journal of the IMA Citation Information and Inference: A Journal of the IMA, Volume 12, Issue 3, September 2023, iaad026. Abstract We investigate minimax testing for detecting local signals or linear combinations of such signals when only indirect
Learn More
Feature image not available
26.06.2023

Statistical analysis of random objects via metric measure Laplacians

Authors Mordant G, Munk A Journal SIAM Journal on Mathematics of Data Science Citation IAM Journal on Mathematics of Data Science 2023 5:2, 528-557 Abstract In this paper, we consider a certain convolutional Laplacian for metric measure spaces and investigate its potential for the statistical analysis of complex objects. The
Learn More
Feature image not available
29.05.2023

Quick Adaptive Ternary Segmentation: An Efficient Decoding Procedure For Hidden Markov Models

Authors Mösching A, Li H, Munk A Journal ArXiv Citation arXiv:2305.18578. Abstract Hidden Markov models (HMMs) are characterized by an unobservable (hidden) Markov chain and an observable process, which is a noisy version of the hidden chain. Decoding the original signal (i.e., hidden chain) from the noisy observations is one
Learn More
Feature image not available
23.01.2023

Towards Unbiased Fluorophore Counting in Superresolution Fluorescence Microscopy

Authors Laitenberger O, Aspelmeier T, Staudt T, Geisler C, Munk A, Egner A Journal Nanomaterials Citation Nanomaterials 2023, 13(3), 459. Abstract With the advent of fluorescence superresolution microscopy, nano-sized structures can be imaged with a previously unprecedented accuracy. Therefore, it is rapidly gaining importance as an analytical tool in the
Learn More
X

Open Positions

EN DE
X
X