Sharp integral condition for linear growth of greedy lattice animals

We show that the necessary and sufficient condition for linear growth of greedy lattice animals with nonnegative i.i.d. vertex weights in every dimension $q\ge2$ is the same criterion for linear growth of directed last-passage times. We also obtain two-sided finite-size estimates, up to dimension-dependent constants, for the mean maximal weights of directed paths, lattice animals, valid for every nonnegative weights. These estimates determine the order of mean growth even when growth is superlinear. Since every up-right path from the origin is a lattice animal, the lower bound follows from the corresponding last-passage bound. For the upper bound, we couple the lattice weights to a Poisson process and represent each animal by a polygonal route of length proportional to its size.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24341
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Sharp integral condition for linear growth of greedy lattice animals

Jnaneshwar Baslingker, Bálint Virág, Daniel Spivak
arXiv (Cornell University)
Stochastic processes and statistical mechanics
preprint

Sharp integral condition for linear growth of greedy lattice animals

Jnaneshwar Baslingker, Bálint Virág, Daniel Spivak
preprint en

Abstract

We show that the necessary and sufficient condition for linear growth of greedy lattice animals with nonnegative i.i.d. vertex weights in every dimension $q\ge2$ is the same criterion for linear growth of directed last-passage times. We also obtain two-sided finite-size estimates, up to dimension-dependent constants, for the mean maximal weights of directed paths, lattice animals, valid for every nonnegative weights. These estimates determine the order of mean growth even when growth is superlinear. Since every up-right path from the origin is a lattice animal, the lower bound follows from the corresponding last-passage bound. For the upper bound, we couple the lattice weights to a Poisson process and represent each animal by a polygonal route of length proportional to its size.

arXiv (Cornell University)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon