Related papers: Weak-disorder limit at criticality for directed po…
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. We assume that probability of an excursion of…
We provide a new short and elementary proof of diffusivity for directed polymer in a random environment in the weak disorder phase.
We show that the perturbative expansion of the two-level correlation function, $R(\omega)$, in disordered conductors can be understood semiclassically in terms of self-intersecting particle trajectories. This requires the extension of the…
We develop an asymptotic theory for extremes in decomposable graphical models by presenting results applicable to a range of extremal dependence types. Specifically, we investigate the weak limit of the distribution of suitably normalised…
We prove limit theorems for systems of interacting diffusions on sparse graphs. For example, we deduce a hydrodynamic limit and the propagation of chaos property for the stochastic Kuramoto model with interactions determined by…
We give general conditions for the central limit theorem and weak convergence to Brownian motion (the weak invariance principle / functional central limit theorem) to hold for observables of compact group extensions of nonuniformly…
The splitting-off operation in undirected graphs is a fundamental reduction operation that detaches all edges incident to a given vertex and adds new edges between the neighbors of that vertex while preserving their degrees. Lov\'asz (1974)…
In two dimensions chaotic level-statistics is expected for massless Dirac fermions in the presence of disorder. For weakly disordered graphene flakes with zigzag edges the obtained level-spacing distribution in the Dirac region is neither…
We present a perturbative approach to disordered systems in one spatial dimension that accesses the full range of phase disorder and clarifies the connection between localization and phase information. We consider a long chain of…
It is shown that the Wegner model of disorder contains a system of constraints which is important whenever the disorder is not weak and which is responsible for localization in D > 2 dimensions. When the disorder is strong the constraints…
We present a new approach, based on graphon theory, to finding the limiting spectral distributions of general Wigner-type matrices. This approach determines the moments of the limiting measures and the equations of their Stieltjes…
The directed polymer in a 1+3 dimensional random medium is known to present a disorder-induced phase transition. For a polymer of length $L$, the high temperature phase is characterized by a diffusive behavior for the end-point displacement…
Polymers in a melt may be subject to topological constraints, as in the example of unlinked polymer rings. How to do statistical mechanics in the presence of such constraints remains a fundamental open problem. We study the effect of…
We prove a sequence of limiting results about weakly dependent stationary and regularly varying stochastic processes in discrete time. After deducing the limiting distribution for individual clusters of extremes, we present a new type of…
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 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…
Benjamini and Schramm introduced the notion of distributional limit of a sequence of graphs with uniformly bounded valence and studied such limits in the case that the involved graphs are planar. We investigate distributional limits of…
A simple model of cyclically competing species on a directed graph with quenched disorder is proposed as an extension of the rock-paper-scissors model. By assuming that the effects of loops in a directed random graph can be ignored in the…
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…
Many of the tools developed for the theory of tree-decompositions of graphs do not work for directed graphs. In this paper we show that some of the most basic tools do work in the case where the model digraph is a directed path. Using these…