<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05773268</id>
  <dt>j</dt>
  <an>05773268</an>
  <augroup>
    <au>Amir, Gideon</au>
    <au>Gurel-Gurevich, Ori</au>
  </augroup>
  <ti>The diameter of a random Cayley graph of ${\mathbb{Z}}_q$.</ti>
  <so>Groups Complex. Cryptol. 2, No. 1, 59-65 (2010).</so>
  <py>2010</py>
  <pu>Walter de Gruyter, Berlin</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>random random walks</ut>
    <ut>random graphs</ut>
    <ut>Cayley graph</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1515/GCC.2010.004</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Consider the Cayley graph of the cyclic group of prime order $q$ with $k$ uniformly chosen generators. For fixed $k$, we prove that the diameter of said graph is asymptotically (in $q$) of order $\root k \of q$. This answers a question of Benjamini.</ab>
    <rv></rv>
  </abgroup>
</item>