相关论文: Generalized approach to the non-backtracking lace …
In this paper, we consider nearest-neighbor oriented percolation with independent Bernoulli bond-occupation probability on the $d$-dimensional body-centered cubic (BCC) lattice $\mathbb{L}^d$ and the set of non-negative integers…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
We prove that the growth constants for nearest-neighbour lattice trees and lattice (bond) animals on the integer lattice Zd are asymptotic to 2de as the dimension goes to infinity, and that their critical one-point functions converge to e.…
Efficient exploration remains one of the longstanding problems of deep reinforcement learning. Instead of depending solely on extrinsic rewards from the environments, existing methods use intrinsic rewards to enhance exploration. However,…
Linked cluster expansions provide a useful tool both for analytical and numerical investigations of lattice field theories. The expansion parameter is the interaction strength fields at neighboured lattice sites are coupled. They result…
One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…
The linked cluster expansion has been shown to be highly efficient in calculating equilibrium and nonequilibrium properties of a variety of 1D and 2D classical and quantum lattice models. In this article, we extend the linked cluster method…
Lattice defects in crystalline materials create long-range elastic fields which can be modelled on the atomistic scale using an infinite system of discrete nonlinear force balance equations. Starting with these equations, this work…
We consider spread-out models of lattice trees and lattice animals on $\mathbb Z^d$, for $d$ above the upper critical dimension $d_{\mathrm c}=8$. We define a correlation length and prove that it diverges as $(p_c-p)^{-1/4}$ at the critical…
We expand the critical point for site percolation on the $d$-dimensional hypercubic lattice in terms of inverse powers of $2d$, and we obtain the first three terms rigorously. This is achieved using the lace expansion.
Percolation on a five-dimensional simple hypercubic (sc(5)) lattice with extended neighborhoods is investigated by means of extensive Monte Carlo simulations, using an effective single-cluster growth algorithm. The critical exponents,…
A new class of truncation schemes of delta expansion on the lattice is studied. We show that the order of expansion in delta which is introduced as the dilation parameter can be taken large enough and the result gives rise to the Borel…
We study a model of self propelled particles exhibiting run and tumble dynamics on lattice. This non-Brownian diffusion is characterised by a random walk with a finite persistence length between changes of direction, and is inspired by the…
The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…
The site percolation problem is studied on d-dimensional generalisations of the Kagome' lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q=2d. The site…
Loop-weighted walk with parameter $\lambda\geq 0$ is a non-Markovian model of random walks that is related to the loop $O(N)$ model of statistical mechanics. A walk receives weight $\lambda^{k}$ if it contains $k$ loops; whether this is a…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
The fourfold research proposal regards in particular: critical oriented percolation; random walk limit laws; neural networks with long-range connections; the ant in a labyrinth.
In Reinforcement Learning, agents learn policies by exploring and interacting with the environment. Due to the curse of dimensionality, learning policies that map high-dimensional sensory input to motor output is particularly challenging.…
Chase-escape percolation is a variation of the standard epidemic spread models. In this model, each site can be in one of three states: unoccupied, occupied by a single prey, or occupied by a single predator. Prey particles spread to…