相关论文: The Mezard-Parisi equation for matchings in pseudo…
We consider a class of random matching problems where the distance between two points has a probability law which, for a small distance l, goes like l^r. In the framework of the cavity method, in the limit of an infinite number of points,…
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…
We explain the exact solution of the 1+1 dimensional Kardar-Parisi-Zhang equation with sharp wedge initial conditions. Thereby it is confirmed that the continuum model belongs to the KPZ universality class, not only as regards to scaling…
It is found the exact solution of the Poisson equation for the multidimensional space with topology $M_{3+d}=\mathbb{R}^3\times T^d$. This solution describes smooth transition from the newtonian behavior $1/r_3$ for distances bigger than…
We give a new bound on the probability that the random sum $\xi_1 v_1 +...+ \xi_n v_n$ belongs to a ball of fixed radius, where the $\xi_i$ are iid Bernoulli random variables and the $v_i$ are vectors in $\R^d$. As an application, we prove…
An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal. Such an optimization problem is called a random…
We discuss the optimal matching solution for both the assignment problem and the matching problem in one dimension for a large class of convex cost functions. We consider the problem in a compact set with the topology both of the interval…
We discuss a numerical scheme to solve the continuum Kardar-Parisi-Zhang equation in generic spatial dimensions. It is based on a momentum-space discretization of the continuum equation and on a pseudo-spectral approximation of the…
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important heuristic developed by statistical physicists that has lead to…
This is the article with the same title which is scheduled to appear in the January 2022 issue of the AMS Notices, with additional references which could not be provided in the accepted version due to space constraints. The figures in this…
A methodology to analyze the properties of the first (largest) eigenvalue and its eigenvector is developed for large symmetric random sparse matrices utilizing the cavity method of statistical mechanics. Under a tree approximation, which is…
The dilation equation arises naturally when using a multiresolution analysis to construct a wavelet basis. We consider solutions in the space of signed measures, which, after normalization, can be viewed as pseudo-probability measures.…
We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable if there exist two SAT assignments differing in Nx variables. We show the existence of a sharp…
It is found the exact solution of the Poisson equation for the multidimensional space with topology $M_{3+d}=\mathbb{R}^3\times T^d$. This solution describes smooth transition from the newtonian behavior $1/r_3$ for distances bigger than…
It was shown by G. Pisier that any finite-dimensional normed space admits an $\alpha$-regular $M$-position, guaranteeing not only regular entropy estimates but moreover regular estimates on the diameters of minimal sections of its unit-ball…
We prove an explicit formula for the law in zero of the solution of a class of elliptic SPDE in $\mathbb{R}^2$. This formula is the simplest instance of dimensional reduction, discovered in the physics literature by Parisi and Sourlas…
We develop a theory of multidimensional randomization in Lebesgue spaces $L^p$ with the aid of Kahane-Khintchine-Marcus-Pisier inequalities. More precisely, we obtain a result in the spirit of Maurey-Pisier's theorem which involves random…
The multi-index matching problem (MIMP) generalizes the well known matching problem by going from pairs to d-uplets. We use the cavity method from statistical physics to analyze its properties when the costs of the d-uplets are random. At…
Using the cavity equations of \cite{mezard:parisi:zecchina:02,mezard:zecchina:02}, we derive the various threshold values for the number of clauses per variable of the random $K$-satisfiability problem, generalizing the previous results to…
We compare two different solutions of the Dirac equation in (1+1) dimensions. One solution is for a fermion in the presence of an electric potential and the other is for a fermion in the presence of a pseudoscalar potential. It is shown…