Estimates of general Mayer graphs. I: Construction of upper bounds for a given graph by means of sets of subgraphs

A large number of physical quantities (thermodynamic and correlation functions, scattering amplitudes, intermolecular potentials, etc. ...) can be expressed as sums of an infinite number of multiple integrals of the following type: $$\Gamma \left( {x_1 ,. . . , x_n } \right) = \int {\prod {f_L \left( {x_{i,} x_j } \right)dx_{n + 1} . . . dx_{n + k} } }$$ These are called Mayer graphs in statistical mechanics, Feynman graphs in quantum field theory, and multicenter integrals in quantum chemistry. We call themn-graphs here. In a preceding note [Physics Letters 62A:295 (1977)], we have proposed a new estimation method which provides upper bounds for arbitraryn-graphs. This article is devoted to developing in detail the foundations of this method. As a first application, we prove that all virial coefficients of polar systems are finite. More generally, we show on some examples that our estimation method can givefinite upper bounds forn-graphs occurring in the perturbative developments of thermodynamic functions of neutral, polar, and ionized gases and of Green's functions of Euclidean quantum field theories (thus improving Weinberg's theorem), as also in variational approximations of intermolecular potentials. Our estimation method is based on the Hölder inequality which is an improvement over the mean value estimation method, employed by Riddell, Uhlenbeck, and Groeneveld, except for the hard-sphere gas, where both methods coincide. The method is applied so far only to individual graphs and not to thermodynamic functions.     

Scaling Limits and Generic Bounds for Exploration Processes

We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its neighboring nodes become blocked. Given an initial number of vertices N growing to infinity, we study statistical properties of the proportion of explored (active or blocked) nodes in time using scaling limits. We obtain exact limits for homogeneous graphs and prove an explicit central limit theorem for the final proportion of active nodes, known as the jamming constant, through a diffusion approximation for the exploration process which can be described as a unidimensional process. We then focus on bounding the trajectories of such exploration processes on random geometric graphs, i.e., random sequential adsorption. As opposed to exploration processes on homogeneous random graphs, these do not allow for such a dimensional reduction. Instead we derive a fundamental relationship between the number of explored nodes and the discovered volume in the spatial process, and we obtain generic bounds for the fluid limit and jamming constant: bounds that are independent of the dimension of space and the detailed shape of the volume associated to the discovered node. Lastly, using coupling techinques, we give trajectorial interpretations of the generic bounds.     

Renormalisation of Noncommutative ϕ 4-Theory by Multi-Scale Analysis

In this paper we give a much more efficient proof that the real Euclidean ? ⁴-model on the four-dimensional Moyal plane is renormalisable to all orders. We prove rigorous bounds on the propagator which complete the previous renormalisation proof based on renormalisation group equations for non-local matrix models. On the other hand, our bounds permit a powerful multi-scale analysis of the resulting ribbon graphs. Here, the dual graphs play a particular rôle because the angular momentum conservation is conveniently represented in the dual picture. Choosing a spanning tree in the dual graph according to the scale attribution, we prove that the summation over the loop angular momenta can be performed at no cost so that the power-counting is reduced to the balance of the number of propagators versus the number of completely inner vertices in subgraphs of the dual graph.     

Network synchronizability analysis: The theory of subgraphs and complementary graphs

In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network structural matrix, which characterizes the network synchronizability, especially when the network’s corresponding graph has cycles, chains, bipartite graphs or product graphs as its subgraphs.     

More on Higgs Bosons inSU(5)

In the framework of the minimalSU(5) model of Georgi and Glashow the explicit couplings between the various mass eigenstate Higgs bosons and the gauge fields as well as the Higgs boson self couplings are presented. As an application bounds for the parameters of the Higgs potential and for the Higgs boson masses are derived by applying partial wave unitarity to the tree graphs of Higgs-Higgs scattering.     

Maximum modular graphs

