Related papers: Analyse harmonique sur le graphe de Pascal
We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
We give a short proof of Kaledin's theorem on the degeneration of the noncommutative Hodge-to-de Rham spectral sequence. Our approach is based on topological Hochschild homology and the theory of cyclotomic spectra. As a consequence, we…
For a finite graph, a spectral curve is constructed as the zero set of a two-variate polynomial with integer coefficients coming from p-adic diffusion on the graph. It is shown that certain spectral curves can distinguish non-isomorphic…
We summarize recent results initiating spectral analysis on pseudo-Riemannian locally symmetric spaces $\Gamma \backslash G/H$, beyond the classical setting where $H$ is compact (e.g. theory of automorphic forms for arithmetic $\Gamma$) or…
We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
We look at the decomposition of the compactified jacobian of a singular curve into components and discuss some examples.
In the present paper, we examine in detail the method of "graph compactifications" of topological groups. The graph and Ellis methods of constructing proper compactifications of topological groups are applied for the investigation of…
This note attempts to understand graph limits as defined by Lovasz and Szegedy (2006)} in terms of harmonic analysis on semigroups. This is done by representing probability distributions of random exchangeable graphs as mixtures of…
This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or…
We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…
Analysis of signals defined on complex topologies modeled by graphs is a topic of increasing interest. Signal decomposition plays a crucial role in the representation and processing of such information, in particular, to process graph…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
We revisit the non-commutative Hodge-to-de Rham Degeneration Theorem of the first author, and present its proof in a somewhat streamlined and improved form that explicitly uses spectral algebraic geometry. We also try to explain why…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We prove that the Hodge-de Rham spectral sequence for smooth proper tame Artin stacks in characteristic p (as defined by Abramovich, Olsson, and Vistoli) which lift mod p^2 degenerates. We push the result to the coarse spaces of such…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
We investigate conditions on a graph $C^*$-algebra for the existence of a faithful semifinite trace. Using such a trace and the natural gauge action of the circle on the graph algebra, we construct a smooth $(1,\infty)$-summable semfinite…
We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.