Related papers: Full-path localization of directed polymers
We consider the model of the directed polymer in a random medium of dimension 1+3, and investigate its multifractal properties at the localization/delocalization transition. In close analogy with models of the quantum Anderson localization…
We study KPZ surfaces on Euclidean lattices and directed polymers on hierarchical lattices subject to different distributions of disorder, showing that universality holds, at odds with recent results on Euclidean lattices. Moreover, we find…
We consider a polymer, with monomer locations modeled by the trajectory of a Markov chain, in the presence of a potential that interacts with the polymer when it visits a particular site 0. Disorder is introduced by, for example, having the…
We consider models of directed polymers interacting with a one-dimensional defect line on which random charges are placed. More abstractly, one starts from renewal sequence on $\Z$ and gives a random (site-dependent) reward or penalty to…
Probabilistic models of directed polymers in random environment have received considerable attention in recent years. Much of this attention has focused on integrable models. In this paper, we introduce some new computational tools that do…
A variational method that allows for replica-symmetry breaking is applied to directed polymers in an (N+1)-dimensional disordered medium. The noise studied here has gaussian correlations, i.e. it is short-ranged. In dimensions N<2, the…
We show that choosing appropriate distributions of the randomness, the search for optimal paths links diverse problems of disordered media like directed percolation, invasion percolation, directed and non-directed spanning polymers. We also…
The full distribution of the conductance $P(G)$ in quasi-one-dimensional wires with rough surfaces is analyzed from the diffusive to the localization regime. In the crossover region, where the statistics is dominated by only one or two…
We consider the $n$-dimensional random temporal hypercube, i.e., the $n$-dimensional hypercube graph with its edges endowed with i.i.d. continuous random weights. We say that a vertex $w$ is accessible from another vertex $v$ if and only if…
The first main goal of this article is to give a new metrization of the Mukherjee--Varadhan topology, recently introduced as a translation-invariant compactification of the space of probability measures on Euclidean spaces. This new…
In this paper, we study a model of directed polymers in random environment, where the environment is restricted to a time-space tube whose spatial width grows polynomially with time. It can be viewed as an interpolation between the…
We study a quenched charged-polymer model, introduced by Garel and Orland in 1988, that reproduces the folding/unfolding transition of biopolymers. We prove that, below the critical inverse temperature, the polymer is delocalized in the…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
The translocation dynamics of a polymer chain through a nanopore in the absence of an external driving force is analyzed by means of scaling arguments, fractional calculus, and computer simulations. The problem at hand is mapped on a one…
Stretched polymers with attractive interaction are studied in two and three dimensions. They are described by biased self-avoiding random walks with nearest neighbour attraction. The bias corresponds to opposite forces applied to the first…
Gibbs sampling, as a model learning method, is known to produce the most accurate results available in a variety of domains, and is a de facto standard in these domains. Yet, it is also well known that Gibbs random walks usually have…
Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…
The competition in the pinning of a directed polymer by a columnar pin and a background of random point impurities is investigated systematically using the renormalization group method. With the aid of the mapping to the noisy-Burgers'…
The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…
A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…