Related papers: Spectral partitions on infinite graphs

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

An exact analytical solution of the statistical multifragmentation model is found in thermodynamic limit. The model exhibits a 1-st order phase transition of the liquid-gas type. The mixed phase region of the phase diagram, where the gas of…

Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…

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…

For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,d_n$ is the degree…

Inspired by the concept of complementarity, we present a illustrative model for the weak interactions with unbroken gauge symmetry and unbroken supersymmetry. The observable particles are bound states of some more fundamental particles.…

Mesoscopic density functional theory for inhomogeneous mixtures of sperical particles is developed in terms of mesoscopic volume fractions by a systematic coarse-graining procedure starting form microscopic theory. Approximate expressions…

Many natural and social systems develop complex networks, that are usually modelled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semi-circle law is known to…

We study the asymptotics of large, simple, labeled graphs constrained by the densities of edges and of $k$-star subgraphs, $k\ge 2$ fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of…

Quantum graphity is a background independent model for emergent geometry, in which space is represented as a complete graph. The high-energy pre-geometric starting point of the model is usually considered to be the complete graph, however…

We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…

A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…

We define the fundamental quandle of a spatial graph and several invariants derived from it. In the category of graph tangles, we define an invariant based on the walks in the graph and cocycles from nonabelian quandle cohomology.

We describe a finite inhomogeneous three dimensional system of classical particles which interact through short and (or) long range interactions by means of a simple analytic spin model. The thermodynamic properties of the system are worked…

We describe the spectral theory of the adjacency operator of a graph which is isomorphic to homogeneous trees at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the…

We study topological Poincar\'e type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants…

We are interested in evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a…

In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…

We study an equilibrium statistical mechanical model of tree graphs which are made up of a linear subgraph (the spine) to which leaves are attached. We prove that the model has two phases, a generic phase where the spine becomes infinitely…

Clustering $\unicode{x2013}$ the tendency for neighbors of nodes to be connected $\unicode{x2013}$ quantifies the coupling of a complex network to its latent metric space. In random geometric graphs, clustering undergoes a continuous phase…