Related papers: Densities of nested Archimedean copulas
Any multivariate distribution can be uniquely decomposed into marginal (1-point) distributions, and a function called the copula, which contains all of the information on correlations between the distributions. The copula provides an…
The article presents a generalization of the classical Hardy-Littlewood conjecture concerning the density of prime tuples to the case of tuples consisting of almost-prime numbers (numbers with a specified quantity of prime divisors). The…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
Density-based clustering relies on the idea of linking groups to some specific features of the probability distribution underlying the data. The reference to a true, yet unknown, population structure allows to frame the clustering problem…
High-dimensional clustering often relies on geometric or local-similarity structure, but the dominant separation between groups may not always be location-based. Differences in dispersion can create asymmetric local-neighborhood patterns:…
A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory,…
Complex networks have been widely used in science and technology because of their ability to represent several systems. One of these systems is found in Biochemistry, in which the synthesis of new nanoparticles is a hot topic. However, the…
This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…
This paper generalizes recent proposals of density forecasting models and it develops theory for this class of models. In density forecasting, the density of observations is estimated in regions where the density is not observed.…
We survey commutative and non-commutative analogs of uniform algebras in the Archimedean settings and also offer some non-Archimedean examples. Constraints on the development of non-complex uniform algebras are also discussed.
In this paper, we present a general formula for derived sets in general topology. Consequently, more results can be proved in general topology involving derived sets and isolated point sets. More specifically, we can prove that isolated…
In general, the distribution of residuals cannot be obtained explicitly. We give an asymptotic formula for the density of Pearson residuals in continuous generalized linear models corrected to order $n^{-1}$, where $n$ is the sample size.…
In this paper, we propose to obtain the skewed version of a unimodal symmetric density using a skewing mechanism that is not based on a cumulative distribution function. Then we disturb the unimodality of the resulting skewed density. In…
Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…
In this paper we consider a random partition of the plane into cells, the partition being based on the nodes and links of a {\it random planar geometric graph}. The resulting structure generalises the \emph{random \tes}\ hitherto studied in…
Log-concave distributions are an attractive choice for modeling and inference, for several reasons: The class of log-concave distributions contains most of the commonly used parametric distributions and thus is a rich and flexible…
The extraction of inhomogeneous 3-dimensional densities around tagged solutes from molecular simulations is known to have a very high computational cost because this is traditionally performed by collecting histograms, with each discrete…
Galled trees are widely studied as a recombination model in population genetics. This class of phylogenetic networks is generalized into galled networks by relaxing a structural condition. In this work, a linear recurrence formula is given…
For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…
Products between phase-type distributed random variables and any independent, positive and continuous random variable are studied. Their asymptotic properties are established, and an expectation-maximization algorithm for their effective…