English
Related papers

Related papers: Directed polymers on infinite graphs

200 papers

We consider $(1+1)$-dimensional directed polymers in a random potential and provide sufficient conditions guaranteeing joint localization. Joint localization means that for typical realizations of the environment, and for polymers started…

Probability · Mathematics 2022-11-14 Yuri Bakhtin , Douglas Dow

It is well known that the mean field theory of directed polymers in a random medium exhibits replica symmetry breaking with a distribution of overlaps which consists of two delta functions. Here we show that the leading finite size…

Statistical Mechanics · Physics 2016-10-12 Bernard Derrida , Peter Mottishaw

In this article, we try to give a rather complete picture of the behavior of the free energy for a model of directed polymer in a random environment, in which the polymer is a simple symmetric random walk on the lattice $\Z^d$, and the…

Probability · Mathematics 2008-02-25 David Marquez-Carreras , Carles Rovira , Samy Tindel

A directed polymer is allowed to branch, with configurations determined by global energy optimization and disorder. A finite size scaling analysis in 2D shows that, if disorder makes branching more and more favorable, a critical transition…

Statistical Mechanics · Physics 2016-08-31 Giovanni Sartoni , Attilio L. Stella

In this paper, we consider directed polymers in random environment with discrete space and time. For transverse dimension at least equal to 3, we prove that diffusivity holds for the path in the full weak disorder region, i.e., where the…

Probability · Mathematics 2007-05-23 Francis Comets , Nobuo Yoshida

Polymer chains with hard-core interaction on a two-dimensional lattice are modeled by directed random walks. Two models, one with intersecting walks (IW) and another with non-intersecting walks (NIW) are presented, solved and compared. The…

Condensed Matter · Physics 2016-08-31 G. Forgacs , K. Ziegler

We analyze the statistics of the shortest and fastest paths on the road network between randomly sampled end points. To a good approximation, these optimal paths are found to be directed in that their lengths (at large scales) are linearly…

Statistical Mechanics · Physics 2017-11-08 A. P. Solon , G. Bunin , S. Chu , M. Kardar

We study the question of how the competition between $\textit{bulk disorder}$ and a $\textit{localized microscopic defect}$ affects the macroscopic behavior of a system in the directed polymer context at the free energy level. We consider…

Probability · Mathematics 2018-04-04 Neal Madras , Gökhan Yıldırım

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

Probability · Mathematics 2023-09-01 Fabian Michel

In this paper we consider directed walks on a tree with a fixed branching ratio K at a finite temperature T. We consider the case where each site (or link) is assigned a random energy uncorrelated in time, but correlated in the transverse…

Condensed Matter · Physics 2009-10-31 Yadin Y. Goldschmidt

Let $P$ be a simple polytope with $n-d = 2$, where $d$ is the dimension and $n$ is the number of facets. The graph of such a polytope is also called a grid. It is known that the directed random walk along the edges of $P$ terminates after…

Discrete Mathematics · Computer Science 2017-05-30 Malte Milatz

We establish a second-order almost sure limit theorem for the minimal position in a one-dimensional super-critical branching random walk, and also prove a martingale convergence theorem which answers a question of Biggins and Kyprianou [9].…

Probability · Mathematics 2009-06-22 Yueyun Hu , Zhan Shi

The a.s. existence of a polymer probability in the infinite volume limit is readily obtained under general conditions of weak disorder from standard theory on multiplicative cascades or branching random walk. However, speculations in the…

Probability · Mathematics 2019-07-10 Torrey Johnson , Edward C Waymire

Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett , Philipp Hiemer

In the randomly-oriented Manhattan lattice, every line in $\mathbb{Z}^d$ is assigned a uniform random direction. We consider the directed graph whose vertex set is $\mathbb{Z}^d$ and whose edges connect nearest neighbours, but only in the…

Probability · Mathematics 2018-02-13 Sean Ledger , Bálint Tóth , Benedek Valkó

Very recently, Junk [11] showed that for directed polymers in bounded random environments, the weak disorder (uniform integrable) phase implies that the polymer martingale is bounded in $L^p$ for some $p>1$ and also in $L^q$ for some $q<0$.…

Probability · Mathematics 2022-12-13 Rodrigo Bazaes , Chiranjib Mukherjee

We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…

Probability · Mathematics 2014-04-16 Wei Su

In this article, we present an invariance principle for the paths of the directed random polymer in space dimension two in the subcritical intermediate disorder regime. More precisely, the distribution of diffusively rescaled polymer paths…

Probability · Mathematics 2025-07-21 Simon Gabriel

In this mostly numerical study, we revisit the statistical properties of the ground state of a directed polymer in a $d=1+1$ "hilly" disorder landscape, i.e. when the quenched disorder has power-law tails. When disorder is Gaussian, the…

Disordered Systems and Neural Networks · Physics 2016-12-19 Thomas Gueudré , Pierre Le Doussal , Jean-Philippe Bouchaud , Alberto Rosso

D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…

Probability · Mathematics 2018-08-29 L. Avena , F. Castell , A. Gaudilliere , C. Melot