Modularity has been explored as an important quantitative metric for community and cluster detection in networks. Finding the maximum modularity of a given graph has been proven to be NP-complete and therefore, several heuristic algorithms have been proposed. We investigate the problem of finding the maximum modularity of classes of graphs that have the same number of links and/or nodes and determine analytical upper bounds. Moreover, from the set of all connected graphs with a fixed number of links and/or number of nodes, we construct graphs that can attain maximum modularity, named maximum modular graphs. The maximum modularity is shown to depend on the residue obtained when the number of links is divided by the number of communities. Two applications in transportation networks and data-centers design that can benefit of maximum modular partitioning are proposed.     

Gas-liquid phase transition

A theorem has been proved giving a sufficient condition for a first order phase transition in a gas. The corresponding fugacity expansions for the isotherms in the different phases have been derived. A synopsis of this paper was presented at the International Conference on Statistical Physics at Budapest, 1975. This paper is the revised version of an earlier paper published by the author (Biswas 1973) and subsequently criticized by Groeneveld (Groeneveld 1973). This paper is self-complete and free from the objections raised by Groeneveld about the earlier paper.     

Melonic Phase Transition in Group Field Theory

Group field theories have recently been shown to admit a 1/N expansion dominated by so-called ‘melonic graphs’, dual to triangulated spheres. In this note, we deepen the analysis of this melonic sector. We obtain a combinatorial formula for the melonic amplitudes in terms of a graph polynomial related to a higher-dimensional generalization of the Kirchhoff tree-matrix theorem. Simple bounds on these amplitudes show the existence of a phase transition driven by melonic interaction processes. We restrict our study to the Boulatov–Ooguri models, which describe topological BF theories and are the basis for the construction of 4-dimensional models of quantum gravity.     

Convergence of Cluster and Virial expansions for Repulsive Classical Gases

We study the convergence of cluster and virial expansions for systems of particles subject to positive two-body interactions. Our results strengthen and generalize existing lower bounds on the radii of convergence and on the value of the pressure. Our treatment of the cluster coefficients is based on expressing the truncated weights in terms of trees and partition schemes, and generalize to soft repulsions previous approaches for models with hard exclusions. Our main theorem holds in a very general framework that does not require translation invariance and is applicable to models in general measure spaces. Our virial results, stated only for homogeneous single-space systems, rely on an approach due to Ramawadh and Tate. The virial coefficients are computed using Lagrange inversion techniques but only at the level of formal power series, thereby yielding diagrammatic expressions in terms of trees, rather than the doubly connected diagrams traditionally used. We obtain a new criterion that strengthens, for repulsive interactions, the best criterion previously available (proposed by Groeneveld and proven by Ramawadh and Tate). We illustrate our results with a few applications showing noticeable improvements in the lower bound of convergence radii.

     

Bounds for the sum of ladder graphs and the occurence of ghosts

Rigorous upper and lower bounds for the sum of scalar ladder graphs are derived. These bounds are compatible with Regge behaviour but reveal the existence of ghosts for sufficiently large coupling constants.     

On the Validations of the Asymptotic Matching Conjectures

In this paper we review the asymptotic matching conjectures for r-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in d-dimensional integer lattice and Bethe lattices. We prove new rigorous upper and lower bounds for the monomer-dimer entropies, which support these conjectures. We describe a general construction of infinite families of r-regular tori graphs and give algorithms for computing the monomer-dimer entropy of density p, for any p∈[0,1], for these graphs. Finally we use tori graphs to test the asymptotic matching conjectures for certain infinite r-regular bipartite graphs.     

Coulomb interaction symmetries and the Mayer series in the two-dimensional dipole gas

We study the Mayer series of the two-dimensional dipole gas in the high-temperature, low-density regime. Without performing any multiscale analysis, we obtain bounds showing that the Mayer coefficients are finite in the thermodynamic limit. These bounds are obtained by exploiting a particular partial symmetry of the interaction (which we nameO-symmetry), already used in some problems related to the two-dimensional Coulomb gas. By direct bounds on some Mayer graphs we also conjecture that any technique based uniquely on theO-symmetry will not be sufficient to prove analyticity of the series.     

