English
Related papers

Related papers: Shearer's point process, the hard-sphere model and…

200 papers

We revisit the smallest non-physical singularity of the hard-sphere model in one dimension, also known as Tonks gas. We give an explicit expression of the free energy and reduced correlations at negative real fugacity and elaborate the…

Mathematical Physics · Physics 2015-04-13 Christoph Hofer-Temmel

Moser and Tardos (2010) gave an algorithmic proof of the lopsided Lov\'asz local lemma (LLL) in the variable framework, where each of the undesirable events is assumed to depend on a subset of a collection of independent random variables.…

Combinatorics · Mathematics 2020-06-16 Lefteris Kirousis , John Livieratos , Kostas I. Psaromiligkos

Constraint based causal structure learning for point processes require empirical tests of local independence. Existing tests require strong model assumptions, e.g. that the true data generating model is a Hawkes process with no latent…

Methodology · Statistics 2021-10-26 Nikolaj Thams , Niels Richard Hansen

The Lov\'asz Local Lemma is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events.…

Combinatorics · Mathematics 2017-11-21 Nicholas J. A. Harvey , Jan Vondrák

The Lov\'asz Local Lemma (LLL) is a very powerful tool in combinatorics and probability theory to show the possibility of avoiding all bad events under some weakly dependent conditions. In a seminal paper, Ambainis, Kempe, and Sattath (JACM…

Computational Complexity · Computer Science 2024-09-30 Kun He , Qian Li , Xiaoming Sun , Jiapeng Zhang

In a seminal paper (Moser and Tardos, JACM'10), Moser and Tardos developed a simple and powerful algorithm to find solutions to combinatorial problems in the variable Lov{\'a}sz Local Lemma (LLL) setting. Kolipaka and Szegedy (STOC'11)…

Data Structures and Algorithms · Computer Science 2021-11-15 Kun He , Qian Li , Xiaoming Sun

Let G=(V,E) be a locally finite graph. Let \vec{p}\in[0,1]^V. We show that Shearer's measure, introduced in the context of the Lovasz Local Lemma, with marginal distribution determined by \vec{p} exists on G iff every Bernoulli random field…

Probability · Mathematics 2012-09-19 Christoph Temmel

We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovasz local lemma in probabilistic combinatorics. We show that the conclusion of the Lovasz local lemma holds for dependency…

Statistical Mechanics · Physics 2015-06-24 Alexander D. Scott , Alan D. Sokal

We consider the behavior of spatial point processes when subjected to a class of linear transformations indexed by a variable T. It was shown in Ellis [Adv. in Appl. Probab. 18 (1986) 646-659] that, under mild assumptions, the transformed…

Probability · Mathematics 2007-05-23 Dominic Schuhmacher

We study a mathematical model of in situ leaching of rare metals, in which the joint filtration of two liquids is governed by the microscopic model $\mathbb{A}^{\varepsilon}$. A key difficulty is the unknown (free) boundary $\Gamma(r)$…

Analysis of PDEs · Mathematics 2026-04-27 Anvarbek Meirmanov , Akbota Senkebayeva

The paper is devoted to the study of the short rate equation of the form $$ dR(t)=F(R(t)) dt +\sum_{i=1}^{d}G(R(t-))dZ_i(t)$$ with deterministic functions $F,G_1,...,G_d$ and a multivariate L\'evy process $Z=(Z_1,...,Z_d)$ with possibly…

Probability · Mathematics 2024-08-01 Michał Barski , Rafał Łochowski

The Lov\'asz Local Lemma is a versatile result in probability theory, characterizing circumstances in which a collection of $n$ `bad events', each occurring with probability at most $p$ and dependent on a set of underlying random variables,…

Data Structures and Algorithms · Computer Science 2025-02-18 Peter Davies-Peck

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lov\'asz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved…

Data Structures and Algorithms · Computer Science 2020-06-09 Sebastian Brandt , Christoph Grunau , Václav Rozhoň

The Mat\'ern hard-core processes are classical examples for point process models obtained from (marked) Poisson point processes. Points of the original Poisson process are deleted according to a dependent thinning rule, resulting in a…

Probability · Mathematics 2017-09-19 Martin Dirrler , Martin Schlather

We study algorithmic applications of a natural discretization for the hard-sphere model and the Widom-Rowlinson model in a region $\mathbb{V}\subset\mathbb{R}^d$. These models are used in statistical physics to describe mixtures of one or…

Data Structures and Algorithms · Computer Science 2022-02-17 Tobias Friedrich , Andreas Göbel , Maximilian Katzmann , Martin S. Krejca , Marcus Pappik

Disagreement percolation connects a Gibbs lattice gas and i.i.d. site percolation on the same lattice such that non-percolation implies uniqueness of the Gibbs measure. This work generalises disagreement percolation to the hard-sphere model…

Probability · Mathematics 2019-07-02 Christoph Hofer-Temmel

A new type of dependent thinning for point processes in continuous space is proposed, which leverages the advantages of determinantal point processes defined on finite spaces and, as such, is particularly amenable to statistical, numerical,…

Machine Learning · Computer Science 2019-06-19 Bartłomiej Błaszczyszyn , Paul Keeler

In [Schuhmacher, Electron. J. Probab. 10 (2005), 165--201] estimates of the Barbour-Brown distance d_2 between the distribution of a thinned point process and the distribution of a Poisson process were derived by combining discretization…

Probability · Mathematics 2007-05-23 Dominic Schuhmacher

The Lovasz Local Lemma due to Erdos and Lovasz is a powerful tool in proving the existence of rare events. We present an extension of this lemma, which works well when the event to be shown to exist is a conjunction of individual events,…

Data Structures and Algorithms · Computer Science 2007-05-23 Aravind Srinivasan

We investigate the hyperuniformity of marked Gibbs point processes with weak dependencies among distant points whilst the interactions of close points are kept arbitrary. Some variants of stability and range assumptions are posed on the…

Probability · Mathematics 2024-01-17 David Dereudre , Daniela Flimmel
‹ Prev 1 2 3 10 Next ›