English
Related papers

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

200 papers

The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…

Information Theory · Computer Science 2016-11-15 Yu Tsunoda , Yuichiro Fujiwara

We study continuous time random walks on $\mathbb{Z}^d$ (with $d \geq 2$) among random conductances $\{ \omega(\{x,y\}) : x,y \in \mathbb{Z}^d\}$ that permit jumps of arbitrary length. The law of the random variables $\omega(\{x,y\})$,…

Probability · Mathematics 2023-11-21 Sebastian Andres , Martin Slowik

This paper provides a systematic analysis of Bell experiments from the relational perspective, demonstrating that the apparent ``nonlocality'' of quantum mechanics stems from a problematic application of relativistic principles rather than…

Quantum Physics · Physics 2025-09-11 Jan van Neerven , Marijn Waaijer

We study preferential attachment models where vertices enter the network with i.i.d. random numbers of edges that we call the out-degree. We identify the local limit of such models, substantially extending the work of Berger et al.(2014).…

Probability · Mathematics 2026-03-03 Alessandro Garavaglia , Rajat Subhra Hazra , Remco van der Hofstad , Rounak Ray

We study the path behaviour of a simple random walk on the 2-dimensional comb lattice ${\mathbb C}^2$ that is obtained from ${\mathbb Z}^2$ by removing all horizontal edges off the x-axis. In particular, we prove a strong approximation…

Probability · Mathematics 2009-02-26 E. Csaki , M. Csorgo , A. Foldes , P. Revesz

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…

Combinatorics · Mathematics 2020-08-26 Andrzej Grzesik , Daniel Král' , László Miklós Lovász

In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…

Probability · Mathematics 2024-03-25 Steffen Dereich

In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…

Combinatorics · Mathematics 2009-05-18 Tobias Ahsendorf

Schramm's Locality Conjecture asserts that the value of the critical percolation parameter $p_c$ of a graph satisfying $p_c<1$ depends only on its local structure. In this note, we prove this conjecture in the particular case of transitive…

Probability · Mathematics 2022-05-23 Daniel Contreras , Sébastien Martineau , Vincent Tassion

We generalize the generalized likelihood ratio (GLR) method through a novel push-out Leibniz integration approach. Extending the conventional push-out likelihood ratio (LR) method, our approach allows the sample space to be…

Methodology · Statistics 2025-05-02 Xingyu Ren , Michael C. Fu

The objective of this paper is to study the characteristics (geometric and otherwise) of very large attribute based undirected networks. Real-world networks are often very large and fast evolving. Their analysis and understanding present a…

Applications · Statistics 2015-10-06 Koushiki Sarkar , Diganta Mukherjee

In this paper, we derive a central limit theorem for collections of weakly correlated random variables indexed by discrete metric spaces, where the correlation decays in the distance of the indices. The correlation structure we study…

Probability · Mathematics 2022-02-11 Michael Fleermann , Werner Kirsch

We study the Lovasz number theta along with two further SDP relaxations theta1, theta1/2 of the independence number and the corresponding relaxations of the chromatic number on random graphs G(n,p). We prove that these relaxations are…

Combinatorics · Mathematics 2017-11-17 Amin Coja-Oghlan

Potential functions in highly pertinent applications, such as deep learning in over-parameterized regime, are empirically observed to admit non-isolated minima. To understand the convergence behavior of stochastic dynamics in such…

Machine Learning · Computer Science 2025-02-18 Yun Gong , Zebang Shen , Niao He

Relativistic nonlocality (RNL) is a recently proposed relativistic nonlocal description which unifies relativity of simultaneity and superluminal nonlocality (without superluminal signaling). In this article RNL is applied to experiments…

Quantum Physics · Physics 2009-10-30 Antoine Suarez

The maximum likelihood threshold (MLT) of a graph $G$ is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding Gaussian graphical model. We give a new characterization of…

The amount of nonlocality in quantum theory is limited compared to that allowed in generalized no-signaling theory [Found. Phys. 24, 379 (1994)]. This feature, for example, gets manifested in the amount of Bell inequality violation as well…

Quantum Physics · Physics 2014-03-31 Subhadipa Das , Manik Banik , Md. Rajjak Gazi , Ashutosh Rai , Samir Kunkri

In this paper, we study a class of one-dimensional nonlocal nonlinear Schr\"odinger equations on the line with nonlinearity given by a Fourier multiplier whose symbol has subcritical high-frequency growth. In terms of symbol order, this…

Analysis of PDEs · Mathematics 2026-03-31 Sonae Hadama

We examine the locality assumption of Bell's theorem in three steps of EPRB experiment. Depending on the context, locality is embodied in the conditions of separability, local causality, factorizability, relativistic causality, and…

Quantum Physics · Physics 2017-04-28 Afshin Shafiee , Farhad Taher Ghahramani

In set theory without the Axiom of Choice (AC), we observe new relations of the following statements with weak choice principles. 1. Every locally finite connected graph has a maximal independent set. 2. Every locally countable connected…

Logic · Mathematics 2024-02-27 Amitayu Banerjee