Partition expanders
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F17%3A00473687" target="_blank" >RIV/67985840:_____/17:00473687 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00224-016-9738-5" target="_blank" >http://dx.doi.org/10.1007/s00224-016-9738-5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00224-016-9738-5" target="_blank" >10.1007/s00224-016-9738-5</a>
Alternative languages
Result language
angličtina
Original language name
Partition expanders
Original language description
We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. While in the definition of expanders it is required that the number of edges between any pair of sufficiently large sets is close to the expected number, we consider partitions and require this condition only for most of the pairs of blocks. As a result, the blocks can be substantially smaller. We show that for some range of parameters, to be a partition expander a random graph needs exponentially smaller degree than any expander would require in order to achieve similar expanding properties. We apply the concept of partition expanders in communication complexity. First, we construct an optimal pseudo-random generator (PRG) for the Simultaneous Message Passing (SMP) model: it needs n + log k random bits against protocols of cost Omega(k).
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theory of Computing Systems
ISSN
1432-4350
e-ISSN
—
Volume of the periodical
60
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
18
Pages from-to
378-395
UT code for WoS article
000398890500001
EID of the result in the Scopus database
2-s2.0-85006124086