C. Pelekis

activity

20132023

most citedA limit theorem for small cliques in inhomogeneous random graphs

10 citations · 34 across the 19 of their papers we have counts for

collaborators

21 papers

math.CO2023

A binomial random multigraph

Christos Pelekis

Fix a positive integer $n$ , a real number $p \in (0, 1]$ , and a (perhaps random) hypergraph $H$ on $[n]$ . We introduce and investigate the following random multigraph model…

cs.DM2021

A note on the network coloring game: A randomized distributed $(Δ + 1)$ -coloring algorithm

Nikolaos Fryganiotis, Symeon Papavassiliou, Christos Pelekis

The network coloring game has been proposed in the literature of social sciences as a model for conflict-resolution circumstances. The players of the game are the vertices of a gra…

cs.GT2021

A Fragile multi-CPR Game

Christos Pelekis, Panagiotis Promponas, Juan Alvarado +2

A Fragile CPR Game is an instance of a resource sharing game where a common-pool resource, which is prone to failure due to overuse, is shared among several players. Each player ha…

math.PR2020★ 2 cited

Some inequalities on Binomial and Poisson probabilities

Robbert Fokkink, Symeon Papavassiliou, Christos Pelekis

Let $S$ and $X$ be independent random variables, assuming values in the set of non-negative integers, and suppose further that both $E (S)$ and $E (X)$ are integers…

math.PR2020

Optimizing stakes in simultaneous bets

Robbert Fokkink, Ludolf Meester, Christos Pelekis

We want to find the convex combination $S$ of iid Bernoulli random variables that maximizes $P (S \geq t)$ for a given threshold~ $t$ . Csóka conjectured that such an $S$ is a…

math.CA2019

On $k$ -antichains in the unit $n$ -cube

Christos Pelekis, Václav Vlasák

A \emph{chain} in the unit $n$ -cube is a set $C \subset [0, 1]^{n}$ such that for every $x = (x_{1}, \dots, x_{n})$ and $y = (y_{1}, \dots, y_{n})$ in $C$ we either have $x_i\le y_…