Related papers: On the weight distribution of linear sets with com…
We introduce a novel class of Bayesian mixtures for normal linear regression models which incorporates a further Gaussian random component for the distribution of the predictor variables. The proposed cluster-weighted model aims to…
Modern data analysis often involves massive datasets with hundreds of thousands of observations, making traditional inference algorithms computationally prohibitive. Coresets are selection methods designed to choose a smaller subset of…
We construct symmetric representations of distributions over two-dimensional plane with given mean values as convex combinations of distributions with supports containing not more than three points and with the same mean values.
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
In this note, we classify all the weighted oriented forests whose edge ideals have the property that one of their matching powers has linear resolution.
Pairwise comparison matrices are frequently applied in multi-criteria decision making. A weight vector is called efficient if no other weight vector is at least as good in approximating the elements of the pairwise comparison matrix, and…
We review the main tools which allow for the statistical characterization of weighted networks. We then present two case studies, the airline connection network and the scientific collaboration network, which are representative of critical…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
Computing mountain passes is a standard way of finding critical points. We describe a numerical method for finding critical points that is convergent in the nonsmooth case and locally superlinearly convergent in the smooth finite…
In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on…
In this article, we study coupled fixed point theorems in newly appeared JS-metric spaces. It is important to note that the class of JS-metric spaces includes standard metric space, dislocated metric space, b-metric space etc. The purpose…
Robust estimators, like the median of a point set, are important for data analysis in the presence of outliers. We study robust estimators for locationally uncertain points with discrete distributions. That is, each point in a data set has…
We study the convergence of distributions on finite paths of weighted digraphs, namely the family of Boltzmann distributions and the sequence of uniform distributions. Targeting applications to the convergence of distributions on paths, we…
We establish fixed point theorems for nonlinear contractions on a metric space (not essentially complete) endowed with an arbitrary binary relation. Our results extend, generalize, modify and unify several known results especially those…
We describe the canonical correspondence between set of all finite metric spaces and set of special symmetric convex polytopes, and formulate the problem about classification of the metric spaces in terms of combinatorial structure of those…
Knowing which parts of a complex system have identical roles simplifies computations and reveals patterns in its network structure. Group theory has been applied to study symmetries in unweighted networks. However, in real-world weighted…
In this paper we consider linear systems of $\mathbb{P}^2$ with all but one of the base points of multiplicity 5. We give an explicit way to evaluate the dimensions of such systems.
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…
Persistence diagrams are efficient descriptors of the topology of a point cloud. As they do not naturally belong to a Hilbert space, standard statistical methods cannot be directly applied to them. Instead, feature maps (or representations)…
Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three zeros. Recently, \cite{Y-X-D12}…