Related papers: Random polymers on the complete graph
We consider admissible random walks on hyperbolic graphs. For a given harmonic function on such a graph, we prove that asymptotic properties of non-tangential boundedness and non-tangential convergence are almost everywhere equivalent. The…
We study the dimer model on subgraphs of the square lattice in which vertices on a prescribed part of the boundary (the free boundary) are possibly unmatched. Each such unmatched vertex is called a monomer and contributes a fixed…
We study self avoiding random walks in an environment where sites are excluded randomly, in two and three dimensions. For a single polymer chain, we study the statistics of the time averaged monomer density and show that these are well…
We show that two semi-infinite positive temperature polymers coalesce on the scale predicted by KPZ (Kardar-Parisi-Zhang) universality. The two polymer paths have the same asymptotic direction and evolve in the same environment,…
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…
We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index $\alpha\in(1,2)$. When the number $n$ of…
On a probability space $(\Omega, \mathcal F, \mathbb P)$ we consider two independent sequences $(a_k)_{k \geq 1}$ and $(b_k)_{k \geq 1}$ of i.i.d. random variables that are centered with unit variance and which admit a moment strictly…
The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…
Consider a sequence of polynomials of bounded degree evaluated in independent Gaussian, Gamma or Beta random variables. We show that, if this sequence converges in law to a nonconstant distribution, then (i) the limit distribution is…
We introduce and study the planted directed polymer, in which the path of a random walker is inferred from noisy 'images' accumulated at each timestep. Formulated as a nonlinear problem of Bayesian inference for a hidden Markov model, this…
In this paper we study the shape characteristics of a polymer chain in a good solvent using a mesoscopic level of modelling. The dissipative particle dynamics simulations are performed in the $3D$ space at a range of chain lengths $N$. The…
We present a detailed study of the static and dynamic behavior of long semiflexible polymer chains in a melt. Starting from previously obtained fully equilibrated high molecular weight polymer melts [{\it Zhang et al.} ACS Macro Lett. 3,…
The scaling behavior of the excited energy levels of the directed polymer in random media is analyzed numerically. We find that the spatial correlations of polymer energies scale as $\sim k^{-\delta}$ for small enough wavenumbers $k$ with a…
We study a single flexible chain molecule grafted to a membrane which has pores of size slightly larger than the monomer size. On both sides of the membrane there is the same solvent. When this solvent is good, i.e. when the polymer is…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…
We compute the leading asymptotics as $N\to\infty$ of the maximum of the field $Q_N(q)= \log\det|q- A_N|$, $q\in \mathbb{C}$, for any unitarily invariant Hermitian random matrix $A_N$ associated to a non-critical real-analytic potential.…
Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…
While the structure of chromatin has been studied in great detail on length scales below 30 nm, amazingly little is known about the higher-order folding motifs of chromatin in interphase. Recent experiments give evidence that the folding…
If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…