Related papers: A Collective, Probabilistic Approach to Schema Map…
The purpose of this note is to give a number of open problems on matching theory and their relation to the well-known results in this area. We also give a linear analogue of the acyclic matchings.
We propose to approximate the conditional expectation of a spatial random variable given its nearest-neighbour observations by an additive function. The setting is meaningful in practice and requires no unilateral ordering. It is capable of…
This paper discusses a method for implementing a probabilistic inference system based on an extended relational data model. This model provides a unified approach for a variety of applications such as dynamic programming, solving sparse…
In this paper we develop further the multi-parameter model of random simplicial complexes. Firstly, we give an intrinsic characterisation of the multi-parameter probability measure. Secondly, we show that in multi-parameter random…
This note presents an approach to studying the iterates of a mapping whose restriction to the complement of a finite set is continuous and open. The main examples to which the approach can be applied are piecewise monotone mappings defined…
Joint models for longitudinal and time-to-event data have seen many developments in recent years. Though spatial joint models are still rare and the traditional proportional hazards formulation of the time-to-event part of the model is…
In this paper, we give a new class of reconstructible graphs, which is an extension of my paper `A class of reconstructible graphs'.
Increasing availability of vehicle GPS data has created potentially transformative opportunities for traffic management, route planning and other location-based services. Critical to the utility of the data is their accuracy. Map-matching…
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…
A simple construction is presented, which generalises piecewise linear one-dimensional Markov maps to an arbitrary number of dimensions. The corresponding coupled map lattice, known as a simplicial mapping in the mathematical literature,…
Many important questions about a model cannot be answered just by explaining how much each feature contributes to its output. To answer a broader set of questions, we generalize a popular, mathematically well-grounded explanation technique,…
One of the most popular methods of the machine learning prediction explanation is the SHapley Additive exPlanations method (SHAP). An imprecise SHAP as a modification of the original SHAP is proposed for cases when the class probability…
For a given extension $A \subset E$ of associative algebras we describe and classify up to an isomorphism all $A$-complements of $E$, i.e. all subalgebras $X$ of $E$ such that $E = A + X$ and $A \cap X = \{0\}$. Let $X$ be a given…
We introduce the notion of an approximation system as a generalization of Taylor approximation, and we give some first examples. Next we develop the general theory, including error bounds and a sufficient criterion for convergence. More…
Pluralistic image completion focuses on generating both visually realistic and diverse results for image completion. Prior methods enjoy the empirical successes of this task. However, their used constraints for pluralistic image completion…
In the open map approach to bisimilarity, the paths and their runs in a given state-based system are the first-class citizens, and bisimilarity becomes a derived notion. While open maps were successfully used to model bisimilarity in…
Non-parametric methods avoid the problem of having to specify a particular data generating mechanism, but can be computationally intensive, reducing their accessibility for large data problems. Empirical likelihood, a non-parametric…
A map is a panorama in small scale. In this half-survey, half-research paper we give general results on Ramanujan expansions. We don't include the ocean of results from the literature on the two classes (see Schwarz-Spilker Book, also…
This letter gives approximations to an integral appearing in the formula for downlink coverage probability of a typical user in Poisson point process (PPP) based stochastic geometry frameworks of the form $\int_0^\infty \exp\{ - (Ax + B…
We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of Lam et al. We introduce a formalism, called search schemes, to specify search strategies of this type, then…