English
Related papers

Related papers: Scaling hypothesis for the Euclidean bipartite mat…

200 papers

Combinatorial optimization is a fertile testing ground for statistical physics methods developed in the context of disordered systems, allowing one to confront theoretical mean field predictions with actual properties of finite dimensional…

Disordered Systems and Neural Networks · Physics 2009-10-31 J. Houdayer , J. H. Boutet de Monvel , O. C. Martin

We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The method is based on fragmentation theory. The convergence is guaranteed by a coupling argument of Markov chains, whereas the value of the limit is…

Probability · Mathematics 2010-09-17 Nicolas Curien , Adrien Joseph

In this article, we consider the Euclidean dispersion problems. Let $P=\{p_{1}, p_{2}, \ldots, p_{n}\}$ be a set of $n$ points in $\mathbb{R}^2$. For each point $p \in P$ and $S \subseteq P$, we define $cost_{\gamma}(p,S)$ as the sum of…

Computational Geometry · Computer Science 2021-05-20 Pawan K. Mishra , Gautam K. Das

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…

Analysis of PDEs · Mathematics 2024-05-16 Luigi Ambrosio , Federico Vitillaro , Dario Trevisan

$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…

Computational Geometry · Computer Science 2026-02-04 Kevin Buchin , Jacobus Conradi , Sariel Har-Peled , Antonia Kalb , Abhiruk Lahiri , Lukas Plätz , Carolin Rehs , Sampson Wong

Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…

Computational Geometry · Computer Science 2019-09-27 Sándor Kisfaludi-Bak , Dániel Marx , Tom C. van der Zanden

The covariant Poisson equation for Lie algebra-valued mappings defined in 3-dimensional Euclidean space is studied using functional analytic methods. Weighted covariant Sobolev spaces are defined and used to derive sufficient conditions for…

Mathematical Physics · Physics 2007-05-23 Antti Salmela

In this work, we study the parallel complexity of the Euclidean minimum-weight perfect matching (EWPM) problem. Here our graph is the complete bipartite graph $G$ on two sets of points $A$ and $B$ in $\mathbb{R}^2$ and the weight of each…

Computational Geometry · Computer Science 2024-05-30 Sujoy Bhore , Sarfaraz Equbal , Rohit Gurjar

We show that, on a $2$-dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the $L^2$-norm by identity plus the gradient of the solution to the Poisson problem $-\Delta…

Probability · Mathematics 2019-03-29 Luigi Ambrosio , Federico Glaudo , Dario Trevisan

A set in d dimensional Euclidean space with d larger than 2 having Hausdorff dimension at least d/2 must have distance set with Hausdorff dimension strictly greater than 1/2.

Classical Analysis and ODEs · Mathematics 2007-05-23 Nets Hawk Katz

We analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we focus on the perimeter moments in the vicinity of the…

Statistical Mechanics · Physics 2008-08-28 C. Richard , I. Jensen , A. J. Guttmann

We consider a set of Euclidean optimization problems in one dimension, where the cost function associated to the couple of points $x$ and $y$ is the Euclidean distance between them to an arbitrary power $p\ge1$, and the points are chosen at…

Disordered Systems and Neural Networks · Physics 2019-10-07 Sergio Caracciolo , Andrea Di Gioacchino , Enrico M. Malatesta , Luca G. Molinari

We consider the approximation of Poisson type problems where the source is given by a singular measure and the domain is a convex polygonal or polyhedral domain. First, we prove the well-posedness of the Poisson problem when the source…

Numerical Analysis · Mathematics 2018-09-12 Irene Drelichman , Ricardo Durán , Ignacio Ojea

Starting from the five-loop renormalization-group expansions for the two-dimensional Euclidean scalar \phi^4 field theory (field-theoretical version of two-dimensional Ising model), pseudo-\epsilon expansions for the Wilson fixed point…

Statistical Mechanics · Physics 2014-11-17 A. I. Sokolov

The classical two-dimensional one-component plasma is an exactly solvable model, at some special temperature, even when the one-body potential acting on the particles has a quadrupolar term. As a supplement to a recent work of Di Francesco,…

Condensed Matter · Physics 2015-06-25 P. J. Forrester , B. Jancovici

Consider Bernoulli(1/2) percolation on $\Z^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make the…

Probability · Mathematics 2009-09-08 Adam Timar

In arXiv:1909.01269 it was shown that the scaling dimension of the lightest charge $n$ operator in the $U(1)$ model at the Wilson-Fisher fixed point in $d=4-\varepsilon$ can be computed semiclassically for arbitrary values of $\lambda n$,…

High Energy Physics - Theory · Physics 2020-01-14 Gil Badel , Gabriel Cuomo , Alexander Monin , Riccardo Rattazzi

Double-lepton polarization asymmetries in (Lambda_b -> Lambda l^+ l^-) decay are calculated in universal extra dimension (UED) model. It is obtained that numerous double-lepton polarization asymmetries are very sensitive to the UED model…

High Energy Physics - Phenomenology · Physics 2008-11-26 T. M. Aliev , M. Savci , B. B. Sirvanli

Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…

Numerical Analysis · Mathematics 2018-04-06 Sharif Rahman

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…

Optimization and Control · Mathematics 2010-11-16 Ankur Mani , Asuman Ozdaglar , Alex , Pentland