Related papers: Compositions constrained by graph Laplacian minors
We consider a magnetic Laplacian with periodic magnetic potentials on periodic discrete graphs. Its spectrum consists of a finite number of bands, where degenerate bands are eigenvalues of infinite multiplicity. We obtain a specific…
Using methods from algebraic graph theory and convex optimization, we study the relationship between local structural features of a network and spectral properties of its Laplacian matrix. In particular, we derive expressions for the…
We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann-distributed limit structure. We demon- strate how this setting encompasses arbitrary weighted…
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…
In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…
Simplicial complexes are generalizations of graphs that describe higher-order network interactions among nodes in the graph. Network dynamics described by graph Laplacian flows have been widely studied in network science and control theory,…
This paper initiates the study of the "Laplacian simplex" $T_G$ obtained from a finite graph $G$ by taking the convex hull of the columns of the Laplacian matrix for $G$. Basic properties of these simplices are established, and then a…
The simplest toroidally compactified string theories exhibit a duality between large and small radii: compactification on a circle, for example, is invariant under R goes to 1/R. Compactification on more general Lorentzian lattices (i.e.…
We associate to a finite digraph $D$ a lattice polytope $P_D$ whose vertices are the rows of the Laplacian matrix of $D$. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem,…
We consider a Laplacian on periodic discrete graphs. Its spectrum consists of a finite number of bands. In a class of periodic 1-forms, i.e., functions defined on edges of the periodic graph, we introduce a subclass of minimal forms with a…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
The paper is a brief survey of some recent new results and progress of the Laplacian spectra of graphs and complex networks (in particular, random graph and the small world network). The main contents contain the spectral radius of the…
In this paper we give a full classification of global solutions of the obstacle problem for the fractional Laplacian (including the thin obstacle problem) with compact coincidence set and at most polynomial growth in dimension $N \geq 3$.…
In this paper we investigate a spectra of the Laplacian matrix of cyclic groups using the properties of their characteristic polynomials. We have proved several assertions about the relationship between the spectra of different groups.
The concept of graph compositions is related to several number theoretic concepts, including partitions of positive integers and the cardinality of the power set of finite sets. This paper examines graph compositions where the total number…
In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the…
The vertex-weighted Laplacian naturally extends the combinatorial Laplacian for simplicial complexes. Inspired by Lew's foundational techniques for vertex-weighted Laplacians, we present a comprehensive spectral analysis of this operator.…
The trees, respectively unicyclic graphs, on $n$ vertices with the smallest Laplacian permanent are studied. In this paper, by edge-grafting transformations, the $n$-vertex trees of given bipartition having the second and third smallest…
In this paper we derive the symplectic framework for field theories defined by higher-order Lagrangians. The construction is based on the symplectic reduction of suitable spaces of iterated jets. The possibility of reducing a higher-order…