相关论文: NoBLE for lattice trees and lattice animals
We introduce a formula for translating any upper bound on the percolation threshold of a lattice \g into a lower bound on the exponential growth rate of lattice animals $a(G)$ and vice-versa. We exploit this to improve on the best known…
We perform numerical simulations of the lattice-animal problem at the upper critical dimension d=8 on hypercubic lattices in order to investigate logarithmic corrections to scaling there. Our stochastic sampling method is based on 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…
The statistics of a long closed self-avoiding walk (SAW) or polymer ring on a $ d $-dimensional lattice obeys hyperscaling. The combination $ p_N \left\langle R^2 \right\rangle^{ d/2}_N\mu^{ -N}, $ (where $ p_N $ is the number of…
We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the…
We introduce a mean-field model of lattice trees based on embeddings into $\Z^d$ of abstract trees having a critical Poisson offspring distribution. This model provides a combinatorial interpretation for the self-consistent mean-field model…
We prove that the susceptibility of the continuous-time weakly self-avoiding walk on $\mathbb{Z}^d$, in the critical dimension $d=4$, has a logarithmic correction to mean-field scaling behaviour as the critical point is approached, with…
Fixed representational capacity is a fundamental constraint in continual learning: practitioners must guess an appropriate model width before training, without knowing how many distinct concepts the data contains. We propose LACE…
Characterizing the cellular properties of neurons is fundamental to understanding their function in the brain. In this quest, the generation of bio-realistic models is central towards integrating multimodal cellular data sets and…
Current large language models reason in isolation. Although it is common to sample multiple reasoning paths in parallel, these trajectories do not interact, and often fail in the same redundant ways. We introduce LACE, a framework that…
Highly nonlinear behavior of a system of discrete sites on a lattice is observed when a specific feedback loop is introduced into models employing coupled map lattices, quantum cellular automata, or the real-valued analogues of the latter.…
Density estimates based on point processes are often restrained to regions with irregular boundaries or holes. We propose a density estimator, the lattice-based density estimator, which produces reasonable density estimates under these…
The lace expansion has been a powerful tool for investigating mean-field behavior for various stochastic-geometrical models, such as self-avoiding walk and percolation, above their respective upper-critical dimension. In this paper, we…
We study numerically Anderson localization on lattices that are tree-like except for the presence of one loop of varying length $L$. The resulting expressions allow us to compute corrections to the Bethe lattice solution on i)…
Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…
We consider various two-dimensional lattices such as square, Kagome, Lieb, honeycomb, dice lattices of finite extent, to study the effect of lattice profile in terms of the number of nearest neighbour and connectivity patterns on the…
We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…
We present high statistics simulations of weighted lattice bond animals and lattice trees on the square lattice, with fugacities for each non-bonded contact and for each bond between two neighbouring monomers. The simulations are performed…
This survey article is concerned with the application of lattice rules to Deep Neural Networks (DNNs), lattice rules being a family of quasi-Monte Carlo methods. They have demonstrated effectiveness in various contexts for high-dimensional…
We use a discrete worldline representation in order to study the continuum limit of the one-loop expectation value of dimension two and four local operators in a background field. We illustrate this technique in the case of a scalar field…