Related papers: Compressed self-avoiding walks, bridges and polygo…
We introduce a fast implementation of the pivot algorithm for self-avoiding walks, which we use to obtain large samples of walks on the cubic lattice of up to $33 \times 10^6$ steps. Consequently the critical exponent $\nu$ for…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
We study the thermodynamics of an exactly solvable model of a self-interacting partially directed self-avoiding walk (DSAW) in two dimensions, when a force is applied on one end of the chain. The critical force for the unfolding is…
The infinite two-sided loop-erased random walk (LERW) is a measure on infinite self-avoiding walks that can be viewed as giving the law of the `middle part' of an infinite LERW loop going through 0 and infinity. In this note we derive…
We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…
We analyse the conformational behaviour of a linear semiflexible homo-polymer chain confined by two geometrical constraints under a good solvent condition in two dimensions. The constraints are stair shaped impenetrable surfaces. The…
In this paper, we investigate a model for a $1+1$ dimensional self-interacting and partially directed self-avoiding walk, usually referred to by the acronym IPDSAW. The interaction intensity and the free energy of the system are denoted by…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
Truss structures composed of members that work exclusively in tension or in compression appear in several problems of science and engineering, e.g., in the study of the resisting mechanisms of masonry structures, as well as in the design of…
The Gromov-Wasserstein (GW) problem is a variant of the classical optimal transport problem that allows one to compute meaningful transportation plans between incomparable spaces. At an intuitive level, it seeks plans that minimize the…
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate…
Many variants of Optimal Transport (OT) have been developed to address its heavy computation. Among them, notably, Sliced Wasserstein (SW) is widely used for application domains by projecting the OT problem onto one-dimensional lines, and…
We study the asymptotic behaviour of the probability that a weighted sum of centered i.i.d. random variables X_k does not exceed a constant barrier. For regular random walks, the results follow easily from classical fluctuation theory,…
Systems under external confinement and constraints often show interesting properties. In this thesis, we study some systems under external confinement. We begin by finding out the probability distribution of end-to-end separation of a Worm…
Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is limited in regular lattices by an attrition effect,…
The scaling behavior of linear polymers in disordered media modelled by self-avoiding random walks (SAWs) on the backbone of two- and three-dimensional percolation clusters at their critical concentrations p_c is studied. All possible SAW…
We prove that for the $d$-regular tessellations of the hyperbolic plane by $k$-gons, there are exponentially more self-avoiding walks of length $n$ than there are self-avoiding polygons of length $n$. We then prove that this property…
We define multiple chordal SLEs in a simply connected domain by considering a natural configurational measure on paths. We show how to construct these measures so that they are conformally covariant and satisfy certain boundary perturbation…
Motivated by novel results in the theory of complex adaptive systems, we analyze the dynamics of random walks in which the jumping probabilities are {\it time-dependent}. We determine the survival probability in the presence of an absorbing…
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their…