Related papers: Field Theories for Loop-Erased Random Walks
We construct an application, which takes as input a simple path and a possibly infinite collection of loops, and outputs a continuous path by adding the loops chronologically to the simple path as the simple path encounters them. By…
The self-avoiding random walk (SARW) is a stochastic process whose state variable avoids returning to previously visited states. This non-Markovian feature has turned SARWs a powerful tool for modelling a plethora of relevant aspects in…
We map self-avoiding random walks with a chemical potential for writhe to the three-dimensional complex O(N) Chern-Simons theory as N -> 0. We argue that at the Wilson-Fisher fixed point which characterizes normal self-avoiding walks (with…
We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…
Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
The distance scale for a quantum field theory is the correlation length $\xi$, which diverges with exponent $\nu$ as the bare mass approaches a critical value. If $t=m^{2}-m_{c}^{2}$, then $\xi=m_{P}^{-1} \sim t^{-\nu}$ as $t \to 0$. The…
The determination of the Hausdorff dimension of the scaling limit of loop-erased random walk is closely related to the study of the one-point function of loop-erased random walk, i.e., the probability a loop-erased random walk passes…
We show that if the three dimensional self-avoiding walk (SAW) is conformally invariant, then one can compute the hitting densities for the SAW in a half space and in a sphere. We test these predictions by Monte Carlo simulations and find…
We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk located at the maximum distance above the…
Recently Sahoo and Sen obtained a series of remarkable results concerning sub-leading soft photon and graviton theorems in four dimensions. Even though the S- matrix is infrared divergent, they have shown that the sub-leading soft theorems…
Excited random walks (ERWs) are a self-interacting non-Markovian random walk in which the future behavior of the walk is influenced by the number of times the walk has previously visited its current site. We study the speed of the walk,…
Self-avoiding walk (SAW) represents linear polymer chain on a large scale, neglecting its chemical details and emphasizing the role of its conformational statistics. The role of the latter is important in formation of agglomerates and…
This thesis explores a central question: how does memory affect the way random walkers explore space? By analyzing various non-Markovian models, where past behavior directly influences future dynamics, we uncover new mechanisms and…
We consider the two-dimensional self-avoiding walk (SAW) in a simply connected domain that contains the origin. The SAW starts at the origin and ends somewhere on the boundary. The distribution of the endpoint along the boundary is expected…
We provide analytical solutions for two types of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on a Cayley tree with arbitrary branching number, root degree, and number of generations. For MERW, we obtain the…
The uncoupled Continuous Time Random Walk (CTRW) in one space-dimension and under power law regime is splitted into three distinct random walks: (rw_1), a random walk along the line of natural time, happening in operational time; (rw_2), a…
Two closely related models of oriented self-avoiding walks (OSAWs) on a square lattice are studied. We use the pruned-enriched Rosenbluth method to determine numerically the phase diagram. Both models have three phases: a tight-spiral phase…
Self-avoiding walks (SAW) are the source of very difficult problems in probabilities and enumerative combinatorics. They are also of great interest as they are, for instance, the basis of protein structure prediction in bioinformatics.…
We consider 2-state quantum walks (QWs) on the line, which are defined by two matrices. One of the matrices operates the walk at only half-time. In the usual QWs, localization does not occur at all. However, our walk can be localized around…