English
Related papers

Related papers: Large deviations for the 3D dimer model

200 papers

We find large deviation principles for the degree distribution and the proportion of isolated vertices for the near intermediate random geometric graph models on n vertices placed uniformly in [0, 1]^d, for d in N. In the course of the…

Probability · Mathematics 2014-06-13 Kwabena Doku-Amponsah

We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large-deviation…

Probability · Mathematics 2024-07-02 Joost Jorritsma , Bert Zwart

We consider ergodic translation-invariant Gibbs measures for the dimer model (i.e. perfect matchings) on the hexagonal lattice. The complement to a dimer configuration is a fully-packed loop configuration: each vertex has degree two. This…

Probability · Mathematics 2024-12-17 Alexander Glazman , Lucas Rey

A unified formulation of the density functional theory is constructed on the foundations of entropic inference in both the classical and the quantum regimes. The theory is introduced as an application of entropic inference for inhomogeneous…

Statistical Mechanics · Physics 2021-12-20 Ahmad Yousefi

In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{4/3+o(1)}U^{1/3}$ time. This improves upon the…

Data Structures and Algorithms · Computer Science 2020-04-16 Yang P. Liu , Aaron Sidford

By an extension of the Bethe ansatz method used by Gwa and Spohn, we obtain an exact expression for the large deviation function of the time averaged current for the fully asymmetric exclusion process in a ring containing $N$ sites and $p$…

Condensed Matter · Physics 2009-10-31 B. Derrida , J. L. Lebowitz

The embedding of finite metrics in $\ell_1$ has become a fundamental tool for both combinatorial optimization and large-scale data analysis. One important application is to network flow problems in which there is close relation between…

Metric Geometry · Mathematics 2014-04-21 David Bryant , Paul F. Tupper

We study a generic class of \emph{random optimization problems} (rops) and their typical behavior. The foundational aspects of the random duality theory (RDT), associated with rops, were discussed in \cite{StojnicRegRndDlt10}, where it was…

Probability · Mathematics 2023-12-04 Mihailo Stojnic

We show that the principle of maximum entropy, a variational method appearing in statistical inference, statistical physics, and the analysis of stochastic dynamical systems, admits a geometric description from gauge theory. Using the…

Mathematical Physics · Physics 2023-01-05 Dalton A R Sakthivadivel

We consider distributed detection problems over adaptive networks, where dispersed agents learn continually from streaming data by means of local interactions. The simultaneous requirements of adaptation and cooperation are achieved by…

Multiagent Systems · Computer Science 2016-01-27 Vincenzo Matta , Paolo Braca , Stefano Marano , Ali H. Sayed

We study curve shortening flow in high codimension for arcs with free boundary meeting a fixed smooth barrier orthogonally. We prove dilation-invariant curvature and higher-derivative estimates up to the boundary using a Stahl-type…

Differential Geometry · Mathematics 2026-02-25 Huy The Nguyen , Artemis A. Vogiatzi

A large deviation principle is established for a general class of stochastic flows in the small noise limit. This result is then applied to a Bayesian formulation of an image matching problem, and an approximate maximum likelihood property…

Statistics Theory · Mathematics 2010-02-24 Amarjit Budhiraja , Paul Dupuis , Vasileios Maroulas

We consider classes of pseudo-random graphs on $n$ vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^\delta,np+Cn^\delta)$ and $(np^2- C n^\delta, np^2 +C…

Probability · Mathematics 2016-10-13 Anirban Basak , Shankar Bhamidi , Suman Chakraborty , Andrew Nobel

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

On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…

Probability · Mathematics 2026-05-06 Tomas Berggren , Alexei Borodin , Terrence George

We consider the random point processes on a measure space X defined by the Gibbs measures associated to a given sequence of N-particle Hamiltonians H^{(N)}. Inspired by the method of Messer-Spohn for proving concentration properties for the…

Mathematical Physics · Physics 2016-10-27 Robert J. Berman

We obtain a exponential large deviation upper bound for continuous observables on suspension semiflows over a non-uniformly expanding base transformation with non-flat singularities or criticalities, where the roof function defining the…

Dynamical Systems · Mathematics 2010-08-30 Vitor Araujo

We propose a geometric counterpart of the dimer model on bipartite graphs. A state of our model consists of a choice of a point for each white vertex and hyperplane for each black vertex. This data is subject to certain conditions…

Combinatorics · Mathematics 2025-12-19 Anton Izosimov , Pavlo Pylyavskyy

We consider the dimer model on the square and hexagonal lattices with doubly periodic weights. The purpose of this paper is threefold: (a) we establish a rigourous connection with the massive SLE$_2$ constructed by Makarov and Smirnov (and…

Probability · Mathematics 2024-10-21 Nathanaël Berestycki , Levi Haunschmid-Sibitz

Equip the edges of the lattice $\mathbb{Z}^2$ with i.i.d. random capacities. A law of large numbers is known for the maximal flow crossing a rectangle in $\mathbb{R}^2$ when the side lengths of the rectangle go to infinity. We prove that…

Probability · Mathematics 2009-12-21 Raphaël Rossignol , Marie Théret
‹ Prev 1 3 4 5 6 7 10 Next ›