Convergence of Mayer expansions

The tree graph bound of Battle and Federbush is extended and used to provide a simple criterion for the convergence of (iterated) Mayer expansions. As an application estimates on the radius of convergence of the Mayer expansion for the two-dimensional Yukawa gas (nonstable interaction) are obtained.     

A new combinatoric estimate for cluster expansions

We state and prove a new and previously unsuspected tree graph inequality, which is significantly stronger than the one commonly applied to cluster expansions. The older inequality controls the counting problem in the convergence proof of such an expansion, but the new inequality does more: it also exhibits extra 1/n! factors that can be applied to the cancellation of number divergences. The proof of this new combinatoric estimate is completely elementary.Supported in part by the National Science Foundation under Grant No. MCS-8301116     

An example of an infinite system with zero quantum dynamical entropy

With nary mention of a tree graph, we obtain a cluster expansion bound that includes and vastly generalizes bounds as obtained by extant tree graph inequalities. This includes applications to both two-body and many-body potential situations of the recently obtained new improved tree graph inequalities that have led to the extra 1/N! factors. We work in a formalism coupling a discrete set of boson variables, such as occurs in a lattice system in classical statistical mechanics, or in Euclidean quantum field theory. The estimates of this Letter apply to numerical factors as arising in cluster expansions, due to essentially arbitrary sequences of the basic operations: interpolation of the covariance, interpolation of the interaction, and integration by parts. This includes complicated evolutions, such as the repeated use of interpolation to decouple the same variables several times, to ensure higher connectivity for renormalization purposes, in quantum field theory.This work was supported in part by the National Science Foundation under grant no. PHY-87-01329.     

Cluster Expansion for Abstract Polymer Models. New Bounds from an Old Approach

We revisit the classical approach to cluster expansions, based on tree graphs, and establish a new convergence condition that improves those by Kotecky-Preiss and Dobrushin, as we show in some examples. The two ingredients of our approach are: (i) a careful consideration of the Penrose identity for truncated functions, and (ii) the use of iterated transformations to bound tree-graph expansions.     

Single Polygon Counting on Cayley Tree of Order 3

We showed that one form of generalized Catalan numbers is the solution to the problem of finding different connected component with finite vertices containing a fixed root for the semi-infinite Cayley tree of order 3. We give the formula for the full graph, Cayley tree of order 3 which is derived from the generalized Catalan numbers. Using ratios of Gamma functions, two upper bounds are given for problem defined on semi-infinite Cayley tree of order 3 as well as the full graph.     

The number of spanning trees of an infinite family of outerplanar,small-world and self-similar graphs

In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological and dynamic properties of the graph, such as its reliability, synchronization capability and diffusion properties. The calculation of the number of spanning trees is a demanding and difficult task, in particular for large graphs, and thus there is much interest in obtaining closed expressions for relevant infinite graph families. We have also calculated the spanning tree entropy of the graphs which we have compared with those for graphs with the same average degree.     

A new graph expansion of virial coefficients

It is well known that the virial coefficients of the pressure of thermodynamic systems can be represented in terms of graphs. The existing graph expansions are compared with a new one, the overlap graph expansion. The merits of overlap graphs in general and especially for hard disks and spheres are discussed.     

Dimensional regularization and renormalization of QED

We give an -space definition of dimensional regularization suited to the tree expansion method of renormalization. We apply the dimensionally regularized tree expansion to QED, obtaining sharp bounds on the size of a renormalized graph. Subtractions are made with the Lagrangian counterterms of the tree expansion, not by minimal subtraction techniques, and so do not entail a knowledge of the meromorphic structure of a graph as a function of dimension. This renormalization procedure respects the Ward identities, and the counterterms required are gauge invariant.     

On Connected Diagrams and Cumulants of Erdős-Rényi Matrix Models

Regarding the adjacency matrices of n-vertex graphs and related graph Laplacian we introduce two families of discrete matrix models constructed both with the help of the Erdős-Rényi ensemble of random graphs. Corresponding matrix sums represent the characteristic functions of the average number of walks and closed walks over the random graph. These sums can be considered as discrete analogues of the matrix integrals of random matrix theory. We study the diagram structure of the cumulant expansions of logarithms of these matrix sums and analyze the limiting expressions as n → ∞ in the cases of constant and vanishing edge probabilities.     

On Lennard–Jones Type Potentials and Hard-Core Potentials with an Attractive Tail

We revisit an old tree graph formula, namely the Brydges–Federbush tree identity, and use it to get new bounds for the convergence radius of the Mayer series for gases of continuous particles interacting via non-absolutely summable pair potentials with an attractive tail including Lennard–Jones type pair potentials.     

Potts model and graph theory

Elementary exposition is given of some recent developments in studies of graphtheoretic aspects of the Potts model. Topics discussed include graphical expansions of the Potts partition function and correlation functions and their relationships with the chromatic, dichromatic, and flow polynomials occurring in graph theory. It is also shown that the Potts model realization of these classic graph-theoretic problems provides alternate and direct proofs of properties established heretofore only in the context of formal graph theory.     

基于图论的空间热网拓扑结构

针对多热源环状热网水力工况分析所涉及的非平面网、及故障工况供回水管网不对称的问题,基于图论提出一种建立空间热网拓扑结构的方法:根据供回水管网基本结构信息,采用面向对象的程序设计方法,定义图并包含相关算法,自动生成关联矩阵和基本回路矩阵;在平面图的基础上,结合热源和热用户信息,采用广度优先搜索生成空间热网的"树",据此构建空间热网的基本关联矩阵和基本回路矩阵.研制了建立多热源环状空间热网拓扑结构的程序,通过哈尔滨开发区热网的模拟,对程序的计算性能进行验证.该方法以图的相关算法为基础,能适应不同型式管网的计算,为复杂热网的水力工况分析和非对称热网的计算提供手段.     

