Related papers: Exact solution of the random bipartite matching mo…
We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of $N$ points each, $N\gg 1$. The points are supposed independently randomly generated on a domain…
We solve explicitly a certain minimization problem for probability measures in one dimension involving an interaction energy that arises in the modelling of aggregation phenomena. We show that in a certain regime minimizers are absolutely…
We derive the approximate solution for the pairing Hamiltonian in the Berggren ensemble of single particle states including bound, resonance and non-resonant scattering states. We show that this solution is reliable in the limit of a weak…
The ground state energy and entropy of the dilute mean field Ising model is computed exactly by a single order parameter. An analogous exact solution is obtained in presence of a magnetic field with random locations. Results allow for a…
In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\"os-R\'enyi random graphs in a random environment. We show that the expected number of…
In this paper, we study contention resolution schemes for matchings. Given a fractional matching $x$ and a random set $R(x)$ where each edge $e$ appears independently with probability $x_e$, we want to select a matching $M \subseteq R(x)$…
We propose a family of "exactly solvable" probability distributions to approximate partition functions of two-dimensional statistical mechanics models. While these distributions lie strictly outside the mean-field framework, their free…
We investigate the random bipartite optimal matching problem on a flat torus in two-dimensions, considering general strictly convex power costs of the distance. We extend the successful ansatz first introduced by Caracciolo et al. for the…
Through a series of exact mappings we reinterpret the Bernoulli model of sequence alignment in terms of the discrete-time totally asymmetric exclusion process with backward sequential update and step function initial condition. Using…
We show that the thermodynamic limit of the ground state energy in the mixed p-spin model can be identified as a variational problem. This gives a natural generalization of the Parisi formula at zero temperature.
The matching energy is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph, which is proposed first by Gutman and Wagner [The matching energy of a graph, Discrete Appl. Math. 160 (2012) 2177--2187].…
The Parisi formula for the free energy of the Sherrington-Kirkpatrick model is completed to a closed-form generating functional. We first find an integral representation for a solution of the Parisi differential equation and represent the…
In this paper we study maximum size and minimum weight planar matchings of inhomogenous random bipartite graphs. Our motivation for this study comes from efficient usage of cross edges in relay networks for overall improvement in network…
We develop computational methods for approximating the solution of a linear multi-term matrix equation in low rank. We follow an alternating minimization framework, where the solution is represented as a product of two matrices, and…
The proposed method of the free energy calculation is based on the approximation of the energy distribution in the microcanonical ensemble by the Gaussian distribution. We hope that our approach will be effective for the systems with…
Standard maximum likelihood estimation cannot be applied to discrete energy-based models in the general case because the computation of exact model probabilities is intractable. Recent research has seen the proposal of several new…
For a random graph on n vertices where the edges appear with individual rates, we give exact formulas for the expected time at which the number of components has gone down to k and the expected length of the corresponding minimal spanning…
For one-dimensional spin and pseudospin models that allow mapping to a Markov chain, the free energy of the system at a finite temperature can be expressed in terms of bond concentrations. Minimizing the free energy function makes it…
We establish an a priori error analysis for the lowest-order Raviart-Thomas finite element discretisation of the nonlinear Gross-Pitaevskii eigenvalue problem. Optimal convergence rates are obtained for the primal and dual variables as well…
Aim of this paper is to give an extensive treatment of bipartite mean field spin systems, ordered and disordered: at first, bipartite ferromagnets are investigated, achieving an explicit expression for the free energy trough a new minimax…