Related papers: A Collective, Probabilistic Approach to Schema Map…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
Bayesian hierarchical Poisson models are an essential tool for analyzing count data. However, designing efficient algorithms to sample from the posterior distribution of the target parameters remains a challenging task for this class of…
We present an alternate formulation of the partial assignment problem as matching random clique complexes, that are higher-order analogues of random graphs, designed to provide a set of invariants that better detect higher-order structure.…
In this work we provide a way to introduce a probability measure on the space of minimal fillings of finite additive metric spaces as well as an algorithm for its computation. The values of probability, got from the analytical solution,…
This report concerns the information content of a graph, optionally conditional on one or more background, "common knowledge" graphs. It describes an algorithm to estimate this information content, and includes some examples based on…
Let $\mathfrak{R}$ and $\mathfrak{R}'$ be two associative rings (not necessarily with the identity elements). A bijective map $\varphi$ of $\mathfrak{R}$ onto $\mathfrak{R}'$ is called a \textit{$m$-multiplicative isomorphism} if {$\varphi…
The present paper upgrades the logical model required to exploit materialized views over property graphs as intended in the seminal paper "A Join Operator for Property Graphs". Furthermore, we provide some computational complexity proofs…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
In this paper, we study adaptive finite element approximations in a perturbation framework, which makes use of the existing adaptive finite element analysis of a linear symmetric elliptic problem. We prove the convergence and complexity of…
The standard procedures for analysing hierarquical or grouped data are by (non)linear mixed models or generalized mixed models. However, the generalized additive models for location, scale and shape (GAMLSSs) also allow different types of…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
It is well known that a binomial $(n,p)$ can be approximated by a Poisson distribution with parameter $np$. The typical approach in undergraduate probability texts is to show a convergence result for the distribution of the binomial as $n$…
Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…
This is a supplement to the paper "Liquidity based modeling of asset price bubbles via random matching". The supplement is organized as follows. First, we prove Theorem 3.13 in [1] which provides the existence of the dynamical system D…
Expanding a lower-dimensional problem to a higher-dimensional space and then projecting back is often beneficial. This article rigorously investigates this perspective in the context of finite mixture models, namely how to improve inference…
We provide a generalization of an algebraic linear combination for the trace of certain elliptic modular forms, and through specializing the expression at a suitable pair consisting of an elliptic curve over algebraic number fields and its…
In this short note we report on results on a computational search for a counterexample to the strong coincidence conjecture. In particular, we discuss the method used so that further searches can be conducted.
In this paper, we demonstrate that several classes of functions, specifically n-multiplicative isomorphisms, derivations, elementary maps, and Jordan elementary maps on a class of algebras that includes Jordan algebras with idempotents,…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
Recursive graph queries are increasingly popular for extracting information from interconnected data found in various domains such as social networks, life sciences, and business analytics. Graph data often come with schema information that…