English
Related papers

Related papers: Replica Bounds by Combinatorial Interpolation for …

200 papers

In this paper we generalize to the case of diluted spin models and random combinatorial optimization problems a technique recently introduced by Guerra (cond-mat/0205123) to prove that the replica method generates variational bounds for…

Disordered Systems and Neural Networks · Physics 2011-02-08 Silvio Franz , Michele Leone

In this paper we extend replica bounds and free energy subadditivity arguments to diluted spin-glass models on graphs with arbitrary, non-Poissonian degree distribution. The new difficulties specific of this case are overcome introducing an…

Disordered Systems and Neural Networks · Physics 2009-11-10 Silvio Franz , Michele Leone , Fabio Lucio Toninelli

We establish the existence of free energy limits for several combinatorial models on Erd\"{o}s-R\'{e}nyi graph $\mathbb {G}(N,\lfloor cN\rfloor)$ and random $r$-regular graph $\mathbb {G}(N,r)$. For a variety of models, including…

Probability · Mathematics 2013-12-17 Mohsen Bayati , David Gamarnik , Prasad Tetali

By using a simple interpolation argument, in previous work we have proven the existence of the thermodynamic limit, for mean field disordered models, including the Sherrington-Kirkpatrick model, and the Derrida p-spin model. Here we extend…

Disordered Systems and Neural Networks · Physics 2007-05-23 Francesco Guerra

We present new, exceptionally efficient proofs of Poisson--Dirichlet limit theorems for the scaled sizes of irreducible components of random elements in the classic combinatorial contexts of arbitrary assemblies, multisets, and selections,…

Probability · Mathematics 2014-01-09 Richard Arratia , Fred Kochman

In an important recent paper, \cite{FL}, S. Franz and M. Leone prove rigorous lower bounds for the free energy of the diluted $p$-spin model and the $K$-sat model at any temperature. We show that the results for these two models are…

Probability · Mathematics 2011-11-10 Dmitry Panchenko , Michel Talagrand

We study generalisations of a simple, combinatorial proof of a Chernoff bound similar to the one by Impagliazzo and Kabanets (RANDOM, 2010). In particular, we prove a randomized version of the hitting property of expander random walks and…

Discrete Mathematics · Computer Science 2015-01-16 Jan Hązła , Thomas Holenstein

We provide a general result for bounding the difference between point probabilities of integer supported distributions and the translated Poisson distribution, a convenient alternative to the discretized normal. We illustrate our theorem in…

Probability · Mathematics 2017-12-05 A. D. Barbour , Adrian Röllin , Nathan Ross

The large-time asymptotics of the density matrix solving a drift-diffusion-Poisson model for the spin-polarized electron transport in semiconductors is proved. The equations are analyzed in a bounded domain with initial and Dirichlet…

Analysis of PDEs · Mathematics 2019-08-28 Philipp Holzinger , Ansgar Jüngel

In [1] a detailed analysis was given of the large-time asymptotics of the total mass of the solution to the parabolic Anderson model on a supercritical Galton-Watson random tree with an i.i.d. random potential whose marginal distribution is…

Probability · Mathematics 2022-09-07 Frank den Hollander , Daoyi Wang

In this paper we study the bipartite version of Sherrington-Kirkpatrick model. We prove that the free energy density is given by an analogue of the Parisi formula, that contains both the usual overlap and an additional new type of overlap.…

Disordered Systems and Neural Networks · Physics 2018-12-18 Liming Pan , Simone Franchini

We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…

Probability · Mathematics 2019-02-20 Justin Salez

We study the spin glass system consisting of a Random Energy Model coupled with a random magnetic field. This system was investigated by de Oliveira Filho, da Costa and Yokoi (Phys. Rev. E 74 [2006]) who computed the free energy. In this…

Probability · Mathematics 2015-06-18 Louis-Pierre Arguin , Nicola Kistler

Neural computations arising from myriads of interactions between spiking neurons can be modeled as network dynamics with punctuate interactions. However, most relevant dynamics do not allow for computational tractability. To circumvent this…

Probability · Mathematics 2024-04-09 Michel Davydov

This paper introduces a distribution-dependent PAC-Chernoff bound that exhibits perfect tightness for interpolators, even within over-parameterized model classes. This bound, which relies on basic principles of Large Deviation Theory,…

Machine Learning · Computer Science 2025-02-11 Andrés R. Masegosa , Luis A. Ortega

We present a new method to solve the dynamics of disordered spin systems on finite time-scales. It involves a closed driven diffusion equation for the joint spin-field distribution, with time-dependent coefficients described by a dynamical…

Condensed Matter · Physics 2009-10-28 A. C. C. Coolen , S. N. Laughton , D. Sherrington

This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…

Information Theory · Computer Science 2021-06-15 Igal Sason

We compute the probability of positive large deviations of the free energy per spin in mean-field Spin-Glass models. The probability vanishes in the thermodynamic limit as $P(\Delta f) \propto \exp[-N^2 L_2(\Delta f)]$. For the…

Disordered Systems and Neural Networks · Physics 2012-10-31 Giorgio Parisi , Tommaso Rizzo

We consider a renewal process \tau={\tau_0,\tau_1,...} on the integers, where the law of \tau_i-\tau_{i-1} has a power-like tail P(\tau_i-\tau_{i-1}=n)=n^{-(\alpha+1)}L(n) with \alpha\ge0 and L(.) slowly varying. We then assign a random,…

Mathematical Physics · Physics 2008-04-28 Fabio Lucio Toninelli

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…

Combinatorics · Mathematics 2017-12-29 Mikhail Isaev , Brendan D. McKay
‹ Prev 1 2 3 10 Next ›