Related papers: Weak-disorder limit at criticality for directed po…
We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the…
We introduce a perturbation expansion for athermal systems that allows an exact determination of displacement fields away from the crystalline state as a response to disorder. We show that the displacement fields in energy minimized…
For the quantum Ising model with ferromagnetic random couplings $J_{i,j}>0$ and random transverse fields $h_i>0$ at zero temperature in finite dimensions $d>1$, we consider the lowest-order contributions in perturbation theory in…
For a much-studied model of random copolymer at a selective interface we prove that the slope of the critical curve in the weak-disorder limit is strictly smaller than 1, which is the value given by the annealed inequality. The proof is…
We study the $1+1$-dimensional random directed polymer problem, i.e., an elastic string $\phi(x)$ subject to a Gaussian random potential $V(\phi,x)$ and confined within a plane. We mainly concentrate on the short-scale and…
We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…
The postulate of the existence of a jamming phase diagram (Liu and Nagel, Nature 396, 21 EP (1998aa)) provides a theoretical basis for the classification of a wide range of amorphous solids (colloidal, molecular and emulsion glasses,…
We consider the model of a directed polymer in a random environment defined on the infinite cluster of supercritical Bernoulli bond percolation in dimensions $d \geq 3$. For this model, it was proved in arXiv:2205.06206 that for almost…
We consider dynamical graphs, namely graphs that evolve over time, and investigate a notion of local weak convergence that extends naturally the usual Benjamini-Schramm local weak convergence for static graphs. One of the well-known results…
In the recent past, there has been a concerted effort to develop mathematical models for real-world networks and to analyze various dynamics on these models. One particular problem of significant importance is to understand the effect of…
We give an explicit construction of the weak local limit of a class of preferential attachment graphs. This limit contains all local information and allows several computations that are otherwise hard, for example, joint degree…
A partition of a (hyper)graph is $\varepsilon$-homogenous if the edge densities between almost all clusters are either at most $\varepsilon$ or at least $1-\varepsilon$. Suppose a $3$-graph has the property that the link of every vertex has…
We give algorithms for approximating the partition function of the ferromagnetic $q$-color Potts model on graphs of maximum degree $d$. Our primary contribution is a fully polynomial-time approximation scheme for $d$-regular graphs with an…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We seek the possibility of a disorder driven transition in a tight-binding lattice with a flat band using complexity parameter approach. Our results indicate the existence of a localized to extended states transition with increasing…
We prove universality of Tracy-Widom GUE fluctuations for directed polymers in $1+1$ dimensions in the intermediate disorder regime. Building on the Lindeberg replacement method of arXiv:2304.04871, we refine estimates for the measure of…
We study infinite graph-directed iterated function systems (GIFS) whose underlying graph is not strongly connected and has countably many vertices and edges. In addition to a summability condition for the physical potential, we provide…
We extend the study of the occupancy fraction of the hard-core model in two novel directions. One direction gives a tight lower bound in terms of individual vertex degrees, extending work of Sah, Sawhney, Stoner and Zhao which bounds the…
The Wasserstein distance is a metric on a space of probability measures that has seen a surge of applications in statistics, machine learning, and applied mathematics. However, statistical aspects of Wasserstein distances are bottlenecked…
Hoang, Levit, Mandrescu and Pham asked for structural conditions ensuring that the independence polynomial of a $\W_p$ graph is log-concave, or at least unimodal, and conjectured that a connected $\W_2$ graph is $2$-quasi-regularizable if…