Related papers: A higher Boltzmann distribution
Several possible presentations for the homotopy theory of (non-hypercomplete) $\infty$-stacks on a classical site S are discussed. In particular, it is shown that an elegant combinatorial description in terms of diagrams in S exists,…
This article investigates the full Boltzmann equation up to second order in the cosmological perturbations. Describing the distribution of polarized radiation by a tensor valued distribution function, we study the gauge dependence of the…
Homology is characterized by the Eilenberg-Steenrod axioms. We define homology of higher categories via a categorical analogue of the Eilenberg-Steenrod axioms. We prove a categorical Dold-Kan correspondence, providing a combinatorial…
We give an expression for the solution to propagator-type Dyson-Schwinger equations with one primitive at 1 loop as an expansion over rooted connected chord diagrams. Along the way we give a refinement of a classical recurrence of rooted…
In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a…
Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholz-Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral…
The degree distribution is a key statistical indicator in network theory, often used to understand how information spreads across connected nodes. In this paper, we focus on non-growing networks formed through a rewiring algorithm and…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree…
In this paper, we study the combinatorics of a subcomplex of the Bloch-Kriz cycle complex [4] used to construct the category of mixed Tate motives. The algebraic cycles we consider properly contain the subalgebra of cycles that correspond…
Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice. Higher-order…
This paper considers three separate matrices associated to graphs and (each dimension of) cell complexes. It relates all the coefficients of their respective characteristic polynomials to the geometric and combinatorial enumeration of three…
We derive novel results on the ergodic theory of irreducible, aperiodic Markov chains. We show how to optimally steer the network flow to a stationary distribution over a finite or infinite time horizon. Optimality is with respect to an…
In this paper we complete the program initiated by the first and second authors and rigorously derive a Boltzmann-type equation that incorporates higher order collisions among gas particles. More precisely, starting from a finite…
There is a strong interest in studying the correspondence between Euclidean quantum fields and neural networks. This correspondence takes different forms depending on the type of networks considered. In this work, we study this…
Karlin and Altschul in their statistical analysis for multiple high-scoring segments in molecular sequences introduced a distribution function which gives the probability there are at least r distinct and consistently ordered segment pairs…
An analytical solution to the Hill problem Hamiltonian expanded about the libration points has been obtained by means of perturbation techniques. In order to compute the higher orders of the perturbation solution that are needed to capture…
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of…
We define $k$-dimensional digraphs and initiate a study of their spectral theory. The $k$-dimensional digraphs can be viewed as generating graphs for small categories called $k$-graphs. Guided by geometric insight, we obtain several new…