[{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"mla":"Bandeira, Afonso S., et al. “Resilience for the Littlewood-Offord Problem.” Electronic Notes in Discrete Mathematics, vol. 61, Elsevier, 2017, pp. 93–99, doi:10.1016/j.endm.2017.06.025.","apa":"Bandeira, A. S., Ferber, A., & Kwan, M. A. (2017). Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2017.06.025","short":"A.S. Bandeira, A. Ferber, M.A. Kwan, Electronic Notes in Discrete Mathematics 61 (2017) 93–99.","ieee":"A. S. Bandeira, A. Ferber, and M. A. Kwan, “Resilience for the Littlewood-Offord problem,” Electronic Notes in Discrete Mathematics, vol. 61. Elsevier, pp. 93–99, 2017.","chicago":"Bandeira, Afonso S., Asaf Ferber, and Matthew Alan Kwan. “Resilience for the Littlewood-Offord Problem.” Electronic Notes in Discrete Mathematics. Elsevier, 2017. https://doi.org/10.1016/j.endm.2017.06.025.","ista":"Bandeira AS, Ferber A, Kwan MA. 2017. Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. 61, 93–99."},"dini_type":"doc-type:article","article_processing_charge":"No","external_id":{"arxiv":[]},"author":[{"last_name":"Bandeira","first_name":"Afonso S."},{"last_name":"Ferber","first_name":"Asaf"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","last_name":"Kwan","orcid":"0000-0002-4003-7567"}],"oa":1,"quality_controlled":"1","publication":"Electronic Notes in Discrete Mathematics","dc":{"source":["Bandeira AS, Ferber A, Kwan MA. Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. 2017;61:93-99. doi:10.1016/j.endm.2017.06.025"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2017.06.025","info:eu-repo/semantics/altIdentifier/issn/1571-0653","info:eu-repo/semantics/altIdentifier/arxiv/1609.08136"],"description":["Consider the sum X(ξ)=∑ni=1aiξi, where a=(ai)ni=1 is a sequence of non-zero reals and ξ=(ξi)ni=1 is a sequence of i.i.d. Rademacher random variables (that is, Pr[ξi=1]=Pr[ξi=−1]=1/2). The classical Littlewood-Offord problem asks for the best possible upper bound on the concentration probabilities Pr[X=x]. In this paper we study a resilience version of the Littlewood-Offord problem: how many of the ξi is an adversary typically allowed to change without being able to force concentration on a particular value? We solve this problem asymptotically, and present a few interesting open problems."],"identifier":["https://research-explorer.ista.ac.at/record/9574"],"date":["2017"],"publisher":["Elsevier"],"type":["info:eu-repo/semantics/article","doc-type:article","text","http://purl.org/coar/resource_type/c_6501"],"creator":["Bandeira, Afonso S.","Ferber, Asaf","Kwan, Matthew Alan"],"language":["eng"],"rights":["info:eu-repo/semantics/openAccess"],"title":["Resilience for the Littlewood-Offord problem"]},"day":"01","date_created":"2021-06-21T06:31:10Z","date_published":"2017-08-01T00:00:00Z","uri_base":"https://research-explorer.ista.ac.at","page":"93-99","_id":"9574","status":"public","article_type":"original","type":"journal_article","extern":"1","creator":{"id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","login":"asandaue"},"date_updated":"2023-02-23T14:01:26Z","oa_version":"Preprint","abstract":[{"lang":"eng"}],"intvolume":" 61","month":"08","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1609.08136"}],"scopus_import":"1","language":[{}],"publication_status":"published","publication_identifier":{"issn":[]},"volume":61}]