Results 41 to 50 of about 352 (164)

Fast and robust estimation of the multivariate errors in variables model. [PDF]

open access: yes
In the multivariate errors in variable models one wishes to retrieve a linear relationship of the form y = ß x + a, where both x and y can be multivariate. The variables y and x are not directly measurable, but observed with measurement error.
Croux, Christophe   +2 more
core  

Is It Easier to Count Communities Than Find Them?

open access: yesRandom Structures &Algorithms, Volume 68, Issue 4, July 2026.
ABSTRACT Random graph models with community structure have been studied extensively in the literature. For both the problems of detecting and recovering community structure, an interesting landscape of statistical and computational phase transitions has emerged. A natural unanswered question is: Might it be possible to infer properties of the community
Cynthia Rush   +3 more
wiley   +1 more source

Geometric Planted Matchings Beyond the Gaussian Model

open access: yesRandom Structures &Algorithms, Volume 68, Issue 4, July 2026.
ABSTRACT We consider the problem of recovering an unknown matching between a set of n$$ n $$ randomly placed points in ℝd$$ {\mathbb{R}}^d $$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution.
Lucas R. Schwengber, Roberto I. Oliveira
wiley   +1 more source

Combinatorics Of Topological Posets: Homotopy Complementation Formulas

open access: yes, 1998
. We show that the well known homotopy complementation formula of Bjorner and Walker admits several closely related generalizations on different classes of topological posets (lattices).
Živaljević, Rade T.   +1 more
core   +1 more source

Maximum Induced Trees and Forests of Bounded Degree in Random Graphs

open access: yesRandom Structures &Algorithms, Volume 68, Issue 4, July 2026.
ABSTRACT The asymptotic behavior of the maximum sizes of induced trees and forests has been studied extensively in the last few decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: (1) We prove 2‐point concentration of the maximum sizes of an induced forest and an induced tree with maximum ...
Margarita Akhmejanova   +2 more
wiley   +1 more source

The Symmetric Sugeno Integral [PDF]

open access: yes
We propose an extension of the Sugeno integral for negative numbers, in the spirit of the symmetric extension of Choquet integral, also called \Sipos\ integral.
Michel Grabisch
core  

Random Diophantine equations in the primes

open access: yesMathematika, Volume 72, Issue 3, July 2026.
Abstract We consider equations of the form a1x1k+⋯+asxsk=0$a_{1}x_{1}^{k}+\cdots +a_{s}x_{s}^{k}=0$ where the variables xi$x_{i}$ are all taken to be primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove that, whenever k⩾2$k\geqslant 2$, s⩾3k+2$s\geqslant 3k+2$, this holds
Philippa Holdridge
wiley   +1 more source

Partitioning a permutation graph: algorithms and an application. [PDF]

open access: yes
In this paper we discuss the problem of partitioning a permutation graph into cliques of bounded size, and describe a real-life application of this problem encountered at a manufacturing company.
Moonen, Linda, Spieksma, Frederik
core  

Rees products and lexicographic shellability

open access: yes, 2012
We use the theory of lexicographic shellability to provide various examples in which the rank of the homology of a Rees product of two partially ordered sets enumerates some set of combinatorial objects, perhaps according to some natural statistic on the
Shareshian, John   +8 more
core   +1 more source

Quantitative asymptotics for polynomial patterns in the primes

open access: yesMathematika, Volume 72, Issue 3, July 2026.
Abstract We prove quantitative estimates for averages of the von Mangoldt and Möbius functions along polynomial progressions n+P1(m),…,n+Pk(m)$n+P_1(m),\ldots, n+P_k(m)$ for a large class of polynomials Pi$P_i$. The error terms obtained save an arbitrary power of logarithm, matching the classical Siegel–Walfisz error term.
Lilian Matthiesen   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy