Searcharxiv⌕ Search

arXiv subjects

Antal A. Járai

Publications and source records attributed to Antal A. Járai.

At least 19 recordsLinked to original sources

Scaling and partial universality of the height zero probability in the 2D Abelian sandpile

We study the extent of universality in the scaling of the height $0$ probability of the stationary Abelian sandpile on lattice approximations of a region $U \subset \mathbb{C}$ with lattice spacing $\varepsilon$ and with open boundary conditions. We show that under certain symmetry assumptions on the lattice, in the scaling limit $\varepsilon \to 0$ this probability at a point $z \in U$ equals $p_{\mathcal{G}}(0) + \varepsilon^2 c_{\mathcal{G}} f_U(z) + O(\varepsilon^3)$, where $p_{\mathcal{G}}(0)$ is the height $0$ probability on the full lattice, $c_{\mathcal{G}} > 0$ is a constant depending only on the lattice, and $f_U$ is a conformally covariant positive real-valued function depending only on $U$. This generalises a result of Brankov, Ivashkevich and Priezzhev (1993), who considered the square lattice and the upper half plane. It also generalizes Example 4.10 in the recent study of the fermionic DGFF of Adame-Carillo and Ruszel (2025). We show via counterexamples that our symmetry assumption cannot be omitted, although conformal covariance may be recovered via an unusual scaling. In particular, the natural analogue of our result fails on general isoradial graphs. Our work is motivated by Jeng, Piroux and Ruelle (2006), who computed the correction terms for all height variables in the special case of the upper half plane in $\mathbb{Z}^2$. They conjectured that their results hold more generally and the present paper is a step in an attempt to make this conjecture rigorous.

math.PR↗

The number of particles in activated random walk on the complete graph

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let the system stabilise following the activated random walk dynamics, obtaining a particle configuration with all sleeping particles. Particles visiting a boundary vertex are removed from the system. We characterise the support of the stationary distribution of this Markov chain, showing that, with high probability, the number of particles concentrates around the value $ρ_c N + a \sqrt{N \log N}$ with fluctuations of order at most $o( \sqrt{N \log N })$, where $N$ is the number of vertices. Due to the mean-field nature of the model, we are able to determine precisely the critical density $ρ_c= \fracλ{1+λ}$, where $λ$ is the sleeping rate, as well as the constant $a = \sqrtλ / (1 + λ) $ characterising the lower order shift. Our approach utilises results about super-martingales associated with activated random walk that are of independent interest.

math.PR↗

Bi-infinite incipient cluster in high dimensions

We consider high-dimensional percolation at the critical threshold. We condition the origin to be disjointly connected to two points, $x$ and $x'$, and subsequently take the limit as $|x|$, $|x'|$ as well as $|x-x'|$ diverge to infinity. This limiting procedure gives rise to a new percolation measure that locally resembles critical percolation but is concentrated on configurations with two disjoint infinite occupied paths. We coin this the bi-infinite incipient percolation cluster. It is mutually singular with respect to incipient infinite clusters that have been constructed in the literature. We achieve the construction through a double lace expansion of the cluster.

math.PR↗

Interlacement limit of a stopped random walk trace on a torus

We consider a simple random walk on $\mathbb{Z}^d$ started at the origin and stopped on its first exit time from $(-L,L)^d \cap \mathbb{Z}^d$. Write $L$ in the form $L = m N$ with $m = m(N)$ and $N$ an integer going to infinity in such a way that $L^2 \sim A N^d$ for some real constant $A > 0$. Our main result is that for $d \ge 3$, the projection of the stopped trajectory to the $N$-torus locally converges, away from the origin, to an interlacement process at level $A d σ_1$, where $σ_1$ is the exit time of a Brownian motion from the unit cube $(-1,1)^d$ that is independent of the interlacement process. The above problem is a variation on results of Windisch (2008) and Sznitman (2009).

math.PR↗

Asymptotics of the optimum in discrete sequential assignment

We consider the stochastic sequential assignment problem of Derman, Lieberman and Ross (1972) corresponding to a discrete distribution supported on a finite set of points. We use large deviation estimates to compute the asymptotics of the optimal policy as the number of tasks $N \to \infty$.

