Related papers: A higher Boltzmann distribution
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
This paper presents a novel way to approximate a distribution governing a system of coupled particles with a product of independent distributions. The approach is an extension of mean field theory that allows the independent distributions…
On contrary to the customary thought, the well-known ``lemma'' that the distribution function of a collisionless Boltzmann gas keeps invariant along a molecule's path represents not the strength but the weakness of the standard theory. One…
The collisionless Boltzmann equation, also called free-streaming, is a convenient approximation. It is rather simple to implement numerically, and and it is effective at reducing the irregularities of rough initial conditions. It can be…
We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…
We introduce polytopal cell complexes associated with partial acyclic orientations of a simple graph, which generalize acyclic orientations. Using the theory of cellular resolutions, two of these polytopal cell complexes are observed to…
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
We study stochastic processes that generate non-growing complex networks without self-loops and multiple edges (simple graphs). The work concentrates on understanding and formulation of constraints which keep the rewiring stochastic…
This paper explores the distributed broadcast problem within the context of network communications, a critical challenge in decentralized information dissemination. We put forth a novel hypergraph-based approach to address this issue,…
The $K$-core of a graph is the unique maximum subgraph within which each vertex connects to $K$ or more other vertices. The optimal $K$-core attack problem asks to delete the minimum number of vertices from the $K$-core to induce its…
We consider an interaction representation in the Boltzmann field theory. It describes the master field for a subclass of planar diagrams in matrix models, so called half-planar diagrams. This interaction representation was found in the…
Recently, the higher order averaging method for studying periodic solutions of both Lipschitz differential equations and discontinuous piecewise smooth differential equations was developed in terms of Brouwer degree theory. Between the…
We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1…
The Horton-Strahler analysis is a graph-theoretic method to measure the bifurcation complexity of branching patterns, by defining a number called the order to each branch. The main result of this paper is a large deviation theorem for the…
We consider M systems (each an electron in a long square cylinder) uniformly arranged on a ring and with Coulomb interactions. Exact straightforward numerical time-dependent perturbation calculation of a single N-level ($\lesssim 7$)…
Hodge Laplacians have been previously proposed as a natural tool for understanding higher-order interactions in networks and directed graphs. Here we introduce a Hodge-theoretic approach to spectral theory and dimensionality reduction for…
We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a…
In this article we use a theorem of Carlson and Griffiths and compute periods of linear algebraic cycles inside the Fermat variety of even dimension $n$ and degree $d$. As an application, for examples of $n$ and $d$ we prove that the locus…
Network Models with couplings between link pairs are the simplest models for a class of networks with Higher Order interactions. In this paper we give an analytic, general solution to this family of Random Graph Models extending previous…