Related papers: Greedy lattice animals: geometry and criticality (…
A spread-out lattice animal is a finite connected set of edges in $\{ \{x,y\} \subset \mathbb{Z}^d:0<||x-y||\le L \}$. A lattice tree is a lattice animal with no loops.The best estimate on the critical point $p_c$ so far was achieved by…
Consider a family of random masses $\mathbf{m}(v)$ indexed by vertices of the lattice $\mathbb Z^d$. In the case where the masses are i.i.d.\ and satisfy a certain moment condition, it is known that there exists a deterministic $A\ge 0$…
Lattice animals provide a discretized model for the theta transition displayed by branched polymers in solvent. Exact graph enumeration studies have given some indications that the phase diagram of such lattice animals may contain two…
Let $\{X_{v}:v\in\mathbb{Z}^d\}$ be i.i.d. random variables. Let $S(\pi)=\sum_{v\in\pi}X_v$ be the weight of a self-avoiding lattice path $\pi$. Let \[M_n=\max\{S(\pi):\pi\text{ has length }n\text{ and starts from the origin}\}.\] We are…
In the Poisson zoo on an infinite Cayley graph $G$, we take a probability measure $\nu$ on rooted finite connected subsets, called lattice animals, and place i.i.d. Poisson($\lambda$) copies of them at each vertex. If the expected volume of…
We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…
We have developed an improved algorithm that allows us to enumerate the number of site animals on the square lattice up to size 46. We also calculate the number of lattice trees up to size 44 and the radius of gyration of both lattice…
We study the statistics of column-convex lattice animals resulting from the stacking of squares on a single or double staircase. We obtain exact expressions for the number of animals with a given length and area, their mean length and their…
We consider the local limit of finite uniformly distributed directed animals on the square lattice viewed from the root. Two constructions of the resulting uniform infinite directed animal are given: one as a heap of dominoes, constructed…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
We provide combinatorial arguments based on a two-dimensional extension of a locally-free semigroup allowing us to compute the growth rate, $\Lambda$, of the partition function $Z_N=N^{\theta}\Lambda^N$ of the $N$-particle directed animals…
Three-dimensional $Z(N)$ lattice gauge theories are studied numerically at finite temperature for $N$ = 5, 6, 8, 12, 13, 20 and for $N_t$=2,4,8. For each model the location of phase transitions and its critical indices are determined. The…
We examine the percolation model on $\mathbb{Z}^d$ by an approach involving lattice animals and their surface-area-to-volume ratio. For $\beta \in [0,2(d-1))$, let $f(\beta)$ be the asymptotic exponential rate in the number of edges of the…
We present an implementation of Redelemeier's algorithm for the enumeration of lattice animals in high dimensional lattices. The implementation is lean and fast enough to allow us to extend the existing tables of animal counts, perimeter…
Consider the continuous greedy paths model: given a $d$-dimensional Poisson point process with positive marks interpreted as masses, let $\mathrm P(\ell)$ denote the maximum mass gathered by a path of length $\ell$ starting from the origin.…
The unit-distance graph on the $n$-dimensional integer lattice $\mathbb{Z}^n$ is called the $n$-dimensional grid. We attempt to maximize the girth of a $k$-regular (possibly induced) subgraph of the $n$-dimensional grid, and provide…
Here we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice…
We consider minimal-perimeter lattice animals, providing a set of conditions which are sufficient for a lattice to have the property that inflating all minimal-perimeter animals of a certain size yields (without repetitions) all…
We discuss some aspects of the continuum limit of some lattice models, in particular the $2D$ $O(N)$ models. The continuum limit is taken either in an infinite volume or in a box whose size is a fixed fraction of the infinite volume…