194 search results - page 2 / 39 » Randomness for Free |
IJAC
2008
13 years 5 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
ALENEX
2004
13 years 6 months ago
2004
We study the asymptotic probability that a random composition of an integer n is gap-free, that is, that the sizes of parts in the composition form an interval. We show that this ...
CPC
2007
13 years 5 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...