English
Related papers

Related papers: The Lov\'{a}sz Local Lemma is Not About Probabilit…

200 papers

In $p$-adic Hodge theory and the $p$-adic Langlands program, Banach spaces with $\mathbb{Q}_p$-coefficients and $p$-adic Lie group actions are central. Studying the subrepresentation of $\Gamma$-locally analytic vectors, $W^{\mathrm{la}}$,…

Number Theory · Mathematics 2025-09-29 Gal Porat

The Blow-up Lemma established by Koml\'os, S\'ark\"ozy, and Szemer\'edi in 1997 is an important tool for the embedding of spanning subgraphs of bounded maximum degree. Here we prove several generalisations of this result concerning the…

Combinatorics · Mathematics 2013-05-10 Julia Böttcher , Yoshiharu Kohayakawa , Anusch Taraz , Andreas Würfl

Many standard estimators such as several maximum likelihood estimators or the empirical estimator for any law-invariant convex risk measure are not (qualitatively) robust in the classical sense. However, these estimators may nevertheless…

Statistics Theory · Mathematics 2016-06-21 Volker Krätschmer , Alexander Schied , Henryk Zähle

In this article, we prove a local large deviation principle (LLDP) for the empirical locality measure of typed random networks on $n$ nodes conditioned to have a given \emph{ empirical type measure} and \emph{ empirical link measure.} From…

Information Theory · Computer Science 2018-02-27 Kwabena Doku-Amponsah

In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…

Probability · Mathematics 2012-10-24 D. A. Croydon , B. M. Hambly

In this paper we make a novel use of the Johnson-Lindenstrauss Lemma. The Lemma has an existential form saying that there exists a JL transformation $f$ of the data points into lower dimensional space such that all of them fall into…

Data Structures and Algorithms · Computer Science 2017-11-10 Mieczysław A. Kłopotek

Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low (almost-) independence. A series of papers, beginning with Luby (1993) and continuing with Berger…

Data Structures and Algorithms · Computer Science 2023-10-13 David G. Harris

We consider a random walk $(Y_N)_{N\geq 0}$ on $\mathbb{R}^2$ generated by successively applying independent random isometries, drawn from a fixed measure $\mu$, to the point $0$. When the support of $\mu$ is finite and includes an…

Probability · Mathematics 2026-01-26 Reuben Drogin , Felipe Hernández

We study the local stability of nonlinear systems in the Lur'e form with static nonlinear feedback realized by feedforward neural networks (FFNNs). By leveraging positivity system constraints, we employ a localized variant of the Aizerman…

Systems and Control · Electrical Eng. & Systems 2025-10-07 Hamidreza Montazeri Hedesh , Moh Kamalul Wafi , Milad Siami

We study the detailed path-wise behavior of the discrete-time Langevin algorithm for non-convex Empirical Risk Minimization (ERM) through the lens of metastability, adopting some techniques from Berglund and Gentz (2003. For a particular…

Machine Learning · Computer Science 2020-07-27 Belinda Tzen , Tengyuan Liang , Maxim Raginsky

Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem} asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9…

Discrete Mathematics · Computer Science 2014-04-29 Joel Ouaknine , James Worrell

Given integers $n > k > 0$, and a set of integers $L \subset [0, k-1]$, an \emph{$L$-system} is a family of sets $\mathcal{F} \subset \binom{[n]}{k}$ such that $|F \cap F'| \in L$ for distinct $F, F'\in \mathcal{F}$. $L$-systems correspond…

Combinatorics · Mathematics 2024-08-15 William Linz

The hypergraph container lemma is a powerful tool in probabilistic combinatorics that has found many applications since it was first proved a decade ago. Roughly speaking, it asserts that the family of independent sets of every uniform…

Combinatorics · Mathematics 2024-09-20 Marcelo Campos , Wojciech Samotij

In this paper, based on the initiation of the notion of negatively associated random variables under nonlinear probability, a strong limit theorem for weighted sums of random variables within the same frame is achieved without assumptions…

Probability · Mathematics 2017-06-20 Yuting Lan , Ning Zhang

One of the cornerstones of the distributed complexity theory is the derandomization result by Chang, Kopelowitz, and Pettie [FOCS 2016]: any randomized LOCAL algorithm that solves a locally checkable labeling problem (LCL) can be…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-16 Sameep Dahal , Francesco d'Amore , Henrik Lievonen , Timothé Picavet , Jukka Suomela

We give a Markov chain based perfect sampler for uniform sampling solutions of constraint satisfaction problems (CSP). Under some mild Lov\'asz local lemma conditions where each constraint of the CSP has a small number of forbidden local…

Data Structures and Algorithms · Computer Science 2021-07-09 Kun He , Xiaoming Sun , Kewen Wu

This paper addresses arguments that "separability" is an assumption of Bell's theorem, and that abandoning this assumption in our interpretation of quantum mechanics (a position sometimes referred to as "holism") will allow us to restore a…

Quantum Physics · Physics 2013-09-02 Joe Henson

We identify the critical deviation scale governing Bayesian evidence accumulation in regular parametric testing. Under integrated Bayes risk with zero-one loss, the risk-optimal rejection boundary lies in a moderate deviation regime, with a…

Statistics Theory · Mathematics 2026-03-23 Jyotishka Datta , Nicholas G. Polson , Vadim Sokolov , Daniel Zantedeschi

Random walks and Lorentz processes serve as fundamental models for Brownian motion. The study of random walks is a favorite object of probability theory, whereas that of Lorentz processes belongs to the theory of hyperbolic dynamical…

Probability · Mathematics 2025-01-03 Domokos Szasz

We study the spectral properties of sparse random graphs with different topologies and type of interactions, and their implications on the stability of complex systems, with particular attention to ecosystems. Specifically, we focus on the…

Disordered Systems and Neural Networks · Physics 2024-03-13 Pietro Valigi , Izaak Neri , Chiara Cammarota
‹ Prev 1 8 9 10 Next ›