Related papers: Green's Function for a Hierarchical Self-Avoiding …
During the past three decades, the advantageous concept of the Green's function has been extended from linear systems to nonlinear ones. At that, there exist a rigorous and an approximate extensions. The rigorous extension introduces the…
An explicit expression is derived for the distribution function of end-to-end vectors and for the mean square end-to-end distance of a flexible chain with excluded-volume interactions. The Hamiltonian for a flexible chain with weak…
Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…
Disordered systems such as spin glasses have been used extensively as models for high-dimensional random landscapes and studied from the perspective of optimization algorithms. In a recent paper by L. Addario-Berry and the second author,…
Using the description in terms of the Hubbard operators hole and spin Green's functions of the two-dimensional t-J model are calculated in an approximation which retains the rotation symmetry of the spin susceptibility in the paramagnetic…
The purpose of this paper is to find optimal estimates for the Green function of a half-space of {\it the relativistic $\alpha$-stable process} with parameter $m$ on $\Rd$ space. This process has an infinitesimal generator of the form…
The quartet distance is a measure of similarity used to compare two unrooted phylogenetic trees on the same set of $n$ leaves, defined as the number of subsets of four leaves related by a different topology in both trees. After a series of…
We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…
A loop expansion is implemented based on the path integral quantization of the light-cone $\phi^4$ field theory in 1+1 dimensions. The effective potential as a function of the zero-mode field $\omega$ is calculated up to two loop order and…
Tip-driven growth processes underlie the development of many plants. To date, tip-driven growth processes have been modelled as an elongating path or series of segments without taking into account lateral expansion during elongation.…
The Green's function for a hole moving in an antiferromagnet is derived analytically in the long-wavelength limit. We find that the infrared divergence is eliminated in two and higher dimensions so that the quasiparticle weight is finite.…
Neural operators, which learn mappings between the function spaces, have been applied to solve boundary value problems in various ways, including learning mappings from the space of the forcing terms to the space of the solutions with the…
The motion of a small compact object in a curved background spacetime deviates from a geodesic due to the action of its own field, giving rise to a self-force. This self-force may be calculated by integrating the Green function for the wave…
A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…
We study the path behaviour of a simple random walk on the 2-dimensional comb lattice ${\mathbb C}^2$ that is obtained from ${\mathbb Z}^2$ by removing all horizontal edges off the x-axis. In particular, we prove a strong approximation…
Consider the problem of minimizing functions that are Lipschitz and strongly convex, but not necessarily differentiable. We prove that after $T$ steps of stochastic gradient descent, the error of the final iterate is $O(\log(T)/T)$ with…
We study linearly edge-reinforced random walks on $\mathbb{Z}_+$, where each edge $\{x,x+1\}$ has the initial weight $x^{\alpha} \vee 1$, and each time an edge is traversed, its weight is increased by $\Delta$. It is known that the walk is…
We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…
We study the two-point functions of a general class of random-length random walks on finite boxes in $\ZZ^d$ with $d\ge3$, and provide precise asymptotics for their behaviour. We show that the finite-box two-point function is asymptotic to…
We have studied a model of self-attracting walk proposed by Sapozhnikov using Monte Carlo method. The mean square displacement $ < R^2(t) > \sim t^{2\nu}$ and the mean number of visited sites $ < S(t) > \sim t^{k}$ are calculated for one-,…