Diffusion on Delone sets

We consider graphs associated to Delone sets in Euclidean space. Such graphs arise in various ways from tilings. Here, we provide a unified framework. In this context, we study the associated Laplace operators and show Gaussian heat kernel bounds for their semigroups. These results apply to both metric and discrete graphs.     

The Number of Large Graphs with a Positive Density of Triangles

We give upper and lower bounds on the number of graphs of fixed degree which have a positive density of triangles. In particular, we show that there are very few such graphs, when compared to the number of graphs without this restriction. We also show that in this case the triangles seem to cluster even at low density.     

Mixing Time Bounds via Bottleneck Sequences

We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees.     

One-dimensional quantum chaos: Explicitly solvable cases

We present quantum graphs with remarkably regular spectral characteristics. We call them regular quantum graphs. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly solvable in terms of periodic orbits. We present analytical solutions for the spectrum of regular quantum graphs in the form of explicit and exact periodic orbit expansions for each individual energy level.     

Some Abstract Wegner Estimates with Applications

We prove some abstract Wegner bounds for random self-adjoint operators. Applications include elementary proofs of Wegner estimates for discrete and continuous Anderson Hamiltonians with possibly sparse potentials, as well as Wegner bounds for quantum graphs with random edge length or random vertex coupling. We allow the coupling constants describing the randomness to be correlated and to have quite general distributions.     

Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix

Using the spectral distribution associated with the adjacency matrix of graphs, we introduce a new method of calculation of amplitudes of continuous-time quantum walk on some rather important graphs, such as line, cycle graph C_n, complete graph K_n, graph G_n, finite path and some other finite and infinite graphs, where all are connected with orthogonal polynomials such as Hermite, Laguerre, Tchebichef, and other orthogonal polynomials. It is shown that using the spectral distribution, one can obtain the infinite time asymptotic behavior of amplitudes simply by using the method of stationary phase approximation (WKB approximation), where as an example, the method is applied to star, two-dimensional comb lattices, infinite Hermite and Laguerre graphs. Also by using the Gauss quadrature formula one can approximate the infinite graphs with finite ones and vice versa, in order to derive large time asymptotic behavior by WKB method. Likewise, using this method, some new graphs are introduced, where their amplitudes are proportional to the product of amplitudes of some elementary graphs, even though the graphs themselves are not the same as the Cartesian product of their elementary graphs. Finally, by calculating the mean end to end distance of some infinite graphs at large enough times, it is shown that continuous-time quantum walk at different infinite graphs belong to different universality classes which are also different from those of the corresponding classical ones.     

Bounds on natural frequencies of composite circular membranes: Integral equation methods

This paper is concerned with finding upper and lower bounds for the natural frequencies of vibration of a circular membrane with stepped radial density. Such problems, involving discontinuous coefficients in the differential equation, may be treated by using classical variational methods. However, it is shown here that eigenvalue estimation techniques based on an integral equation formulation are more effective. Integral equation methods provide more accurate upper bounds, for a comparable amount of effort, and supply improvable lower bounds as well.     

Percolation on Infinite Graphs and Isoperimetric Inequalities

We consider the Bernoulli bond percolation process (with parameter p) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric inequality if the graph has a bi-infinite geodesic, or two isoperimetric inequalities if the graph has not a bi-infinite geodesic. This new criterion extends previous criteria and brings together a large class of amenable graphs (such as regular lattices) and non-amenable graphs (such trees). We also study the finite connectivity in graphs satisfying the new general criterion and show that graphs in this class with a bi-infinite geodesic always have finite connectivity functions with exponential decay when p is sufficiently close to one. On the other hand, we show that there are graphs in the same class with no bi-infinite geodesic for which the finite connectivity decays sub-exponentially (down to polynomially) in the highly supercritical phase even for p arbitrarily close to one.