12 citations · 30 across the 8 of their papers we have counts for
8 papers
Predictive change point detection for heterogeneous data
Anna-Christina Glock, Florian Sobieczky, Johannes Fürnkranz +2
A change point detection (CPD) framework assisted by a predictive machine learning model called "Predict and Compare" is introduced and characterised in relation to other state-of-…
Explainable AI by BAPC -- Before and After correction Parameter Comparison
Florian Sobieczky, Manuela Geiß
A local surrogate for an AI-model correcting a simpler 'base' model is introduced representing an analytical method to yield explanations of AI-predictions. The approach is studied…
Graph-based calibration transfer
Ramin Nikzad-Langerodi, Florian Sobieczky
The problem of transferring calibrations from a primary to a secondary instrument, i.e. calibration transfer (CT), has been a matter of considerable research in chemometrics over t…
Random walks on random horospheric products
Vadim A. Kaimanovich, Florian Sobieczky
By developing the entropy theory of random walks on equivalence relations and analyzing the asymptotic geometry of horospheric products we describe the Poisson boundary for random…
Stochastic homogenization of horospheric tree products
Vadim A. Kaimanovich, Florian Sobieczky
We construct measures invariant with respect to equivalence relations which are graphed by horospheric products of trees. The construction is based on using conformal systems of bo…
Amenability of horocyclic products of percolation trees
Florian Sobieczky
For horocyclic products of percolation subtrees of regular trees, we show almost sure amenability. Under a symmetry condition concerning the growth of the two percolation trees, we…
Bounds for the annealed return probability on large finite percolation clusters
Florian Sobieczky
Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particula…
An interlacing technique for spectra of random walks and its application to finite percolation clusters
Florian Sobieczky
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature…