Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Scaling hypothesis for the Euclidean bipartite matching problem  [PDF]
Sergio Caracciolo,Carlo Lucibello,Giorgio Parisi,Gabriele Sicuro
Computer Science , 2014, DOI: 10.1103/PhysRevE.90.012118
Abstract: We propose a simple yet very predictive form, based on a Poisson's equation, for the functional dependence of the cost from the density of points in the Euclidean bipartite matching problem. This leads, for quadratic costs, to the analytic prediction of the large $N$ limit of the average cost in dimension $d=1,2$ and of the subleading correction in higher dimension. A non-trivial scaling exponent, $\gamma_d=\frac{d-2}{d}$, which differs from the monopartite's one, is found for the subleading correction. We argue that the same scaling holds true for a generic cost exponent in dimension $d>2$.
Quadratic stochastic Euclidean bipartite matching problem  [PDF]
Sergio Caracciolo,Gabriele Sicuro
Physics , 2015, DOI: 10.1103/PhysRevLett.115.230601
Abstract: 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 $\Omega\subset\mathbb R^d$ with a given distribution $\rho(\mathbf x)$ on $\Omega$. In particular, we derive a general expression for the correlation function and for the average optimal cost of the optimal matching. A previous ansatz for the matching problem on the flat hypertorus is obtained as particular case.
Almost sure convergence of the minimum bipartite matching functional in Euclidean space  [PDF]
J. H. Boutet de Monvel,O. C. Martin
Mathematics , 2002,
Abstract: Let $L_N = L_{MBM}(X_1,..., X_N; Y_1,..., Y_N)$ be the minimum length of a bipartite matching between two sets of points in $\mathbf{R}^d$, where $X_1,..., X_N,...$ and $Y_1,..., Y_N,...$ are random points independently and uniformly distributed in $[0,1]^d$. We prove that for $d \ge 3$, $L_N/N^{1-1/d}$ converges with probability one to a constant $\beta_{MBM}(d)>0$ as $N\to \infty $.
Stability of the bipartite matching model  [PDF]
Ana Bu?i?,Varun Gupta,Jean Mairesse
Computer Science , 2010,
Abstract: We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan, and Weiss (Adv. Appl. Probab., 2009). Customers and servers play symmetrical roles. There is a finite set C resp. S, of customer, resp. server, classes. Time is discrete and at each time step, one customer and one server arrive in the system according to a joint probability measure on CxS, independently of the past. Also, at each time step, pairs of matched customer and server, if they exist, depart from the system. Authorized matchings are given by a fixed bipartite graph. A matching policy is chosen, which decides how to match when there are several possibilities. Customers/servers that cannot be matched are stored in a buffer. The evolution of the model can be described by a discrete time Markov chain. We study its stability under various admissible matching policies including: ML (Match the Longest), MS (Match the Shortest), FIFO (match the oldest), priorities. There exist natural necessary conditions for stability (independent of the matching policy) defining the maximal possible stability region. For some bipartite graphs, we prove that the stability region is indeed maximal for any admissible matching policy. For the ML policy, we prove that the stability region is maximal for any bipartite graph. For the MS and priority policies, we exhibit a bipartite graph with a non-maximal stability region.
A Conjecture on random bipartite matching  [PDF]
Giorgio Parisi
Physics , 1998,
Abstract: In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
Generalized Stable Matching in Bipartite Networks  [PDF]
Ankur Mani,Asuman Ozdaglar,Alex,Pentland
Mathematics , 2010,
Abstract: In this paper we study the generalized version of weighted matching in bipartite networks. Consider a weighted matching in a bipartite network in which the nodes derive value from the split of the matching edge assigned to them if they are matched. The value a node derives from the split depends both on the split as well as the partner the node is matched to. We assume that the value of a split to the node is continuous and strictly increasing in the part of the split assigned to the node. A stable weighted matching is a matching and splits on the edges in the matching such that no two adjacent nodes in the network can split the edge between them so that both of them can derive a higher value than in the matching. We extend the weighted matching problem to this general case and study the existence of a stable weighted matching. We also present an algorithm that converges to a stable weighted matching. The algorithm generalizes the Hungarian algorithm for bipartite matching. Faster algorithms can be made when there is more structure on the value functions.
On the one dimensional Euclidean matching problem: exact solutions, correlation functions and universality  [PDF]
Sergio Caracciolo,Gabriele Sicuro
Physics , 2014, DOI: 10.1103/PhysRevE.90.042112
Abstract: We discuss the equivalence relation between the Euclidean bipartite matching problem on the line and on the circumference and the Brownian bridge process on the same domains. The equivalence allows us to compute the correlation function and the optimal cost of the original combinatoric problem in the thermodynamic limit; moreover, we solve also the minimax problem on the line and on the circumference. The properties of the average cost and correlation functions are discussed.
An Analysis of the Matching Hypothesis in Networks  [PDF]
Tao Jia,Robert F. Spivey,Boleslaw Szymanski,Gyorgy Korniss
Computer Science , 2015, DOI: 10.1371/journal.pone.0129804
Abstract: The matching hypothesis in social psychology claims that people are more likely to form a committed relationship with someone equally attractive. Previous works on stochastic models of human mate choice process indicate that patterns supporting the matching hypothesis could occur even when similarity is not the primary consideration in seeking partners. Yet, most if not all of these works concentrate on fully-connected systems. Here we extend the analysis to networks. Our results indicate that the correlation of the couple's attractiveness grows monotonically with the increased average degree and decreased degree diversity of the network. This correlation is lower in sparse networks than in fully-connected systems, because in the former less attractive individuals who find partners are likely to be coupled with ones who are more attractive than them. The chance of failing to be matched decreases exponentially with both the attractiveness and the degree. The matching hypothesis may not hold when the degree-attractiveness correlation is present, which can give rise to negative attractiveness correlation. Finally, we find that the ratio between the number of matched couples and the size of the maximum matching varies non-monotonically with the average degree of the network. Our results reveal the role of network topology in the process of human mate choice and bring insights into future investigations of different matching processes in networks.
Nonlinear Bipartite Matching  [PDF]
Yael Berstein,Shmuel Onn
Mathematics , 2006,
Abstract: We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex objectives, approximative algorithms for norm minimization and maximization, and a randomized algorithm for optimizing arbitrary objectives.
Bipartite graphs with a perfect matching and digraphs  [PDF]
Zan-Bo Zhang,Dingjun Lou
Mathematics , 2010,
Abstract: In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such an equivalent relation explains the similar results on $k$-extendable bipartite graphs and $k$-strong digraphs. We also study the relation among $k$-extendable bipartite graphs, $k$-strong digraphs and combinatorial matrices. For bipartite graphs that are not 1-extendable and digraphs that are not strong, we prove that the elementary components and strong components are counterparts.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.