English
Related papers

Related papers: First-order convergence for $321$-avoiding permuta…

200 papers

In this paper we generalise a useful result due to J. Mierczynski which states that for a strictly cooperative system on the positive orthant, with increasing first integral, all bounded orbits are convergent. Moreover any equilibrium…

Dynamical Systems · Mathematics 2009-06-02 Murad Banaji , David Angeli

Let $\mathcal G$ be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all {\em connected} graphs in $\mathcal G$ on $n$…

Combinatorics · Mathematics 2018-01-10 Peter Heinig , Tobias Muller , Marc Noy , Anusch Taraz

We provide sufficient conditions for polynomial rate of convergence in the weak law of large numbers for supercritical general indecomposable multi-type branching processes. The main result is derived by investigating the embedded…

Probability · Mathematics 2014-11-07 Alexander Iksanov , Matthias Meiners

Equip the edges of the lattice $\mathbb{Z}^2$ with i.i.d. random capacities. We prove a law of large numbers for the maximal flow crossing a rectangle in $\mathbb{R}^2$ when the side lengths of the rectangle go to infinity. The value of the…

Probability · Mathematics 2010-01-14 Raphaël Rossignol , Marie Théret

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

Combinatorics · Mathematics 2023-06-22 Harry Crane , Stephen DeSalvo

We consider simple exclusion processes on Z for which the underlying random walk has a finite first moment and a non-zero mean and whose initial distributions are product measures with different densities to the left and to the right of the…

Probability · Mathematics 2011-11-10 E. Andjel , P. A. Ferrari , A. Siqueira

This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…

Logic in Computer Science · Computer Science 2022-04-06 Aliaume Lopez

We show that a first-order sentence is almost surely true in a random group of density d<1/2 if and only if it is true in a non-abelian free group.

Group Theory · Mathematics 2025-07-29 Olga Kharlampovich , Alexei Miasnikov , Rizos Sklinos

This article introduces three invariance principles under which P is different from NP. In the second part a theorem of convergence is proven. This theorem states that for any language L there exists an infinite sequence of languages from…

Computational Complexity · Computer Science 2007-05-23 Mircea Alexandru Popescu Moscu

We consider the standard first passage percolation model in $\mathbb{Z}^d$ for $d\geq 2$. We are interested in two quantities, the maximal flow $\tau$ between the lower half and the upper half of the box, and the maximal flow $\phi$ between…

Probability · Mathematics 2009-07-03 Raphaël Rossignol , Marie Théret

We prove a law of large numbers for a class of multidimensional random walks in random environments where the environment satisfies appropriate mixing conditions, which hold when the environment is a weak mixing field in the sense of…

Probability · Mathematics 2007-05-23 Francis Comets , Ofer Zeitouni

In this paper, we introduce a convergence notion for ordered selections. Our convergence notion is based on subpermutation densities and convergences of the marginal distributions. A particular case of this convergence is the well-known…

Probability · Mathematics 2025-11-18 B. Fazekas , I. Fazekas

In the spirit of a classical results for Crump-Mode-Jagers processes, we prove a strong law of large numbers for homogenous fragmentation processes. Specifically, for self-similar fragmentation processes, including homogenous processes, we…

Probability · Mathematics 2008-09-18 S. C. Harris , R. Knobloch , A. E. Kyprianou

Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…

Logic in Computer Science · Computer Science 2007-05-23 Stefan Ratschan

We prove that a class of monotone, \emph{$W_1$-contractive} schemes for scalar conservation laws converge at a rate of $\Delta x^2$ in the Wasserstein distance ($W_1$-distance), whenever the initial data is decreasing and consists of a…

Numerical Analysis · Mathematics 2018-08-02 Ulrik S. Fjordholm , Susanne Solem

Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…

Probability · Mathematics 2009-02-04 Carl Graham

The phenomenon of superconvergence is proved for all freely infinitely divisible distributions. Precisely, suppose that the partial sums of a sequence of free identically distributed, infinitesimal random variables converge in distribution…

Probability · Mathematics 2018-03-16 Hari Bercovici , Jiun-Chau Wang , Ping Zhong

In 1994, Nessyahu, Tadmor and Tassa studied convergence rates of monotone finite volume approximations of conservation laws. For compactly supported, $\Lip^+$-bounded initial data they showed a first-order convergence rate in the…

Numerical Analysis · Mathematics 2019-07-09 Adrian Montgomery Ruf , Espen Sande , Susanne Solem

We study the limiting behavior of the solutions to a class of conservation laws with vanishing nonlinear diffusion and dispersion terms. We prove the convergence to the entropy solution of the first order problem under a condition on the…

Analysis of PDEs · Mathematics 2007-11-06 Philippe G. LeFloch , Roberto Natalini

We study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…

Probability · Mathematics 2026-05-27 Guillaume Conchon--Kerjan , Toril Palaniappan