Related papers: On the finite size corrections to some random matc…
In this paper, we study two problems related to planar matchings in random bipartite graphs. First, we colour each edge of the complete bipartite graph $K_{n,n}$ uniformly randomly from amongst ${r}$ colours and show that if ${r}$ grows…
The surprising results of Karp, Vazirani and Vazirani and (respectively) Buchbinder et al are examples where rather simple randomizations provide provably better approximations than the corresponding deterministic counterparts for online…
We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland's Lower Matching Conjecture and Schrijver's theorem proven by Gurvits and…
Finite size effects for the Ising Model coupled to two dimensional random surfaces are studied by exploiting the exact results from the 2-matrix models. The fixed area partition function is numerically calculated with arbitrary precision by…
The odd-red bipartite perfect matching problem asks to find a perfect matching containing an odd number of red edges in a given red-blue edge-colored bipartite graph. While this problem lies in $\mathsf{P}$, its polyhedral structure remains…
We investigate size Ramsey numbers involving bipartite graphs. It is proved that, if each forbidden graph is fixed or grows with n (in a certain uniform manner), then the extremal function has a linear asymptotics. The corresponding slope…
For axiom A diffeomorphisms and equilibrium state, we prove a Large deviation result for the sequence of successive return times into a fixed open set, under some assumption on the boundary. Our result relies on and extends the work by…
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…
The exact matching problem is a constrained variant of the maximum matching problem: given a graph with each edge having a weight $0$ or $1$ and an integer $k$, the goal is to find a perfect matching of weight exactly $k$. Mulmuley,…
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd.…
For Axiom A diffeomorphisms and equilibrium states, we prove a Large deviations result for the sequence of successive return times into a fixed Borel set, under some assumption on the boundary. Our result relies on and extends the work by…
The growing amount of applications that generate vast amount of data in short time scales render the problem of partial monitoring, coupled with prediction, a rather fundamental one. We study the aforementioned canonical problem under the…
We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an…
Within the context of stochastic probing with commitment, we consider the online stochastic matching problem; that is, the one sided online bipartite matching problem where edges adjacent to an online node must be probed to determine if…
We compute higher order finite size corrections to the energies of the circular rotating string on AdS_5 x S^5, of its orbifolded generalization on AdS_5 x S^5/Z_M and of the winding state which is obtained as the limit of the orbifolded…
We calculate for the first time the finite size corrections in the massive Thirring model. This is done by numerically solving the equations of periodic boundary conditions of the Bethe ansatz solution. It is found that the corresponding…
We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…
Finite sample size corrections to the reparametrization-invariant solution of the inverse problem of probability are computed, and shown to converge uniformly to the correct distribution.
Existence of a perfect matching in a random bipartite digraph with bipartition $(V_1, V_2)$, $|V_i|=n$, is studied. The graph is generated in two rounds of random selections of a potential matching partner such that the average number of…
Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…