Related papers: Generalized approach to the non-backtracking lace …
The introduction of a lattice converts a singular boundary-layer problem in the continuum into a regular perturbation problem. However, the continuum limit of the discrete problem is extremely nontrivial and is not completely understood.…
A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…
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.…
Self-avoiding walks are studied on the 3-simplex fractal lattice as a model of linear polymer conformations in a dilute, non-homogeneous solution. A model is supplemented with bending energies and attractive-interaction energies between…
We use the lace expansion to give a simple proof that the critical two-point function for weakly self-avoiding walk on $\mathbb{Z}^d$ has decay $|x|^{-(d-2)}$ in dimensions $d>4$. The proof uses elementary Fourier analysis and the…
We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…
We study long-range percolation on the hierarchical lattice of order $N$, where any edge of length $k$ is present with probability $p_k=1-\exp(-\beta^{-k} \alpha)$, independently of all other edges. For fixed $\beta$, we show that the…
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 Random Latent Exploration (RLE), a simple yet effective exploration strategy in reinforcement learning (RL). On average, RLE outperforms noise-based methods, which perturb the agent's actions, and bonus-based exploration, which…
The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…
We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…
We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in…
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…
Consider the model where nodes are initially distributed as a Poisson point process with intensity $\lambda$ over $\mathbb{R}^d$ and are moving in continuous time according to independent Brownian motions. We assume that nodes are capable…
Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…
We study a detection problem in the following setting: On the one-dimensional integer lattice, at time zero, place nodes on each site independently with probability $\rho \in [0,1)$ and let them evolve as a simple symmetric exclusion…
`With persistence, a drop of water hollows out the stone' goes the ancient Greek proverb. Yet, canonical percolation models do not account for interactions between a moving tracer and its environment. Recently, we have introduced the…
We present strong evidence that a coupled-map-lattice model for spatio-temporal intermittency belongs to the universality class of directed percolation when the updating rules are asynchronous, i.e. when only one randomly chosen site is…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
Inverse Laplace transform on the lattice spacing is introduced as a computational framework of the extrapolation of the strong coupling expansion to the scaling region. We apply the transform to the two-dimensional non-linear O(N) model at…