math.PR↗

Logarithmic correction to resistance

We study the trace of the incipient infinite oriented branching random walk in $\mathbb{Z}^d \times \mathbb{Z}_+$ when the dimension is $d = 6$. Under suitable moment assumptions, we show that the electrical resistance between the root and level $n$ is $O(n \log^{-ξ}n )$ for a $ξ> 0$ that does not depend on details of the model.

math.PR↗

On the tail of the branching random walk local time

Consider a critical branching random walk on $\mathbb{Z}^d$, $d\geq 1$, started with a single particle at the origin, and let $L(x)$ be the total number of particles that ever visit a vertex $x$. We study the tail of $L(x)$ under suitable conditions on the offspring distribution. In particular, our results hold if the offspring distribution has an exponential moment.

math.PR↗

Edgeworth expansion with error estimates for power law shot noise

Consider a homogeneous Poisson process in $\mathbb{R}^d$, $d \ge 1$. Let $R_1 < R_2 < \dots$ be the distances of the points from the origin, and let $S = R_1^{-γ} + R_2^{-γ} + \dots$, where $γ> d$ is a parameter. Let $\overline{S}^{(r)} = \sum_k R_k^{-γ} \, \mathbf{1}_{R_k \ge r}$ be the contribution to $S$ outside radius $r$. For large enough $r$, and any $\overline{s}$ in the support of $\overline{S}^{(r)}$, consider the change of measure that shifts the mean to $\overline{s}$. We derive rigorous error estimates for the Edgeworth expansion of the transformed random variable. Our error terms are uniform in $\overline{s}$, and we give explicitly the dependence of the error on $r$ and the order $k$ of the expansion. As an application, we provide a scheme that approximates the conditional distribution of $R_1$ given $S = s$ to any desired accuracy, with error bounds that are uniform in $s$. Along the way, we prove a stochastic comparison between $(R_1, R_2, \dots)$ given $S = s$ and unconditioned radii $(R'_1, R'_2, \dots)$.

math.PR↗

Sandpile models

This survey is an extended version of lectures given at the Cornell Probability Summer School 2013. The fundamental facts about the Abelian sandpile model on a finite graph and its connections to related models are presented. We discuss exactly computable results via Majumdar and Dhar's method. The main ideas of Priezzhev's computation of the height probabilities in 2D are also presented, including explicit error estimates involved in passing to the limit of the infinite lattice. We also discuss various questions arising on infinite graphs, such as convergence to a sandpile measure, and stabilizability of infinite configurations.

math.PR↗

Inequalities for critical exponents in $d$-dimensional sandpiles

Consider the Abelian sandpile measure on $\mathbb{Z}^d$, $d \ge 2$, obtained as the $L \to \infty$ limit of the stationary distribution of the sandpile on $[-L,L]^d \cap \mathbb{Z}^d$. When adding a grain of sand at the origin, some region, called the avalanche cluster, topples during stabilization. We prove bounds on the behaviour of various avalanche characteristics: the probability that a given vertex topples, the radius of the toppled region, and the number of vertices toppled. Our results yield rigorous inequalities for the relevant critical exponents. In $d = 2,$ we show that for any $1 \le k < \infty$, the last $k$ waves of the avalanche have an infinite volume limit, satisfying a power law upper bound on the tail of the radius distribution.

math.PR↗

Phase transition in a sequential assignment problem on graphs

We study the following game on a finite graph $G = (V, E)$. At the start, each edge is assigned an integer $n_e \ge 0$, $n = \sum_{e \in E} n_e$. In round $t$, $1 \le t \le n$, a uniformly random vertex $v \in V$ is chosen and one of the edges $f$ incident with $v$ is selected by the player. The value assigned to $f$ is then decreased by $1$. The player wins, if the configuration $(0, \dots, 0)$ is reached; in other words, the edge values never go negative. Our main result is that there is a phase transition: as $n \to \infty$, the probability that the player wins approaches a constant $c_G > 0$ when $(n_e/n : e \in E)$ converges to a point in the interior of a certain convex set $\mathcal{R}_G$, and goes to $0$ exponentially when $(n_e/n : e \in E)$ is bounded away from $\mathcal{R}_G$. We also obtain upper bounds in the near-critical region, that is when $(n_e/n : e \in E)$ lies close to $\partial \mathcal{R}_G$. We supply quantitative error bounds in our arguments.

