Zobrazeno 1 - 10
of 214
pro vyhledávání: '"Berend, Daniel"'
It is well known that almost every dilation of a sequence of real numbers, that diverges to $\infty$, is dense modulo~1. This paper studies the exceptional set of points -- those for which the dilation is not dense. Specifically, we consider the Haus
Externí odkaz:
http://arxiv.org/abs/2409.00775
Let $M(n, k, p)$ denote the maximum probability of the event $X_1 = X_2 = \cdots = X_n=1$ under a $k$-wise independent distribution whose marginals are Bernoulli random variables with mean $p$. A long-standing question is to calculate $M(n, k, p)$ fo
Externí odkaz:
http://arxiv.org/abs/2407.18688
Publikováno v:
Journal of Number Theory Volume 250, September 2023, Pages 84-123
Two lattice points are visible from one another if there is no lattice point on the open line segment joining them. Let $S$ be a finite subset of $\mathbb{Z}^k$. The asymptotic density of the set of lattice points, visible from all points of $S$, was
Externí odkaz:
http://arxiv.org/abs/2406.08197
Autor:
Barak-Pelleg, Dina, Berend, Daniel
Despite their frequency, denial-of-service (DoS\blfootnote{Denial of Service (DoS), Distributed Denial of Service (DDoS), Probabilistic Packet Marking (PPM), coupon collector's problem (CCP)}) and distributed-denial-of-service (DDoS) attacks are diff
Externí odkaz:
http://arxiv.org/abs/2304.05204
DoS and DDoS attacks are widely used and pose a constant threat. Here we explore Probability Packet Marking (PPM), one of the important methods for reconstructing the attack-graph and detect the attackers. We present two algorithms. Differently from
Externí odkaz:
http://arxiv.org/abs/2304.05123
Publikováno v:
In Theoretical Computer Science 1 February 2024 983
A natural problem in the context of the coupon collector's problem is the behavior of the maximum of independent geometrically distributed random variables (with distinct parameters). This question has been addressed by Brennan et al. (British J. of
Externí odkaz:
http://arxiv.org/abs/2005.03392
We tackle some fundamental problems in probability theory on corrupted random processes on the integer line. We analyze when a biased random walk is expected to reach its bottommost point and when intervals of integer points can be detected under a n
Externí odkaz:
http://arxiv.org/abs/2003.13561
Publikováno v:
In Journal of Number Theory September 2023 250:84-123
One of the most studied models of SAT is random SAT. In this model, instances are composed from clauses chosen uniformly randomly and independently of each other. This model may be unsatisfactory in that it fails to describe various features of SAT i
Externí odkaz:
http://arxiv.org/abs/1908.00089