We study the frog model on $\mathbb Z^d$ and on the discrete tori $\mathbb T_L^d$, $d\ge 2$, with a symmetric, translation-invariant, and heavy-tailed transition kernel satisfying \[ Q(x,y)\asymp |x-y|^{-(d+\alpha)}, \qquad \alpha>0. \] Starting from an i.i.d. Poisson$(\lambda)$ number of sleeping particles per site and one active particle at the origin. Active particles perform independent $Q$-random walks and activate the particles they encounter. We first determine the timescale for activating distant vertices. When $\alpha\in(0,d)$, the time required to activate all vertices within distance $L$ of the origin is, with high probability, \[ (\log L)^{\Delta+o(1)}, \qquad \Delta^{-1}:=\log_2\left(\frac{2d}{d+\alpha}\right), \] as $L\to\infty$. This polylogarithmic spreading contrasts sharply with the linear spreading of the classical frog model driven by simple random walks; see Alves, Machado, and Popov (2002) and Ram\'irez and Sidoravicius (2004). When $\alpha>d$, we recover this classical linear behavior by proving matching linear upper and lower bounds; at $\alpha=d$, we prove a linear upper bound. Finally, we consider the finite-lifespan model on $\mathbb T_L^d$, in which each particle is removed after taking $\ell$ steps. We show that the cover lifespan, defined as the smallest $\ell$ for which the torus is entirely activated, is asymptotic to the cover time of a Poisson$(\lambda L^d)$ cloud of independent stationary random walkers.
We consider the weight-dependent random connection model on a Poisson point process of intensity $\lambda$ on $\mathbb{R}\times(0,1)$ in which the vertices $(x,t)$ and $(y,s)$ are joined precisely when $(t\vee s)|x-y|\le\beta$. Points at distance $d$ are joined with probability $\min(1,\beta/d)^2$, the critical decay of one-dimensional long-range percolation, and edges sharing a vertex are dependent through the common mark. We prove that the model has a genuine phase transition: for $\lambda\beta<1$ almost surely all connected components are finite, while for $\lambda\beta\ge31$ an infinite component exists, so at intensity one the critical value satisfies $\beta_c\in[1,31]$; a numerical study included as an appendix places it near $2$. By kernel and profile comparisons the supercritical bound extends to the age-dependent random connection model on the line, which with indicator profile has a non-degenerate phase transition at every value of its parameter, closing a case of the one-dimensional phase diagram left open in earlier work. The lower bound is proved by disconnecting nested pairs of long edges ("rainbows") with cut-point certificates, an argument developed first in a discrete skeleton of the model with the vertices pinned to $\mathbb{Z}$. The skeleton is of independent interest: it has no supercritical phase at all, jumping from total fragmentation to trivial connectivity even though almost surely infinitely many edges cross every fixed site. The supercritical argument is a Peierls argument on the binary tiling of the hyperbolic half-plane.
We study an interval-activation frog model on \(\mathbb Z\) with i.i.d.\ initial numbers of frogs \((\eta_x)_{x\in\mathbb Z}\), satisfying \(0<\mathbb{E}[\eta_0]<\infty\). Frogs at the origin are initially active and all others are sleeping. Each frog performs a symmetric integer-valued random walk and has a random lifetime \(L\) determined by an i.i.d.\ survival parameter \(\pi\in(0,1)\), with \(\mathbb{P}(L\ge k\mid \pi=p)=p^k\). Every jump activates all sleeping frogs at the integer sites between its endpoints. Let \(D^\to\) denote the maximal rightward displacement of a single frog before death. We derive survival and extinction criteria from the tail behavior of \(D^\to\). If \(\mathbb{P}(|\xi_1|\ge n)\sim n^{-\alpha}L_\xi(n)\), with \(L_\xi\) slowly varying, then survival holds with positive probability for \(0<\alpha<1\), while for \(\alpha=1\) both survival and almost sure extinction may occur. For \(1<\alpha<2\), assume \(\mathbb{P}(|\xi_1|>n)\sim c_\xi n^{-\alpha}\); in the finite-variance case assume \(\mathbb{E}[\xi_1]=0\) and \(\operatorname{Var}(\xi_1)=\sigma^2\in(0,\infty)\). Setting \(r=\alpha\) in the stable case and \(r=2\) in the finite-variance case, if the law of \(\pi\) has density \(f_\pi(u)\sim(1-u)^{\beta-1}\ell((1-u)^{-1})\) as \(u\uparrow1\), then, for \(0<\beta<1\), \(n\mathbb{P}(D^\to\ge n)\sim C_\beta n^{1-r\beta}\ell(n^r)\), with explicit \(C_\beta\). Hence the sharp off-critical threshold is \(\beta_c=1/r\): survival holds for \(\beta<1/r\), extinction holds almost surely for \(\beta>1/r\), and explicit sufficient conditions on the critical line leave a factor-four gap.
G. Carvalho, Fábio P. Machado, J. H. Ramírez-González· 0 citations
We consider a stochastic process on $\mathbb{Z}^d$ for $d \geq 1$. Given a translation invariant and ergodic starting configuration of finite clusters, each cluster $C$ performs a continuous time simple random walk with rate $|C|^{-\alpha}$. If it attempts to move to a vertex occupied by another cluster, it does not move, and instead the two clusters connect via a new edge. In all dimensions, we show that if $\alpha\ge 0$, there is almost surely no spontaneous creation of an infinite cluster within finite time. Moreover, for any $\alpha\le-1-2/d$ there is a finite-time blowup almost surely. In the regime $\alpha\in(-1,0)$ we show that the behavior greatly depends on the initial configuration. In addition, in dimension one, we establish the exact phase diagram.
Noam Berger, Eviatar B. Procaccia, Dominik Schmid et al.· 0 citations
We consider collisions of simple random walks on comb graphs $\mathrm{Comb}(\mathbb{Z},H)$, which are obtained by attaching vertical segments of the form $[0,H_x] \cap \mathbb{Z}$ to any point $x$ of the integer axis. For $\mathrm{Comb}(\mathbb{Z},H)$ with profile $H_x(x) = |x| \log^\gamma(|x| \vee 1)$, we show that two independent simple random walks starting from the same site collide infinitely often almost surely if $\gamma \leq 2$. If the tooth profile is taken as a typical realization of i.i.d. heavy-tailed random variables with $\textbf{P}(H_x>z) \sim Cz^{-\gamma}$ (with some $C>0$) as $z$ tends to infinity, we show that infinitely many collisions occur almost surely for two independent random walks if $\gamma>1/3$, whereas finitely many collisions occur almost surely if $\gamma \in (0,1/3)$, and for any $\gamma \in (0,1]$, three independent random walks only collide finitely many times, almost surely.
In this note, we consider the Sherrington--Kirkpatrick model with deterministic external field. Let $q=q(\beta,h)$ denote the solution of the replica-symmetric self-consistency equation \[ q=\mathbb E\tanh^2\!\left(h+\beta\sqrt q\,Z\right), \qquad Z\sim N(0,1), \] where $\beta$ and $h$ are inverse temperature and external field, respectively. By refining Lata\la's argument, previously limited to \(\beta<\frac{1}{2}\), and using the Kearns--Saul inequality, we prove overlap concentration and convergence of the free energy to the replica symmetric formula with error \(O(N^{-1})\) whenever \[ \beta^2\frac{q}{{\rm arctanh}q}<1. \] Note that for any $\beta<1$ and $h\in \mathbb R$, the condition above is satisfied. Moreover, for every nonzero $h$, this region contains a nonempty interval with $\beta>1$.
Let $\mathsf{d}\geq1$, $0<\mathsf{s}<\mathsf{d}$, and $N\geq1$. We prove that the optimal fixed-particle-number constant $\Lambda_N(\mathsf{s},\mathsf{d})$ in the Riesz Lieb--Oxford inequality is attained and that these constants are strictly increasing in $N$. The proof combines grand-canonical concentration--compactness with a strict one-particle extension. After recentering, a limiting plan arising from a maximizing sequence may assign positive probability to several particle numbers and hence be grand-canonical. A strict $N$-particle completion excludes this case, while the inequalities $\Lambda_N>\Lambda_k$ for $k<N$ exclude limits with a fixed lower particle number. Once attainment at particle number $N$ is known, the compact-support theorem of Di Marino and Lelotte arXiv:2607.11440, valid for all $0<\mathsf{s}<\mathsf{d}$, permits a non-product one-particle extension and yields $\Lambda_{N+1}(\mathsf{s},\mathsf{d})>\Lambda_N(\mathsf{s},\mathsf{d})$. Together, these implications close an induction beginning at $N=1$.
Matthew Rosenzweig· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
