Related papers: On the Statistical Analysis of Practical SPARQL Qu…
In the paper, the author derives several "diagonal" recurrence relations, constructs some inequalities, finds monotonicity, and poses a conjecture related to Stirling numbers of the second kind.
Statistical mechanical concepts and processes such as decoherence, correlation, and dissipation can prove to be of basic importance to understanding some fundamental issues of quantum cosmology and theoretical physics such as the choice of…
Answering queries over a federation of SPARQL endpoints requires combining data from more than one data source. Optimizing queries in such scenarios is particularly challenging not only because of (i) the large variety of possible query…
This article introduces the class of periodic trawl processes, which are continuous-time, infinitely divisible, stationary stochastic processes, that allow for periodicity and flexible forms of their serial correlation, including both…
A comprehensive uncertainty estimation is vital for the precision program of the LHC. While experimental uncertainties are often described by stochastic processes and well-defined nuisance parameters, theoretical uncertainties lack such a…
The adoption of Semantic Web technologies, and in particular the Open Data initiative, has contributed to the steady growth of the number of datasets and triples accessible on the Web. Most commonly, queries over RDF data are evaluated over…
Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…
Percolation is one of the simplest and nicest models in probability theory/statistical mechanics which exhibits critical phenomena. Dynamical percolation is a model where a simple time dynamics is added to the (ordinary) percolation model.…
The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global…
Feature requests are proposed by users to request new features or enhancements of existing features of software products, which represent users' wishes and demands. Satisfying users' demands can benefit the product from both competitiveness…
Two-way regular path queries (2RPQs) have received increased attention recently due to their ability to relate pairs of objects by flexibly navigating graph-structured data. They are present in property paths in SPARQL 1.1, the new standard…
In this paper, we propose a new approach for fast processing of SPARQL queries on large RDF datasets containing RDF quadruples (or quads). Our approach called RIQ employs a decrease-and-conquer strategy: Rather than indexing the entire RDF…
Statistically equivalent blocks are not frequently considered in the context of nonparametric two-sample hypothesis testing. Despite the limited exposure, this paper shows that a number of classical nonparametric hypothesis tests can be…
For decades, SQL has been the default language for composing queries, but it is increasingly used as an artifact to be read and verified rather than authored. With Large Language Models (LLMs), queries are increasingly machine-generated,…
Argumentation problems are concerned with determining the acceptability of a set of arguments from their relational structure. When the available information is uncertain, probabilistic argumentation frameworks provide modelling tools to…
Log-normal continuous random cascades form a class of multifractal processes that has already been successfully used in various fields. Several statistical issues related to this model are studied. We first make a quick but extensive review…
Single-parameter persistent homology, a key tool in topological data analysis, has been widely applied to data problems along with statistical techniques that quantify the significance of the results. In contrast, statistical techniques for…
We study the query complexity of computing a function f:{0,1}^n-->R_+ in expectation. This requires the algorithm on input x to output a nonnegative random variable whose expectation equals f(x), using as few queries to the input x as…
The problem of statistical inference in its various forms has been the subject of decades-long extensive research. Most of the effort has been focused on characterizing the behavior as a function of the number of available samples, with far…
In this paper, we present an embedding-based framework (TrQuery) for recommending solutions of a SPARQL query, including approximate solutions when exact querying solutions are not available due to incompleteness or inconsistencies of…