Related papers: Asymptotic Behavior of Partition Functions with Gr…

Let $G$ be a simple graph and $Q(G)$ be the signless Laplacian matrix of $G$. Let $S_\alpha(G)$ be the sum of the $\alpha$-th powers of the nonzero eigenvalues of $Q(G)$. We disprove two conjectures by You and Yang on the extremal values of…

We investigate, in a fairly general setting, the limit of large volume equilibrium Gibbs measures for elasticity type Hamiltonians with clamped boundary conditions. The existence of a quasiconvex free energy, forming the large deviations…

We solve the loop equations to all orders in $1/N^2$, for the Chain of Matrices matrix model (with possibly an external field coupled to the last matrix of the chain). We show that the topological expansion of the free energy, is, like for…

We apply well-established concepts of Langevin sampling to derive a new class of algorithms for the efficient computation of free energy differences of fluctuating particles embedded in a 'fast' membrane, i.e., a membrane that…

Suppose that A_1,\dots, A_N are independent random matrices whose atoms are iid copies of a random variable \xi of mean zero and variance one. It is known from the works of Newman et. al. in the late 80s that when \xi is gaussian then…

Let $G$ be a graph of order $n$, and $d_i$ the degree of a vertex $v_i$ of $G$. The Randi\'c matrix ${\bf R}=(r_{ij})$ of $G$ is defined by $r_{ij} = 1 / \sqrt{d_jd_j}$ if the vertices $v_i$ and $v_j$ are adjacent in $G$ and $r_{ij}=0$…

We answer two questions regarding the sum-of-squares for the SYK model left open in Ref. 1, both of which are related to graphs. First (a "limitation"), we show that a fragment of the sum-of-squares, in which one considers commutation…

An analysis is made of a moving disturbance using a directed cyclic graph. A statistical approach is used to calculate the alternative positions in space and state of the disturbance with a defined observed time. The probability for a…

In this article we consider the spectrum of a Laplacian matrix, also known as the Markov matrix, under the independence assumption. We assume that the entries have a variance profile. Motivated by recent works on generalized Wigner matrices…

A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…

Gutman {\it et al.} introduced the concepts of energy $\En(G)$ and Laplacian energy $\EnL(G)$ for a simple graph $G$, and furthermore, they proposed a conjecture that for every graph $G$, $\En(G)$ is not more than $\EnL(G)$. Unfortunately,…

In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…

We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

The equilibrium statistical mechanics of one-dimensional lattice gases with interactions of arbitrary range and shape between first-neighbor atoms is solved exactly on the basis of statistically interacting vacancy particles. Two sets of…

We derive a fluctuation theorem for generalized work distributions, related to bijective mappings of the phase spaces of two physical systems, and use it to derive a two-sided constraint maximum likelihood estimator of their free energy…

The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…

Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…

We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…

It is known that solutions of Richardson equations can be represented as stationary points of the "energy" of classical free charges on the plane. We suggest to consider "probabilities" of the system of charges to occupy certain states in…