math.PR↗

Geometry of the uniform spanning forest components in high dimensions

In this note we study the geometry of the component of the origin in the Uniform Spanning Forest of $\mathbb{Z}^d$, as well as in the Uniform Spanning Tree of wired subgraphs of $\mathbb{Z}^d$, when $d \ge 5$. In particular, we study connectivity properties with respect to the Euclidean and the intrinsic distance. We intend to supplement these with further estimates in the future. We are making this preliminary note available, as one of our estimates is used in work of Bhupatiraju, Hanson and Járai on sandpiles.

math.PR↗

Anchored burning bijections on finite and infinite graphs

Let $G$ be an infinite graph such that each tree in the wired uniform spanning forest on $G$ has one end almost surely. On such graphs $G$, we give a family of continuous, measure preserving, almost one-to-one mappings from the wired spanning forest on $G$ to recurrent sandpiles on $G$, that we call anchored burning bijections. In the special case of $\mathbb{Z}^d$, $d \ge 2$, we show how the anchored bijection, combined with Wilson's stacks of arrows construction, as well as other known results on spanning trees, yields a power law upper bound on the rate of convergence to the sandpile measure along any exhaustion of $\mathbb{Z}^d$. We discuss some open problems related to these findings.

math.PR↗

Approaching criticality via the zero dissipation limit in the abelian avalanche model

The discrete height abelian sandpile model was introduced by Bak, Tang & Wiesenfeld and Dhar as an example for the concept of self-organized criticality. When the model is modified to allow grains to disappear on each toppling, it is called bulk-dissipative. We provide a detailed study of a continuous height version of the abelian sandpile model, called the abelian avalanche model, which allows an arbitrarily small amount of dissipation to take place on every toppling. We prove that for non-zero dissipation, the infinite volume limit of the stationary measure of the abelian avalanche model exists and can be obtained via a weighted spanning tree measure. We show that in the whole non-zero dissipation regime, the model is not critical, i.e., spatial covariances of local observables decay exponentially. We then study the zero dissipation limit and prove that the self-organized critical model is recovered, both for the stationary measure and for the dynamics. We obtain rigorous bounds on toppling probabilities and introduce an exponent describing their scaling at criticality. We rigorously establish the mean-field value of this exponent for $d > 4$.

math.PR↗

Abelian sandpiles: an overview and results on certain transitive graphs

We review the Majumdar-Dhar bijection between recurrent states of the Abelian sandpile model and spanning trees. We generalize earlier results of Athreya and Jarai on the infinite volume limit of the stationary distribution of the sandpile model on Z^d, d >= 2, to a large class of graphs. This includes: (i) graphs on which the wired spanning forest is connected and has one end; (ii) transitive graphs with volume growth at least c n^5 on which all bounded harmonic functions are constant. We also extend a result of Maes, Redig and Saada on the stationary distribution of sandpiles on infinite regular trees, to arbitrary exhaustions.

math.PR↗

Rate of convergence estimates for the zero dissipation limit in Abelian sandpiles

We consider a continuous height version of the Abelian sandpile model with small amount of bulk dissipation gamma > 0 on each toppling, in dimensions d = 2, 3. In the limit gamma -> 0, we give a power law upper bound, based on coupling, on the rate at which the stationary measure converges to the discrete critical sandpile measure. The proofs are based on a coding of the stationary measure by weighted spanning trees, and an analysis of the latter via Wilson's algorithm. In the course of the proof, we prove an estimate on coupling a geometrically killed loop-erased random walk to an unkilled loop-erased random walk.

math.PR↗

The size of a pond in 2D invasion percolation

We consider invasion percolation on the square lattice. It has been proved by van den Berg, Peres, Sidoravicius and Vares, that the probability that the radius of a so-called pond is larger than n, differs at most a factor of order log n from the probability that in critical Bernoulli percolation the radius of an open cluster is larger than n. We show that these two probabilities are, in fact, of the same order. Moreover, we prove an analogous result for the volume of a pond.

math.PR↗