Coherence analysis plays a vital role in the study of functional brain connectivity. However, coherence captures only linear spectral associations, and thus can produce misleading findings when ignoring variations of ...
详细信息
Until now multiscale quantum problems have appeared to be out of reach at the many-body level relevant to strongly correlated materials and current quantum information devices. In fact, they can be modeled with q-th o...
详细信息
The length of the minimal spanning tree on the complete graph on n vertices with edge weights determined by independent non-negative random variables with distribution F is proved to converge in probability to zeta (3...
详细信息
The length of the minimal spanning tree on the complete graph on n vertices with edge weights determined by independent non-negative random variables with distribution F is proved to converge in probability to zeta (3)/F prime (0), provided only that F have a non-zero derivative at the origin. In particular, no other smoothness or moment conditions are placed on F. This augments the result of A. M. Frieze for random variables with finite variances and differentiable distribution.
作者：
STEELE, JMPrinceton University
Program in Statistics and Operations Research School of Engineering and Applied Science Princeton NJ 08544 USA
A bound is given for the cost of the spanning tree produced by the sequential minimal insertion procedure as applied to n points in the unit d -cube. The technique developed is reasonably general and can be applied to...
详细信息
A bound is given for the cost of the spanning tree produced by the sequential minimal insertion procedure as applied to n points in the unit d -cube. The technique developed is reasonably general and can be applied to several other problems of computational geometry, including the nearest neighbour heuristic for the traveling salesman problem. Attention is also given to bounding the sum of the powers of the edge lengths of sequentially constructed trees and paths. Examples illustrate that the bounds obtained are of best possible order as a function of the number of points.
This note sharpens and generalizes an inequality of Platzman and Bartholdi on the ratio of the cost of the path provided by the spacefilling heuristic to the cost of the optimal path through n points in R d .
This note sharpens and generalizes an inequality of Platzman and Bartholdi on the ratio of the cost of the path provided by the spacefilling heuristic to the cost of the optimal path through n points in R d .
A new method for obtaining an initial feasible interior-point solution to a linear program is presented. This method avoids the use of a "big-M", and is shown to work well on a standard set of test problems....
详细信息
A new method for obtaining an initial feasible interior-point solution to a linear program is presented. This method avoids the use of a "big-M", and is shown to work well on a standard set of test problems. Conditions are developed for obtaining a near-optimal solution that is feasible for an associated problem, and details of the computational testing are presented. Other issues related to obtaining and maintaining accurate feasible solutions to linear programs with an interior-point method are discussed. These issues are important to consider when solving problems that have no primal or dual interior-point feasible solutions.
Version 5.1 of MINOS was used to analyze a set of linear programming test problems, which were run with different sets of options for scaling and partial pricing to illustrate the effects of these options on the perfo...
详细信息
Version 5.1 of MINOS was used to analyze a set of linear programming test problems, which were run with different sets of options for scaling and partial pricing to illustrate the effects of these options on the performance of the simplex method. Testing was performed on a DEC VAXstation II with 13 megabytes of main memory. The solution time was measured by timing the MINOS subroutine M5SOLV. The results demonstrate that the different options can significantly improve or degrade the performance of the simplex method. Scaling and partial pricing can improve the performance of the simplex method in most cases. However, options must be carefully chosen - a difficult task - in order not to degrade the performance of the simplex method.
The problem of estimating the transition probabilities for the Markov chain associated to a Markov renewal process is considered. The estimators are to be based on censored observations of the Markov renewal process. ...
详细信息
The problem of estimating the transition probabilities for the Markov chain associated to a Markov renewal process is considered. The estimators are to be based on censored observations of the Markov renewal process. For a class of Markov renewal processes whose transition distributions factor, nonparametric estimators are defined. They are shown to be consistent and to converge weakly go Gaussian random variables. The result builds upon those in Gill (1980) for nonparametric estimation in this setting.
In this review, we present an overview of numerical methods to solve the binary Allen–Cahn (AC) equation, which is extensively used to model phase separation processes in materials science. It describes the time-depe...
详细信息
暂无评论