相关论文: A Conjecture on random bipartite matching

In this paper we present the exact solution for the average minimum energy of the random bipartite matching model with an arbitrary finite number of elements where random paired interactions are described by independent exponential…

We analyze combinatorial optimization problems over a pair of random point sets of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set,…

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…

We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We…

For the set of graphs with a given degree sequence, consisting of any number of $2's$ and $1's$, and its subset of bipartite graphs, we characterize the optimal graphs who maximize and minimize the number of $m$-matchings. We find the…

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)$…

In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which…

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…

The optimal (pure state) ensemble length of a separable state, A, is the minimum number of (pure) product states needed in convex combination to construct A. We study the set of all separable states with optimal (pure state) ensemble length…

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…

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…

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…

We investigate the average minimum cost of a bipartite matching between two samples of n independent random points uniformly distributed on a unit cube in d $\ge$ 3 dimensions, where the matching cost between two points is given by any…

We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that tells us that the expected value of…

We propose a generalized version of the bisection method where the cutting point between the two subintervals is chosen at random following an arbitrary distribution. We compute expected convergence rates with respect to any arbitrary a…

Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…

Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…

Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…

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…

The aim of this paper is to study the probability that the commutator of an arbitrarily chosen pair of elements, each from two different subrings of a finite non-commutative ring equals a given element of that ring. We obtain several…