Related papers: On the finite size corrections to some random matc…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
This paper analyzes the performance of sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. Precise bounds on the number of samples required to yield an accurate estimate are derived.…
We focus on belief propagation for the assignment problem, also known as the maximum weight bipartite matching problem. We provide a constructive proof that the well-known upper bound on the number of iterations (Bayati, Shah, Sharma 2008)…
A multilevel adaptive refinement strategy for solving linear elliptic partial differential equations with random data is recalled in this work. The strategy extends the a posteriori error estimation framework introduced by Guignard and…
Linear matroid intersection is an important problem in combinatorial optimization. Given two linear matroids over the same ground set, the linear matroid intersection problem asks you to find a common independent set of maximum size. The…
We study the problem of reconstructing a perfect matching $M^*$ hidden in a randomly weighted $n\times n$ bipartite graph. The edge set includes every node pair in $M^*$ and each of the $n(n-1)$ node pairs not in $M^*$ independently with…
We study the classical, randomized Ranking algorithm which is known to be $(1 - \frac{1}{e})$-competitive in expectation for the Online Bipartite Matching Problem. We give a tail inequality bound, namely that Ranking is $(1 - \frac{1}{e} -…
In their seminal paper, Karp, Vazirani and Vazirani (STOC'90) introduce the online bipartite matching problem, and the RANKING algorithm, which admits a tight $1-\frac{1}{e}$ competitive ratio. Since its publication, the problem has…
In this paper we study progressive filtration expansions with random times. We show how semimartingale decompositions in the expanded filtration can be obtained using a natural link between progressive and initial expansions. The link is,…
In 2019, Perondi and Carmelo determined the set multipartite Ramsey number of particular complete bipartite graphs by establishing a relationship between the set multipartite Ramsey number, Hadamard matrices, and strongly regular graphs,…
We present a new and efficient method for deriving finite-size effects in statistical physics models solvable by Bethe Ansatz. It is based on the study of the functional that maps a function to the sum of its evaluations over the Bethe…
We study the edge-weighted online stochastic matching problem. Since Feldman, Mehta, Mirrokni, and Muthukrishnan proposed the $(1-\frac1e)$-competitive Suggested Matching algorithm, there has been no improvement for the general…
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 a weighted online bipartite matching problem: $G(V_1, V_2, E)$ is a weighted bipartite graph where $V_1$ is known beforehand and the vertices of $V_2$ arrive online. The goal is to match vertices of $V_2$ as they arrive to vertices…
Online bipartite matching has been extensively studied. In the unweighted setting, Karp et al. gave an optimal $(1 - 1/e)$-competitive randomized algorithm. In the weighted setting, optimal algorithms have been achieved only under…
We show that the amplitude of the finite size correction term for the $n$th moment of the partition function, for randomly interacting directed polymers, diverges (on the high temperature side) as $(n_c - n)^{-r}$, as a critical moment…
Online matching and its variants are some of the most fundamental problems in the online algorithms literature. In this paper, we study the online weighted bipartite matching problem. Karp et al. (STOC 1990) gave an elegant algorithm in the…
Jain's iterative rounding theorem is a well-known result in the area of approximation algorithms and, more broadly, in combinatorial optimization. The theorem asserts that LP relaxations of several problems in network design and…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
The aim of this article is to show that systems of linear partial differential equations on filtered manifolds, which are of weighted finite type, can be canonically rewritten as first order systems of a certain type. This leads immediately…