Nonmonotonic Behavior in Hard-Core and Widom–Rowlinson Models

We give two examples of nonmonotonic behavior in symmetric systems exhibiting more than one critical point at which spontanoous symmetry breaking appears or disappears. The two systems are the hard-core model and the Widom–Rowlinson model, and both examples take place on a variation of the Cayley tree (Bethe lattice) devised by Schonmann and Tanaka. We obtain similar, though less constructive, examples of nonmonotonicity via certain local modifications of any graph, e.g., the square lattice, which is known to have a critical point for either model. En route we discuss the critical behavior of the Widom–Rowlinson model on the ordinary Cayley tree. Some results about monotonicity of the phase transition phenomenon relative to graph structure are also given.     

Injective Tensor Products in Strict Deformation Quantization

Mathematical Physics, Analysis and Geometry - We consider the existence of the topological entropy of shift spaces on a finitely generated semigroup whose Cayley graph is a tree. The considered...     

Analytical representations of the Mössbauer recoilless fraction,Debye-Waller factors,lattice energies,and heat capacities

Simple analytical expansions are given for the recoilless fraction in Mössbauer spectroscopy, the Debye-Waller factor in X-ray scattering, and the lattice energy and heat capacity of solids. While this problem has been discussed in an earlier paper [1], computer technology has now advanced to the point that direct evaluations of the simple expansions of these quantities are useful for quick curve fitting to experimental data at any desired temperature, and these expansions are easier to evaluate than using graphs to estimate recoilless fractions and Debye temperatures. We compare this approach with a polynomial expansion in terms of Bernoulli numbers, which has only a limited domain of convergence. We explicitly evaluate the convergence of these Debye integral expansions as a function of the number of terms used and the time required.This work was prepared with the support of the U.S. Department of Energy, Grant No. DE-FG02-85 ER 45199.     

On the glue content in heavy quarkonia

Starting with two coupled Bethe-Salpeter equations for the quark-antiquark, and for the quark-glue-antiquark component of the quarkonium, we solve the bound state equations perturbatively. The resulting admixture of glue can be partially understood in a semiclassical way; one has, however, to take care of the different use of time ordered versus retarded Green functions. Subtle questions concerning the precise definition of the equal time wave function arise, because the wave function for the Coulomb gluon is discontinuous with respect to the relative time of the gluon. A striking feature is that a one loop non-abelian graph contributes to the same order as tree graphs, because the couplings of transverse gluons in the tree graphs are suppressed in the non-relativistic bound state, while the higher order loop graph can couple to quarks via non-suppressed Coulomb gluons. We also calculate the amplitude for quark and antiquark at zero distance in the quark-glue-antiquark component of the P-state. This quantity is of importance for annihilation decays of P-states. It shows a remarkable compensation between the tree graph and the non-abelian loop graph contribution. An extension of our results to include non-perturbative effects is possible.Received: 24 April 2003, Revised: 4 June 2003, Published online: 20 August 2003     

A Remark on High Temperature Polymer Expansion for Lattice Systems with Infinite Range Pair Interactions

We consider the standard high temperature-small activity polymer expansion for lattice spin systems and show how, in many cases using a tree graph equality, various classical results may be improved in some cases or at least proved in a much simpler way.     

Relevance of the slowly varying electron gas to atoms, molecules, and solids

We present a Thomas-Fermi-inspired density scaling under which electron densities of atomic, molecular, or condensed matter become both large and slowly varying, so that semiclassical approximations and second-order density gradient expansions are asymptotically exact for the kinetic and exchange energies. Thus, even for atoms and molecules, density-functional approximations should recover the universal second-order gradient expansions in this limit. We also explain why common generalized gradient approximations for exchange do not.     

无线传感器网络中基于最小延时的数据汇集树构建与传输调度算法

无线传感器网络的数据通信模式问题是目前的研究热点,针对现有的无线传感器网络数据汇集算法延时较大这一不足,对最小延时数据汇集树和传输调度问题进行了研究。提出一种基于度约束的汇集树构建算法(DCAT)。该算法按照 BFS 方式遍历图,当遍历到每个节点时,通过确定哪些节点与汇点更近来确定潜在母节点集合。然后,选择图中度数最小的潜在母节点作为当前被遍历节点的母节点。此外,为了在给定的汇集树上进行高效地数据汇集,还提出两种新的基于贪婪的TDMA传输调度算法：WIRES-G 和 DCAT-Greedy。利用随机生成的不同规模的传感器网络,参照当前最新算法,对文中方法的性能进行了全面评估。结果表明,与当前最优算法相比,文中调度算法与文中汇集树构建算法结合起来,可显著降低数据汇集的延时。     

Coulomb effects in semiconductor quantum dots

This paper presents a new model for the Internet graph (AS graph) based on the concept of heuristic trade-off optimization, introduced by Fabrikant, Koutsoupias and Papadimitriou in [5] to grow a random tree with a heavily tailed degree distribution. We propose here a generalization of this approach to generate a general graph, as a candidate for modeling the Internet. We present the results of our simulations and an analysis of the standard parameters measured in our model, compared with measurements from the physical Internet graph.Received: 9 February 2004, Published online: 14 May 2004PACS: 89.75.-k Complex systems - 89.75.Hc Networks and genealogical trees - 89.75.Da Systems obeying scaling laws - 89.75.Fb Structures and organization in complex systems - 89.65.Gh Economics; econophysics, financial markets, business and managementLRI: http: //www.lri.fr/~ihameli; CNRS, LIP, ENS Lyon : http: //www.ens-lyon.fr/~nschaban