activity
20082022
most citedImproved bounds on coloring of graphs

4 citations · 7 across the 6 of their papers we have counts for

collaborators

7 papers

stat.ME2022★ 2 cited

Modified Galton-Watson processes with immigration under an alternative offspring mechanism

Wagner Barreto-Souza, Sokol Ndreca, Rodrigo B. Silva +1

We propose a novel class of count time series models alternative to the classic Galton-Watson process with immigration (GWI) and Bernoulli offspring. A new offspring mechanism is d…

stat.ME2018

Bias corrected minimum distance estimator for short and long memory processes

Gustavo C. Lana, Glaura C. Franco, Sokol Ndreca

This work proposes a new minimum distance estimator (MDE) for the parameters of short and long memory models. This bias corrected minimum distance estimator (BCMDE) considers a cor…

stat.ME2017

Inference for Stochastically Contaminated Variable Length Markov Chains

Denise Duarte, Sokol Ndreca, Wecsley O. Prates

In this paper, we present a methodology to estimate the parameters of stochastically contaminated models under two contamination regimes. In both regimes, we assume that the origin…

math.CO2014

A-priori Upper Bounds for the Set Covering Problem

Giovanni Felici, Sokol Ndreca, Aldo Procacci +1

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed d…

math.PR2013

Asymptotics for the Late Arrivals Problem

Carlo Lancia, Gianluca Guadagni, Sokol Ndreca +1

We study a discrete time queueing system where deterministic arrivals have i.i.d. exponential delays . The standard deviation of the delay is finite, but its value is mu…

math.CO2010★ 4 cited

Improved bounds on coloring of graphs

Sokol Ndreca, Aldo Procacci, Benedetto Scoppola

Given a graph with maximum degree , we prove that the acyclic edge chromatic number of is such that . Moreover we prove tha…