Addendum to: “Hamilton-laceable bi-powers of locally finite bipartite graphs” [Discrete Math. 345 (2022) 112777]

In this addendum we give a short and easy negative answer to the two questions raised in the original article.     

A New Statistical Aspect of the Cluster Variation Method for Lattice Systems

This paper presents an alternative statistical way to derive the cluster variation method (CVM) for lattice systems. The formulation is developed for a series of different clusters, each of which is the largest overlap cluster between two clusters of the next larger type. We arrive at the CVM expression of the lattice configuration factor by deriving the number of different ways of distributing clusters of a selected type in the lattice so that they overlap each other at the largest overlap clusters in a physically correct manner. The essential assumption employed is that individual overlapping events are statistically independent of each other. This reveals a new statistical aspect of the CVM: The CVM is based on a Bethe tree of clusters of the selected type.     

Topological properties of stock market networks: The case of Brazil

This paper investigates the topological properties of the Brazilian stock market networks. We build the minimum spanning tree, which is based on the concept of ultrametricity, using the correlation matrix for a variety of stocks of different sectors. Our results suggest that stocks tend to cluster by sector. We employ a dynamic approach using complex network measures and find that the relative importance of different sectors within the network varies. The financial, energy and material sectors are the most important within the network.     

Equilibrium polymerization in a solvent: Solution on the Bethe lattice

The lattice model for equilibrium polymerization in a solvent proposed by Wheeler and Pfeuty is solved exactly on a Bethe lattice (core of a Caylay tree) with general coordination numberq. Earlier mean-field results are reobtained in the limitq, but the phase diagrams show deviations from them for finiteq. Whenq=2, our results turn into the solution of the one-dimensional problem. Although the model is solved directly, without the use of the correspondence between the equilibrium polymerization model and the diluten0 model, we verified that the latter model may also be solved on the Bethe lattice, its solution being identical to the direct solution in all parameter space. As observed in earlier studies of the puren0 vector model, the free energy is not always convex. We obtain the region of negative susceptibility for our solution and compare this result with mean field and renormalization group (-expansion) calculations.     

层次分析法与人工智能相互关系的比较研究

以解决和分析宏观、复杂决策问题为主要特点的AHP方法同以解决具体、微观问题的专家系统之间有本质的联系。本文从分析和比较二者的特点出发,将不同层次的决策知识形式化地统一表示成IF-THEN型的规则,通过引入MYCIN系统中的不精确推理,来推导出所要排序的结论。这种推理与AHP中的合成算法有类似之处,但由于AHP合成时忽略了同层元素间不可避免的相关性,因而,二者在证据对结论支持的量值上略有不同。可是,在通常情况上不会导致排出次序的变化。此外,本文中所建议的方法对于准则层元素之间如果存在“与”或“或”的关系时,用推理的方法仍可求出不同的排序结果,这无疑在实际应用中具有相当的实用价值。本文所提出的方法除了保留原AHP的特点外,还对“定性推理”所需的知识获取过程有重要意义,而且,它为利用深层知识来解释浅层知识开辟了一条途径。     

Graphs with only caterpillars as spanning trees

A connected graph G is caterpillar-pure if each spanning tree of G is a caterpillar. The caterpillar-pure graphs are fully characterized. Loosely speaking they are strings or necklaces of so-called pearls, except for a number of small exceptional cases. An upper bound for the number of edges in terms of the order is given for caterpillar-pure graphs, and those which attain the upper bound are characterized.     

On the nonexistence of finite time bubble trees in symmetric harmonic map heat flows from the disk to the 2-sphere

Let and be the unit disk and the unit sphere, and let be a radially symmetric harmonic map heat flow, whose singularities coincide with downward energy jumps. Then its finite time singularities are simple in the sense that precisely one harmonic sphere separates at a time.     

多属性决策的组合赋权法

鉴于多属性决策问题中主观赋权法和客观赋权法各有其自身固有的特点，本文依据优化理论提出一种集成方法确定属性权重，该方法既充分利用客观信息，又反映决策者的主观偏好，从而使确定的属性权重更加合理、实用．     

A Heuristic for Moment-Matching Scenario Generation

In stochastic programming models we always face the problem of how to represent the random variables. This is particularly difficult with multidimensional distributions. We present an algorithm that produces a discrete joint distribution consistent with specified values of the first four marginal moments and correlations. The joint distribution is constructed by decomposing the multivariate problem into univariate ones, and using an iterative procedure that combines simulation, Cholesky decomposition and various transformations to achieve the correct correlations without changing the marginal moments.With the algorithm, we can generate 1000 one-period scenarios for 12 random variables in 16 seconds, and for 20 random variables in 48 seconds, on a Pentium III machine.     

The non-approximability of bicriteria network design problems

Let G be an undirected graph with two edge costs (c-cost and d-cost). We want to minimize the diameter of a spanning subgraph S (under d-cost) subject to the constraint that the total cost of the edges in S (with respect to c) does not exceed a given budget. We prove that this problem is non-approximable, even in some special cases. Similar results are proved if the stretch factor or the root stretch factor is considered instead of the diameter.