Related papers: Directed polymer in random environment and last pa…
We consider directed random graphs, the prototype of which being the Barak-Erd\H{o}s graph $\vec G(\mathbb Z, p)$, and study the way that long (or heavy, if weights are present) paths grow. This is done by relating the graphs to certain…
We consider the fluctuations of the free energy of positive temperature directed polymers in thin rectangles (N,N^{\alpha}), \alpha < 3/14. For general weight distributions with finite fourth moment we prove that the distribution of these…
We consider the optimal paths in a $d$-dimensional lattice, where the bonds have isotropically correlated random weights. These paths can be interpreted as the ground state configuration of a simplified polymer model in a random potential.…
The aim of this paper is to study the law of the last passage time of a linear diffusion to a curved boundary. We start by giving a general expression for the density of such a random variable under some regularity assumptions. Following…
A model based on the aspect of the distribution of the length of conduction paths accessible for electric charge flow reproduces the universal power-law dispersive ac conductivity observed in polymer networks and, generally, in disordered…
Distribution of loops in a one-dimensional random walk (RW), or, equivalently, neutral segments in a sequence of positive and negative charges is important for understanding the low energy states of randomly charged polymers. We investigate…
We consider the low-temperature $T<T_c$ disorder-dominated phase of the directed polymer in a random potentiel in dimension 1+1 (where $T_c=\infty$) and 1+3 (where $T_c<\infty$). To characterize the localization properties of the polymer of…
We study directed last passage percolation on the first quadrant of the planar square lattice whose weights have general distributions, or equivalently, ./G/1 queues in series. The service time distributions of the servers vary randomly…
We present a procedure that determines the law of a random walk in an iid random environment as a function of a single "typical" trajectory. We indicate when the trajectory characterizes the law of the environment, and we say how this law…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
For directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times on the vertices, let $T_{n}$ denote the last passage time from $(0,0)$ to $(n,n)$. We consider asymptotic two point correlation functions of the sequence…
The dynamics of polymers in a random smooth flow is investigated in the framework of the Hookean dumbbell model. The analytical expression of the time-dependent probability density function of polymer elongation is derived explicitly for a…
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…
We consider a stochastic model of N evolving particles studied by Brunet and Derrida. This model can be seen as a directed polymer in random medium with N sites in the transverse direction. Cook and Derrida, use heuristic arguments to…
Study of the KPZ universality class has seen the emergence of universal objects over the past decade which arise as the scaling limit of the member models. One such object is the directed landscape, and it is known that exactly solvable…
Saturated random sequential adsorption packings built of two-dimensional ellipses, spherocylinders, rectangles, and dimers placed on a one-dimensional line are studied to check analytical prediction concerning packing growth kinetics [A.…
Let $\{{\bf \mathcal{Z}}_n:n\geq 1\}$ be a sequence of i.i.d. random probability measures. Independently, for each $n\geq 1$, let $(X_{n1},\ldots, X_{nn})$ be a random vector of positive random variables that add up to one. This paper…
Attempts to find a quantum-to-classical correspondence in a classically forbidden region leads to non-physical paths, involving, for example, complex time or spatial coordinates. Here, we identify genuine quasi-classical paths for tunneling…
We study the complete graph equipped with a topology induced by independent and identically distributed edge weights. The focus of our analysis is on the weight W_n and the number of edges H_n of the minimal weight path between two distinct…
We consider directed weighted graphs and define various families of path counting functions. Our main results are explicit formulas for the main term of the asymptotic growth rate of these counting functions, under some irrationality…