EDP Sciences logo
Authentification abonné
Rechercher
Menu

Article cité par

La fonctionnalité Article cité par… liste les citations d'un article. Ces citations proviennent de la base de données des articles de EDP Sciences, ainsi que des bases de données d'autres éditeurs participant au programme CrossRef Cited-by Linking Program. Vous pouvez définir une alerte courriel pour être prévenu de la parution d'un nouvel article citant " cet article (voir sur la page du résumé de l'article le menu à droite).

Article cité :

The planted matching problem: sharp threshold and infinite-order phase transition

Jian Ding, Yihong Wu, Jiaming Xu and Dana Yang
Probability Theory and Related Fields 187 (1-2) 1 (2023)
https://doi.org/10.1007/s00440-023-01208-6

Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities

Jose H. Blanchet, Martin I. Reiman, Virag Shah, Lawrence M. Wein and Linjia Wu
Operations Research 70 (6) 3355 (2022)
https://doi.org/10.1287/opre.2021.2186

О максимуме специального процесса назначений

Mikhail Anatolievich Lifshits and Arman Armenovich Tadevosian
Теория вероятностей и ее применения 67 (4) 802 (2022)
https://doi.org/10.4213/tvp5577

The planted matching problem: Phase transitions and exact results

Mehrdad Moharrami, Cristopher Moore and Jiaming Xu
The Annals of Applied Probability 31 (6) (2021)
https://doi.org/10.1214/20-AAP1660

Exploiting partial correlations in distributionally robust optimization

Divya Padmanabhan, Karthik Natarajan and Karthyek Murthy
Mathematical Programming 186 (1-2) 209 (2021)
https://doi.org/10.1007/s10107-019-01453-5

The Stable Marriage Problem: An interdisciplinary review from the physicist’s perspective

Enrico Maria Fenoaltea, Izat B. Baybusinov, Jianyang Zhao, Lei Zhou and Yi-Cheng Zhang
Physics Reports 917 1 (2021)
https://doi.org/10.1016/j.physrep.2021.03.001

Random-link matching problems on random regular graphs

Giorgio Parisi, Gianmarco Perrupato and Gabriele Sicuro
Journal of Statistical Mechanics: Theory and Experiment 2020 (3) 033301 (2020)
https://doi.org/10.1088/1742-5468/ab7127

Anomalous Scaling of the Optimal Cost in the One-Dimensional Random Assignment Problem

Sergio Caracciolo, Matteo D’Achille and Gabriele Sicuro
Journal of Statistical Physics 174 (4) 846 (2019)
https://doi.org/10.1007/s10955-018-2212-9

Average optimal cost for the Euclidean TSP in one dimension

Sergio Caracciolo, Andrea Di Gioacchino, Enrico M Malatesta and Carlo Vanoni
Journal of Physics A: Mathematical and Theoretical 52 (26) 264003 (2019)
https://doi.org/10.1088/1751-8121/ab1600

Quick or Cheap? Breaking Points in Dynamic Markets

Panayotis Mertikopoulos, Heinrich H. Nax and Bary Pradelski
SSRN Electronic Journal (2019)
https://doi.org/10.2139/ssrn.3511444

Instability in Stable Marriage Problem: Matching Unequally Numbered Men and Women

Gui-Yuan Shi, Yi-Xiu Kong, Bo-Lun Chen, Guang-Hui Yuan, Rui-Jie Wu and Claudio Tessone
Complexity 2018 (1) (2018)
https://doi.org/10.1155/2018/7409397

The random fractional matching problem

Carlo Lucibello, Enrico M Malatesta, Giorgio Parisi and Gabriele Sicuro
Journal of Statistical Mechanics: Theory and Experiment 2018 (5) 053301 (2018)
https://doi.org/10.1088/1742-5468/aabbc8

Finite-size corrections in the random assignment problem

Sergio Caracciolo, Matteo P. D'Achille, Enrico M. Malatesta and Gabriele Sicuro
Physical Review E 95 (5) (2017)
https://doi.org/10.1103/PhysRevE.95.052129

Loop expansion around the Bethe approximation through theM-layer construction

Ada Altieri, Maria Chiara Angelini, Carlo Lucibello, et al.
Journal of Statistical Mechanics: Theory and Experiment 2017 (11) 113303 (2017)
https://doi.org/10.1088/1742-5468/aa8c3c

Analysis of ground state in random bipartite matching

Gui-Yuan Shi, Yi-Xiu Kong, Hao Liao and Yi-Cheng Zhang
Physica A: Statistical Mechanics and its Applications 444 397 (2016)
https://doi.org/10.1016/j.physa.2015.10.005

Topology Trivialization and Large Deviations for the Minimum in the Simplest Random Optimization

Yan V. Fyodorov and Pierre Le Doussal
Journal of Statistical Physics 154 (1-2) 466 (2014)
https://doi.org/10.1007/s10955-013-0838-1

Belief propagation for optimal edge cover in the random complete graph

Mustafa Khandwawala and Rajesh Sundaresan
The Annals of Applied Probability 24 (6) (2014)
https://doi.org/10.1214/13-AAP981

