English
Related papers

Related papers: Random polymers on the complete graph

200 papers

In this article we study a one dimensional model for a polymer in a poor solvent: the random walk on $\mathbb{Z}$ penalized by its range. More precisely, we consider a Gibbs transformation of the law of the simple symmmetric random walk by…

Probability · Mathematics 2022-07-21 Nicolas Bouchot

We study asymptotic properties of diffusion and other transport processes (including self-avoiding walks and electrical conduction) on large randomly branched polymers using renormalized dynamical field theory. We focus on the swollen phase…

Statistical Mechanics · Physics 2015-06-04 Hans-Karl Janssen , Olaf Stenull

We study the model of Directed Polymers in Random Environment in 1+1 dimensions, where the distribution at a site has a tail which decays regularly polynomially with power \alpha, where \alpha \in (0,2). After proper scaling of temperature…

Probability · Mathematics 2010-01-08 Antonio Auffinger , Oren Louidor

In this paper, we investigate a stochastic model describing the time evolution of a polymerization process. A polymer is a macro-molecule resulting from the aggregation of several elementary sub-units called monomers. Polymers can grow by…

Probability · Mathematics 2018-08-24 Philippe Robert , Wen Sun

A solvable model of directed polymer with matrix-valued disorder is introduced in arXiv:2203.14868. The disorder is made of $d\times d$ inverse-Wishart random matrices, so that the model nicely generalizes the well-studied log-gamma…

Probability · Mathematics 2025-11-19 Guillaume Barraquand , Zikun Ouyang

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

Representation Theory · Mathematics 2015-12-22 Vadim Gorin , Greta Panova

The polymer model framework is a classical tool from statistical mechanics that has recently been used to obtain approximation algorithms for spin systems on classes of bounded-degree graphs; examples include the ferromagnetic Potts model…

Data Structures and Algorithms · Computer Science 2022-03-29 Andreas Galanis , Leslie Ann Goldberg , James Stewart

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…

Probability · Mathematics 2026-04-01 Luca Avena , Diego Garlaschelli , Rajat Subhra Hazra , Margherita Lalli

The statistics of polymers advected by a turbulent flow are investigated. To limit the polymer lengths above to coil-stretch transition, a FENE-P type relaxation law is used. The turbulence is modeled by a random strain, delta-correlated in…

Chaotic Dynamics · Physics 2009-11-07 Jean-Luc Thiffeault

We present an exactly solvable model of a Gaussian (flexible) polymer chain in a quenched random medium. This is the case when the random medium obeys very long range quadratic correlations. The model is solved in $d$ spatial dimensions…

Disordered Systems and Neural Networks · Physics 2009-10-31 Yohannes Shiferaw , Yadin Y. Goldschmidt

The universality of the directed polymer model and the analogous KPZ equation is supported by numerical simulations using non-Gaussian random probability distributions in two, three and four dimensions. It is shown that although in the…

Disordered Systems and Neural Networks · Physics 2016-08-31 Ehud Perlsman , Shlomo Havlin

The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same for different vertices. The sequence of degree bounds acts…

Combinatorics · Mathematics 2019-08-21 Ivan Kryven

A random phase property establishing a link between quasi-one-dimensional random Schroedinger operators and full random matrix theory is advocated. Briefly summarized it states that the random transfer matrices placed into a normal system…

Mathematical Physics · Physics 2010-06-04 Rudolf A Roemer , Hermann Schulz-Baldes

We study the influence of structural obstacles in a disordered environment on the size and shape characteristics of long flexible polymer macromolecules. We use the model of self-avoiding random walks on diluted regular lattices at the…

Soft Condensed Matter · Physics 2010-11-22 Viktoria Blavatska , Wolfhard Janke

Motivated by an investigation of ground state properties of randomly charged polymers, we discuss the size distribution of the largest Q-segments (segments with total charge Q) in such N-mers. Upon mapping the charge sequence to…

Condensed Matter · Physics 2009-10-28 Deniz Ertas , Yacov Kantor

We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…

Combinatorics · Mathematics 2026-03-24 Eitan Levin , Venkat Chandrasekaran

We consider polynomial transforms (polyspectra) of Berry's model -- the Euclidean Random Wave model -- and of Random Hyperspherical Harmonics. We determine the asymptotic behavior of variance for polyspectra of any order in the…

Probability · Mathematics 2023-03-17 Francesco Grotto , Leonardo Maini , Anna Paola Todino

We study the directed polymer with fixed endpoints near an absorbing wall, in the continuum and in presence of disorder, equivalent to the KPZ equation on the half space with droplet initial conditions. From a Bethe Ansatz solution of the…

Disordered Systems and Neural Networks · Physics 2015-06-11 Thomas Gueudre , Pierre Le Doussal

We consider random walk in a space-time random potential, also known as directed random polymer measures, on the planar square lattice with nearest-neighbor steps and general i.i.d. weights on the vertices. We construct covariant cocycles…

Probability · Mathematics 2020-06-01 Christopher Janjigian , Firas Rassoul-Agha

Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…

Data Structures and Algorithms · Computer Science 2024-06-05 John Larkin