Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Noela Müller"'
AbstarctRandom constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark examples for algorithms, and they have been harnessed in probabilistic constructions of comb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cef3d781fa152b666d84a6a10c6f3e6a
http://arxiv.org/abs/1802.09311
http://arxiv.org/abs/1802.09311
Autor:
Noela Müller, Ralph Neininger
Publikováno v:
Electron. J. Probab.
A cyclic urn is an urn model for balls of types $0,\ldots,m-1$. The urn starts at time zero with an initial configuration. Then, in each time step, first a ball is drawn from the urn uniformly and independently from the past. If its type is $j$, it i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42064fd75c43f9bab1c71bbd3420adb8
https://doi.org/10.1214/18-ejp243
https://doi.org/10.1214/18-ejp243
Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear system $A x=y$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4efc4e87cedbf1b9fccf53a71ca26bac
http://arxiv.org/abs/1710.07497
http://arxiv.org/abs/1710.07497
Autor:
Noela Müller, Ralph Neininger
Publikováno v:
ANALCO
A cyclic urn is an urn model for balls of types 0, . . . ,m − 1 where in each draw the ball drawn, say of type j, is returned to the urn together with a new ball of type j + 1 mod m. The case m = 2 is the well-known Friedman urn. The composition ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69908202ce62d02df0f50289b104beb0
https://doi.org/10.1137/1.9781611974324.11
https://doi.org/10.1137/1.9781611974324.11