English
Related papers

Related papers: Large deviations for the 3D dimer model

200 papers

We establish the optimal convergence rate to the hypersonic similarity law, which is also called the Mach number independence principle, for steady compressible full Euler flows over two-dimensional slender Lipschitz wedges. The problem can…

Analysis of PDEs · Mathematics 2024-07-01 Gui-Qiang G. Chen , Jie Kuang , Wei Xiang , Yongqian Zhang

Steady fluid flows have very special topology. In this paper we describe necessary and sufficient conditions on the vorticity function of a 2D ideal flow on a surface with or without boundary, for which there exists a steady flow among…

Symplectic Geometry · Mathematics 2015-11-19 Anton Izosimov , Boris Khesin

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

K-Theory and Homology · Mathematics 2014-04-28 Rufus Willett

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

Combinatorics · Mathematics 2024-12-11 Pu Gao , Yuval Ohapkin

This Letter introduces a generalization of known duplication-divergence models for growing random graphs. This general duplication-divergence model includes a new coupled divergence asymmetry rate, which allows to obtain the structure of…

Statistical Mechanics · Physics 2024-12-04 Dario Borrelli

A 2016 paper by M Wilkinson in Physical Review Letters suggests that large-deviation theory is a suitable framework for studying unexpectedly rapid rain formation in collector-drop collision processes. Wilkinson derives asymptotic…

Statistical Mechanics · Physics 2022-09-29 Christian P. H. Salas

We consider a dynamic Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices in which each edge switches on at rate $\lambda$ and switches off at rate $\mu$, independently of other edges. The focus is on the analysis of the evolution of the…

Probability · Mathematics 2020-09-29 Peter Braunsteins , Frank den Hollander , Michel Mandjes

We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…

Combinatorics · Mathematics 2011-11-09 Noga Alon , Ankur Moitra , Benny Sudakov

We study maximum-entropy inference for finite-dimensional quantum states under linear moment constraints. Given expectation values of finitely many observables, the feasible set of states is convex but typically non-unique. The…

Quantum Physics · Physics 2025-10-27 James Tian

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

Probability · Mathematics 2016-04-08 Charles Bordenave , Pietro Caputo

We construct and analyze approximation rates of deep operator networks (ONets) between infinite-dimensional spaces that emulate with an exponential rate of convergence the coefficient-to-solution map of elliptic second-order partial…

Numerical Analysis · Mathematics 2023-11-27 Carlo Marcati , Christoph Schwab

We study matchings on sparse random graphs by means of the cavity method. We first show how the method reproduces several known results about maximum and perfect matchings in regular and Erdos-Renyi random graphs. Our main new result is the…

Disordered Systems and Neural Networks · Physics 2011-11-09 Lenka Zdeborová , Marc Mézard

We investigate the consensus dynamics of the voter model on large random graphs with heterogeneous and directed features, focusing in particular on networks with power-law degree distributions. By extending recent results on sparse directed…

Probability · Mathematics 2025-06-19 Luca Avena , Federico Capannoli , Diego Garlaschelli , Rajat Subhra Hazra

In this work we consider the \emph{infinite color urn model} associated with a bounded increment random walk on $\Zbold^d$. This model was first introduced by Bandyopadhyay and Thacker (2013). We prove that the rate of convergence of the…

Probability · Mathematics 2013-10-23 Antar Bandyopadhyay , Debleena Thacker

In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\H{o}s on estimating the maximum number of edges…

Combinatorics · Mathematics 2012-02-01 Noga Alon , Peter Frankl , Hao Huang , Vojtech Rodl , Andrzej Rucinski , Benny Sudakov

This paper establishes a precise high-dimensional asymptotic theory for boosting on separable data, taking statistical and computational perspectives. We consider a high-dimensional setting where the number of features (weak learners) $p$…

Statistics Theory · Mathematics 2022-11-21 Tengyuan Liang , Pragya Sur

We carry out the asymptotic analysis of repulsive ensembles of N particles which are discrete analogues of continuous 1d log-gases or beta-ensembles of random matrix theory. The ensembles that we study have several groups of particles which…

Probability · Mathematics 2026-03-03 Gaëtan Borot , Vadim Gorin , Alice Guionnet

We present results about large deviations and laws of large numbers for various polymer related quantities. In a completely general setting and strictly positive temperature, we present results about large deviations for directed polymers…

Probability · Mathematics 2012-10-03 Nicos Georgiou

Differential entropy and log determinant of the covariance matrix of a multivariate Gaussian distribution have many applications in coding, communications, signal processing and statistical inference. In this paper we consider in the high…

Statistics Theory · Mathematics 2015-03-10 T. Tony Cai , Tengyuan Liang , Harrison H. Zhou

We consider the problem of estimating the graph size, where one is given only local access to the graph. We formally define a query model in which one starts with a \emph{seed} node and is allowed to make queries about neighbours of nodes…

Data Structures and Algorithms · Computer Science 2017-02-15 Varun Kanade , Frederik Mallmann-Trenn , Victor Verdugo
‹ Prev 1 4 5 6 7 8 10 Next ›