相关论文: Correction to Low and Lapsley's article "Optimizat…

This contains a list of (mostly very minor) corrections to the book Introduction to Symplectic Topology, Clarendon Press, Oxford, (1995), together with rewritten versions of two lemmas and some additional comments.

In a recent volume of Mathematics Magazine (Vol. 90, No. 3, June 2017) there is an interesting article by Seth Zimmerman, titled Detecting Deficiencies: An Optimal Group Testing Algorithm. The claim in the summary is contradictory to…

The small-world property is known to have a profound effect on the navigation efficiency of complex networks [J. M. Kleinberg, Nature 406, 845 (2000)]. Accordingly, the proper addition of shortcuts to a regular substrate can lead to the…

We present a general theory of the corrections to the asymptotic behaviour of the Renyi entropies which measure the entanglement of an interval A of length L with the rest of an infinite one-dimensional system, in the case when this is…

This is a technical report, containing all the theorem proofs in the following two papers: (1) Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, and Don Towsley, "Identifiability of Link Metrics Based on End-to-end Path Measurements," in…

Existing techniques for the cost optimization of water distribution networks either employ meta-heuristics, or try to develop problem-specific optimization techniques. Instead, we exploit recent advances in generic NLP solvers and explore a…

Since Kramers' pioneering work in 1940, significant efforts have been devoted to studying Langevin equations applied to physical and chemical reactions projected onto few collective variables, with particular focus on the inference of their…

This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations…

We correct the statements of two theorems and two corollaries in our paper [On subgroup perfect codes in Cayley graphs, European J. Combin. 91 (2021) 103228]. Proofs of these theorems and three other results are given as well.

The aim of this paper is a short survey of models and methods that developed by the authors. These models and methods are used to optimize general networks with nonlinear non-convex restrictions and objectives possessing mixed…

In the article titled "Branching-Coalescing Particle Systems" published in Probability Theory and Related Fields 131(3), pages 376-414, (2005), Theorem 7 as stated there is incorrect. Indeed, we show by counterexample that the equality that…

In this note, we want to highlight and correct an error in the paper "On the nonlocal Cahn-Hilliard-Brinkman and Cahn-Hilliard-Hele-Shaw systems" [Comm. Pure Appl. Anal. 15 (2016), 299-317] written by the authors.

This paper investigates the connections between rectified flows, flow matching, and optimal transport. Flow matching is a recent approach to learning generative models by estimating velocity fields that guide transformations from a source…

Recent work has shown that machine-learned predictions can provably improve the performance of classic algorithms. In this work, we propose the first minimum-cost network flow algorithm augmented with a dual prediction. Our method is based…

In this second part of the work, we correct the flaw which was left in the proof of the main Theorem in the first part. This affects only a small part of the text in this first part and two consecutive papers. Yet, some additional arguments…

Learning to Optimize (L2O) stands at the intersection of traditional optimization and machine learning, utilizing the capabilities of machine learning to enhance conventional optimization techniques. As real-world optimization problems…

In this article, we update the reference [14] in two aspects. First, we note that in order for the control law (12) in [14] to be equivalent to the control law (3) in [14], we need to assume that the samplings for all subsystems must be…

The Annals of Applied Probability 16 (2006) 984--1033 [URL: http://projecteuclid.org/euclid.aoap/1151592257]

The purpose of this paper is two-fold: We extend the well-known relation between optimal stopping and randomized stopping of a given stochastic process to a situation where the available information flow is a filtration with no a priori…

This is a technical report, containing all the theorem proofs in paper "Node Failure Localization in Communication Networks via Network Tomography" by Liang Ma, Ting He, Ananthram Swami, Don Towsley, Kin K. Leung, and Jessica Lowe,…