Belief propagation for minimum weight many-to-one matchings in the random complete graph

Mustafa Khandwawala
Electronic Journal of Probability 19 (none) (2014)
https://doi.org/10.1214/EJP.v19-3491

Correlation function for the Grid-Poisson Euclidean matching on a line and on a circle

Elena Boniolo, Sergio Caracciolo and Andrea Sportiello
Journal of Statistical Mechanics: Theory and Experiment 2014 (11) P11023 (2014)
https://doi.org/10.1088/1742-5468/2014/11/P11023

Statistical Mechanics of a Simplified Bipartite Matching Problem: An Analytical Treatment

Matías Germán dell’Erba
Journal of Statistical Physics 146 (6) 1263 (2012)
https://doi.org/10.1007/s10955-012-0447-4

Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation

Karthik Natarajan, Chung Piaw Teo and Zhichao Zheng
Operations Research 59 (3) 713 (2011)
https://doi.org/10.1287/opre.1110.0918

Edge flows in the complete random‐lengths network

David J. Aldous and Shankar Bhamidi
Random Structures & Algorithms 37 (3) 271 (2010)
https://doi.org/10.1002/rsa.20306

Probabilistic Analysis of Market-based Algorithms for Initial Robotic Formations

Antidio Viguria and Ayanna M. Howard
The International Journal of Robotics Research 29 (9) 1154 (2010)
https://doi.org/10.1177/0278364909340333

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Prasad Chebolu, Alan Frieze, Páll Melsted and Gregory B. Sorkin
Lecture Notes in Computer Science, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 5687 434 (2009)
https://doi.org/10.1007/978-3-642-03685-9_33

On the hardness of sampling independent sets beyond the tree threshold

Elchanan Mossel, Dror Weitz and Nicholas Wormald
Probability Theory and Related Fields 143 (3-4) 401 (2009)
https://doi.org/10.1007/s00440-007-0131-9

An easy proof of the $\zeta(2)$ limit in the random assignment problem

Johan Wästlund
Electronic Communications in Probability 14 (none) (2009)
https://doi.org/10.1214/ECP.v14-1475

Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem

Justin Salez and Devavrat Shah
Mathematics of Operations Research 34 (2) 468 (2009)
https://doi.org/10.1287/moor.1090.0380

TYPICAL PROPERTIES OF LARGE RANDOM ECONOMIES WITH LINEAR ACTIVITIES

ANDREA DE MARTINO, MATTEO MARSILI and ISAAC PEREZ CASTILLO
Macroeconomic Dynamics 11 (S1) 34 (2007)
https://doi.org/10.1017/S1365100507060191

An asymptotical study of combinatorial optimization problems by means of statistical mechanics

Hansjörg Albrecher, Rainer E. Burkard and Eranda Çela
Journal of Computational and Applied Mathematics 186 (1) 148 (2006)
https://doi.org/10.1016/j.cam.2005.03.068

Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures

Chandra Nair, Balaji Prabhakar and Mayank Sharma
Random Structures & Algorithms 27 (4) 413 (2005)
https://doi.org/10.1002/rsa.20084

Percolation–like scaling exponents for minimal paths and trees in the stochastic mean field model

David J. Aldous
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 461 (2055) 825 (2005)
https://doi.org/10.1098/rspa.2004.1388

Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds

Dimitris Bertsimas, Karthik Natarajan and Chung-Piaw Teo
SIAM Journal on Optimization 15 (1) 185 (2004)
https://doi.org/10.1137/S1052623403430610

Extreme value statistics and traveling fronts: various applications

Satya N. Majumdar and P.L. Krapivsky
Physica A: Statistical Mechanics and its Applications 318 (1-2) 161 (2003)
https://doi.org/10.1016/S0378-4371(02)01422-X

Statistical mechanics methods and phase transitions in optimization problems

Olivier C. Martin, Rémi Monasson and Riccardo Zecchina
Theoretical Computer Science 265 (1-2) 3 (2001)
https://doi.org/10.1016/S0304-3975(01)00149-9

Randomization and Approximation Techniques in Computer Science

Don Coppersmith and Gregory B. Sorkin
Lecture Notes in Computer Science, Randomization and Approximation Techniques in Computer Science 1518 319 (1998)
https://doi.org/10.1007/3-540-49543-6_25

On the expected optimal value of random assignment problems: Experimental results and open questions

P. M. Pardalos and K. G. Ramakrishnan
Computational Optimization and Applications 2 (3) 261 (1993)
https://doi.org/10.1007/BF01299451

Extensive Numerical Simulations of Weighted Matchings: Total Length and Distribution of Links in the Optimal Solution

R Brunetti, W Krauth, M Mézard and G Parisi
Europhysics Letters (EPL) 14 (4) 295 (1991)
https://doi.org/10.1209/0295-5075/14/4/002

Probability and statisitics in the service of computer science: illustrations using the assignment problem

J. Michael Steele
Communications in Statistics - Theory and Methods 19 (11) 4315 (1990)
https://doi.org/10.1080/03610929008830444