English
Related papers

Related papers: Weak-disorder limit at criticality for directed po…

200 papers

We give a lower bound on the diffusion coefficient of a polymer chain in an entanglement network with kinematic disorder, which is obtained from an exact calculation in a modified Rubinstein-Duke lattice gas model with periodic boundary…

Soft Condensed Matter · Physics 2009-11-07 Richard D. Willmann

Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…

Combinatorics · Mathematics 2015-03-09 Peter Diao , Dominique Guillot , Apoorva Khare , Bala Rajaratnam

We prove to all orders of renormalized perturbative polymer field theory the existence of a short chain expansion applying to polymer solutions of long and short chains. For a general polymer network with long and short chains we show…

Condensed Matter · Physics 2016-08-31 Christian von Ferber

Similarity metrics are central in the theory of large networks and graph limits. For bounded-degree graphs, the Benjamini--Schramm metric records the distribution of rooted neighbourhoods, while the stronger colored-neighbourhood metric…

Combinatorics · Mathematics 2026-05-15 Balazs Szegedy

Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…

Combinatorics · Mathematics 2021-04-08 Zdeněk Dvořák , Jakub Pekárek , Torsten Ueckerdt , Yelena Yuditsky

We investigate the disordered copolymer and pinning models, in the case of a correlated Gaussian environment with summable correlations, and when the return distribution of the underlying renewal process has a polynomial tail. As far as the…

Probability · Mathematics 2014-04-24 Quentin Berger , Julien Poisat

We show an $\Omega\big(\Delta^{\frac{1}{3}-\frac{\eta}{3}}\big)$ lower bound on the runtime of any deterministic distributed $\mathcal{O}\big(\Delta^{1+\eta}\big)$-graph coloring algorithm in a weak variant of the \LOCAL\ model. In…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-09-15 Dan Hefetz , Fabian Kuhn , Yannic Maus , Angelika Steger

We study the hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to $\lambda^{|I|}$, for a positive real parameter $\lambda$. For large $\lambda$, computing the partition…

Probability · Mathematics 2011-08-15 Ricardo Restrepo , Jinwoo Shin , Prasad Tetali , Eric Vigoda , Linji Yang

Using a numerical implementation of strong disorder renormalization group, we study the low-energy, long-distance properties of layers and bilayers of $S = 1/2$ Heisenberg antiferromagnets with different type of disorder: bond randomness,…

Disordered Systems and Neural Networks · Physics 2007-05-23 Yu-Cheng Lin , Heiko Rieger , Nicolas Laflorencie , Ferenc Igloi

We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…

Probability · Mathematics 2021-08-02 Guillaume Conchon--Kerjan , Christina Goldschmidt

We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension $D$ to increase with the…

Statistics Theory · Mathematics 2013-09-27 Larry Wasserman , Mladen Kolar , Alessandro Rinaldo

For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…

Probability · Mathematics 2020-07-09 Christina Goldschmidt , Bénédicte Haas , Delphin Sénizergues

In this paper we study decay of correlations and limit theorems for generalized baker's transformations. Our examples are piecewise non-uniformly hyperbolic maps on the unit square that posses two spatially separated lines of indifferent…

Dynamical Systems · Mathematics 2018-02-07 Seth W. Chart

We study the partition functions associated with non-intersecting polymers in a random environment. By considering paths in series and in parallel, the partition functions carry natural notions of subadditivity, allowing the effective study…

Probability · Mathematics 2021-03-30 Samuel G. G. Johnston , Neil O'Connell

We describe the asymptotic behaviour of large degrees in random hyperbolic graphs, for all values of the curvature parameter $ \alpha$. We prove that, with high probability, the node degrees satisfy the following ordering property: the…

Probability · Mathematics 2025-03-27 Loïc Gassmann

We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…

Probability · Mathematics 2017-02-06 Omer Angel , Remco van der Hofstad , Cecilia Holmgren

For a Brownian directed polymer in a Gaussian random environment, with $q(t,\cdot)$ denoting the quenched endpoint density and \[ Q_n(t,x_1,\ldots,x_n)=\mathbf{E}[q(t,x_1)\ldots q(t,x_n)], \] we derive a hierarchical PDE system satisfied by…

Probability · Mathematics 2021-10-27 Yu Gu , Christopher Henderson

We study electron transport properties of a monoatomic graphite layer (graphene) with different types of disorder at half filling. We show that the transport properties of the system depend strongly on the symmetry of disorder. We find that…

Mesoscale and Nanoscale Physics · Physics 2007-10-04 P. M. Ostrovsky , I. V. Gornyi , A. D. Mirlin

The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions. Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are…

Combinatorics · Mathematics 2013-11-06 Alexander Engström , Patrik Norén

Let $\{D_M\}_{M\geq 0}$ be the $n$-vertex random directed graph process, where $D_0$ is the empty directed graph on $n$ vertices, and subsequent directed graphs in the sequence are obtained by the addition of a new directed edge uniformly…

Combinatorics · Mathematics 2020-11-18 Richard Montgomery