betaFeedback

WorksPhysics and Astronomy

A Hierarchy of Fast and Strong Signatures for Vertex Orbits

Abstract

The defining features of a physical system are its symmetries and its invariants. For a network, the symmetries are the automorphisms, and the invariants are the vertex orbits they define. Two vertices of a graph may appear structurally indistinguishable without being interchangeable under any graph automorphism. Distinguishing apparent similarity from genuine symmetry lies at the heart of the vertex-orbit partition problem. In this work, we develop a hierarchy of increasingly expressive, automorphism-invariant signatures that draw on the spectral properties of the graph Laplacian and the Dirac operator to reveal subtle structural differences. Guided by a sequence of counterexamples, we progressively strengthen these signatures, ultimately incorporating probing techniques, which are temporary structural perturbations, that expose the hidden distinctions in the original unperturbed graph. We evaluate our approach across diverse benchmark families, recovering exact orbit partitions in challenging instances, including graphs that resist low-dimensional Weisfeiler–Leman refinement. We also examine the computational and numerical limitations of our constructions, distinguishing empirical success from theoretical completeness. Our findings highlight the potential of spectral and probing-based methods for uncovering the structural distinctions that define vertex orbit.

Introduction

The study of symmetries, or transformations that leave a system invariant, is central to physics [1, 2, 3]. In statistical physics, the symmetries are the organizing principle behind collective behavior: they are used to classify phases of matter, constrain the structure of the order parameter and the free energy that governs it, and determine the type of phase transition that may arise [4, 5, 6, 7, 8, 9]. The study of symmetry is not restricted to the continuous and is equally applicable to systems defined on discrete structures, such as lattices. Complex networks, however, represent a more general class of discrete structures that model interactions in complex systems: the vertices carry the degrees of freedom, the edges carry the interactions, and the network’s structure shapes the collective behavior that emerges [10, 11]. It is natural to ask, then, whether the statistical-physics notion of symmetry extends to the setting of a network and whether its symmetries play the same organizing role that they do for a system in continuous space [12, 13, 14, 15, 16, 17]. A first step in that direction is to compare the nodes of a network in pairs. Two vertices may look identical without being interchangeable [18, 19, 20]. They may have the same degree, share the same distribution of distances to other vertices, or exhibit indistinguishable responses to a dynamical process, yet no symmetry of the graph need exchange them. Making this distinction precise is the task of vertex-orbit identification. For a graph G=(V,E)G = (V, E), its automorphism group Aut⁡(G)\operatorname{Aut}(G) consists of the permutations of VV that preserve adjacency. The orbit of a vertex uu is

Orb⁡G(u)={π(u):π∈Aut⁡(G)},\operatorname{Orb}_{G}(u) = \{\pi(u) : \pi\in\operatorname{Aut}(G)\},

and the orbits partition VV into classes of genuinely interchangeable vertices. This partition is closely related to the graph-isomorphism problem, but it asks for more than a comparison of two graphs: it asks which vertices of a single graph are equivalent under its own symmetries. A standard way to approach such questions is to compute inexpensive, isomorphism-invariant vertex descriptors and refine the classes they induce [21]. The difficulty is that equality of descriptors need not imply membership in the same orbit. Indeed, obtaining the orbit partition efficiently on arbitrary graphs remains a challenging problem, against the backdrop of the quasipolynomial-time upper bound for general graph isomorphism [22]. Broad accounts of the algorithmic and complexity-theoretic landscape are provided by Grohe and Schweitzer [23] and Grohe and Neuen [24]; the latter also surveys developments following Babai’s quasipolynomial-time isomorphism algorithm [22]. Practical solvers such as nauty and Traces use combinatorial invariants, partition refinement, and individualization to determine graph symmetries and construct canonical labelings [21].

Among the refinement schemes these methods build on, the Weisfeiler–Leman (WL) hierarchy provides a natural starting point; its details are given in The kk-dimensional Weisfeiler–Leman algorithm section. Its successive color refinements extract increasingly detailed combinatorial information, with higher-dimensional variants operating on tuples of vertices; surveys of its algorithmic and logical role can be found in [24, 25]. Since the resulting colors are invariant under automorphisms, the induced vertex classes contain entire orbits, but distinct orbits may remain indistinguishable. The Cai–Fürer–Immerman construction establishes fundamental limitations of bounded-dimensional WL for distinguishing non-isomorphic graphs [26]. Such graph-identification lower bounds should not be conflated with failures of orbit recovery on a given graph.

A complementary approach extracts invariants from matrices associated with a graph. The spectral properties of graph Laplacians and the limits of spectral characterization are treated in the surveys of Merris [27] and van Dam and Haemers [28]. Although isomorphic graphs have the same Laplacian spectrum, the converse fails in general; at the vertex level, cospectrality is likewise weaker than equivalence under an automorphism [29]. Matrix functions such as the heat kernel retain information beyond a list of eigenvalues and give access to vertex-dependent, multiscale responses. Heat-kernel signatures were developed as intrinsic descriptors in geometric shape analysis [30], and Raviv, Kimmel, and Bruckstein directly investigated graph isomorphisms and automorphisms through Laplacian spectral signatures [31]. Thus, the use of heat diffusion to study graph symmetry has important precedents.

The wider relationship between random walks, diffusion, and network structure is reviewed by Masuda, Porter, and Lambiotte [32]. More directly, Najem and Mouawad [33] used curvature-inspired coefficients fitted to heat-kernel returns, followed by refinement and probing, to construct and verify candidate graph isomorphisms. The present work departs from that fitting-based geometric interpretation and focuses instead on recovering the orbit partition from heat-kernel information itself. Our signatures incorporate full diffusion rows organized by graph distance, as well as complementary operators and graph transformations. In particular, Laplacian-based correlation functions have been considered in network coarse-graining [34], while graph Dirac operators provide coupled vertex–edge dynamics [35]. We use these ingredients as sources of additional invariant information, together with line graphs and exact-distance graphs, rather than treating any one operator as a complete characterization of vertex symmetry.

Increasing the amount of information available is not, however, a cost-free remedy. Richer graph representations can make dense spectral computations prohibitively expensive, while even combinations of several signatures may leave vertices from different orbits in a common class. Rather than indefinitely enlarge the transformed graphs, we turn to probing. Here a vertex is distinguished not only by a signature of the original graph, but by the collection of signatures obtained after systematically applying controlled, rooted graph modifications. By considering admissible modifications in a way that respects relabeling, these probes expose relational differences that static summaries had concealed.

The outcome is a hierarchy of increasingly expressive signatures, not a claim that any one of them is a complete invariant for arbitrary graphs. We give the constructions, explain their automorphism-invariance in the exact setting, and document the counterexamples that motivated their successive refinements. We then evaluate the resulting partitions against known vertex orbits on a broad range of benchmark graphs, compare their distinguishing behavior with Weisfeiler–Leman refinement, and examine the time and memory costs of the spectral and probing stages. Under the stated arithmetic model, fixed-depth transformations and probes of fixed size admit polynomial bounds, but their degrees and practical costs can be substantial; moreover, numerical discretization introduces resolution limits absent from the exact mathematical objects. These distinctions matter: successfully recovering the orbit partition on difficult instances is evidence of discriminating power, not a general proof of completeness or of a polynomial-time orbit algorithm.

In this sense, the paper is both a continuation of and a departure from [33]. We retain the central insight that diffusion can reveal subtle structural information, but no longer require that information to be interpreted as curvature on a latent manifold. Instead, we ask a more directly combinatorial question: which invariant observations of a vertex and which invariant responses to controlled changes in the graph are sufficient to distinguish it from vertices outside its orbit? The counterexamples encountered along the way are not incidental obstacles; they are the organizing principle of the construction and the guide to its remaining limitations.

Construction and evolution of our signatures

We start from where Najem and Mouawad [33] left off. In that paper, the signatures are motivated by a direct analogy to a result for the heat kernel on a continuous, Riemannian manifold setting. In the short-time asymptotic, one can expand the heat kernel as an infinite series whose coefficients carry curvature information. More precisely, the classical Minakshisundaram–Pleijel expansion gives that the heat kernel obeys

K(x,y,t)=1(4πt)n/2exp⁡(−d(x,y)24t)∑k=0∞uk(x,y)tk,(1)K(x,y,t) = \frac{1}{(4\pi t)^{n/2}} \exp\left(-\frac{d(x,y)^2}{4t}\right) \sum_{k=0}^{\infty} u_k(x,y)t^k, \tag*{(1)}

for an nn-dimensional smooth Riemannian manifold, locally near the diagonal, as t→0+t \to0^{+}. In particular, on the diagonal (when x=yx=y), u0(x,x)=1u_0(x,x)=1, u1(x,x)=16RScal(x)u_1(x,x)=\frac{1}{6}R_{\mathrm{Scal}}(x), and

u2(x,x)=1360(12ΔRScal(x)+5RScal(x)2−2∣Ric⁡(x)∣2+2∣R(x)∣2),(2)u_2(x,x) = \frac{1}{360}\left(12\Delta R_{\mathrm{Scal}}(x) + 5R_{\mathrm{Scal}}(x)^2 - 2|\operatorname{Ric}(x)|^2 + 2|R(x)|^2\right), \tag*{(2)}

with

∣Ric⁡(x)∣2:=Rij(x)Rij(x)gii(x)gjj(x),∣R(x)∣2:=Rijkl(x)Rijkl(x)gii(x)gjj(x)gkk(x)gll(x),(3)\begin{aligned} |\operatorname{Ric}(x)|^2 &:= R_{ij}(x)R_{ij}(x)g^{ii}(x)g^{jj}(x),\\ |R(x)|^2 &:= R_{ijkl}(x)R_{ijkl}(x)g^{ii}(x)g^{jj}(x)g^{kk}(x)g^{ll}(x), \tag*{(3)} \end{aligned}

where gg is the Riemannian metric, RScal(x)R_{\mathrm{Scal}}(x) is the scalar curvature at xx, Ric⁡ij(x)\operatorname{Ric}_{ij}(x) is the Ricci tensor, and Rijkl(x)R_{ijkl}(x) is the Riemann curvature tensor. Higher-order terms are polynomials depending on the curvature tensor and its covariant derivatives. For the mathematical literature, see [36], [37 p. 201, Theorem 3.3.1], [38], and [39 Theorem 3.1].

Conversely, a diffusion process on a graph G\mathcal{G} with NN nodes is given by the differential equation

∂u∂t=−Lu,(4)\frac{\partial u}{\partial t}=-Lu, \tag*{(4)}

where u(t)u(t) is an NN-vector representing a concentration variable over each node and LL is the Laplacian matrix. The latter is given by L=D−AL=D-A, where DD is a diagonal matrix of the nodes’ degrees and AA is the adjacency matrix satisfying Aij=1A_{ij}=1 if (i,j)∈E(i,j)\in E and 00 otherwise. (4) admits the solution

u(t)=e−Ltu(0),(5)u(t)=e^{-Lt}u(0), \tag*{(5)}

where K=e−LtK=e^{-Lt} is the heat kernel of G\mathcal{G}, which will take center stage in the investigations below, and u(0)u(0) is the initial condition.

The paper [33] constructs vertex-based signatures by fitting an ansatz of the form

K(i,i,t)≈1tds/2∑k=0Nuk(i)tk,(6)K(i,i,t)\approx\frac{1}{t^{d_s/2}}\sum_{k=0}^{N}u_k(i)t^k, \tag*{(6)}

to the heat kernel on a finite interval [0,T][0,T]. Here, the matrix heat kernel at each time t∈[0,T]t\in[0,T] is obtained by the eigendecomposition K(t)=e−Lt=Ve−ΛtV−1K(t)=e^{-Lt}=Ve^{-\Lambda t}V^{-1} where Λ\Lambda is a diagonal matrix of the eigenvalues of the Laplacian λ1,λ2,…,λn\lambda_1,\lambda_2,\ldots,\lambda_n and VV is the matrix whose columns are the eigenvectors of LL. To each node ii the tuple of coefficients (uk(i))k=1N(u_k(i))_{k=1}^{N} is attributed to obtain a partition of the graph by grouping nodes based on (rounded) equality of these tuples.

This algorithm offers a vivid geometric picture of the nodes in a graph “perturbing” a latent space in which the graph is embedded (see Figure 1 of [33]). One might imagine that discovering curvature information of that latent manifold might help partition the graph into “similarly behaving nodes", thus motivating the formulation (6). A natural question then is: do the above signatures match the true orbit partition of a graph? How much information can we extract from this intuitive picture?

The route to attempting to answer this question starts by noting the shortcomings of the above approach. First, assuming that an ansatz of the form (6) holds, the dimension of a graph G\mathcal{G} is not a particularly well-defined notion. In [33], the authors make use of the spectral dimension dsd_s, as a drop-in substitute for the dimension of the manifold in the continuous setting. The spectral dimension is obtained by linear regressing on the log-log graph of

ρ(λ′<λ)∼λds/2,(7)\rho(\lambda' < \lambda)\sim\lambda^{d_s/2}, \tag*{(7)}

for λ→0\lambda\to0. It is a particularly suitable notion for lattice, fractal, and power-law/scale-free graphs [40], due to the structure of the small eigenvalues of their Laplacians. For other graph classes, the small eigenvalue regime might be sparse or might not obey a power law of the form (7), which drives the subdivision process that [33] adopts, leading to a growth in graph size, which became prohibitive. Even then, the notion of the spectral dimension is not presently rigorous, especially as to what counts as “λ→0\lambda\to0” and arbitrariness in the choice of the interval to fit on, and it appeared difficult to find a rigorous justification without developing a substantial theory. More importantly, the ansatz (6) is not rigorously justified in the graph setting. One can notice that for ds>0d_s>0 and u0(i)≠0u_0(i) \ne0, the above expansion 1tds/2∑k=0Nuk(i)tk\frac{1}{t^{d s/2}}\sum_{k=0}^{N}u_k(i)t^k goes to ±∞\pm\infty as t→0t \to0. However, the graph kernel behaves differently: at t=0t=0,

K(x,y,t)={1if x=y,0if x≠y,(8)K(x,y,t)= \begin{cases} 1 & \text{if } x=y,\\ 0 & \text{if } x\ne y, \end{cases} \tag*{(8)}

which is not captured in the above expansion. Additionally, we remark on the difference in the evolution of the heat kernel on manifold and on a graph. In particular, the Minakshisundaram-Pleijel expansion gives that the short-time asymptotic on a manifold is

lim⁡t→0+tlog⁡K(x,y,t)=−dg(x,y)22,(9)\lim_{t\to0^+} t\log K(x,y,t)=-\frac{d_g(x,y)^2}{2}, \tag*{(9)}

whereas, on a graph setting, Keller, Lenz, Münch, Schmidt, & Telcs [41] and Steinerberger [42] prove considerably different short-time behavior, captured by

lim⁡t→0+log⁡K(x,y,t)log⁡t=d(x,y).(10)\lim_{t\to0^+}\frac{\log K(x,y,t)}{\log t}=d(x,y). \tag*{(10)}

Further, the presence of the log⁡t\log t term in the denominator indicates a mismatch between the two equations and implies that the graph kernel should not include a time-dependent exponential factor. All of the above shortcomings inform the move to using the diagonal values of the heat kernel directly as signatures, that is, we endow the node ii with the signature

sig⁡(i)={K(i,i,t):t=0,Δt,2Δt,…,T},(11)\operatorname{sig}(i)=\{K(i,i,t):t=0,\Delta t,2\Delta t,\ldots,T\}, \tag*{(11)}

for a chosen time step Δt\Delta t and suitable large end-time TT. We treat the signature as a set (or a lexicographically sorted array), so as to have automorphism-invariant vertex signatures, removing the effect of labeling.

This is the concrete starting point of the investigation. The following discussion will aim to progressively find counterexamples to the proposed algorithms to obtain stronger and stronger signatures. First, signatures of the form (11) do not distinguish the orbits of the Frucht graph, which possesses only a trivial automorphism (all nodes are in separate orbits), shown in Figure 1. The above signatures merge nodes 1 and 10 into the same equivalence class, since they have the same heat kernel diagonal for all time. We prove this in Section “Counterexamples” of the Appendix in a computer-assisted Cayley-Hamilton-based argument. The mechanism of the proof follows from the observation that the heat kernel is represented mathematically by the matrix

G-signatures from $K(i,i,t)$ and $K(i,:,t)$

Figure 1. Frucht was not resolved using the diagonal of K(i,i,t)K(i,i,t), which merged nodes 1 and 10 into one equivalence class, while the full rows K(i,:,t)K(i,:,t) resolved the orbits and identified the nodes as singletons.

e−Lt=∑k=0∞(−1)ktkk!Lk=I−tL+t22L2−t33!L3+⋯ .(12)e^{-Lt}=\sum_{k=0}^{\infty}\frac{(-1)^k t^k}{k!}L^k=I-tL+\frac{t^2}{2}L^2-\frac{t^3}{3!}L^3+\cdots. \tag*{(12)}

This infinite sum cannot be evaluated (computationally) without truncation or approximation. However, by the Cayley-Hamilton theorem, every power LkL^k with k≥nk\ge n (the size of the matrix) can be expressed as a linear combination of I,L,…,Ln−1I,L,\ldots,L^{n-1}, with coefficients depending on kk and LL. Consequently, for each time tt, the matrix exponential admits the exact representation

e−Lt=∑j=0n−1αj(t)Lj,(13)e^{-Lt}=\sum_{j=0}^{n-1}\alpha_j(t)L^j, \tag*{(13)}

where the coefficients αj(t)\alpha_j(t) depend on tt and LL. The diagonal algorithm only captures the values (e−Lt)ii(e^{-Lt})_{ii}, which represent solely the probability of a random walker that start at node ii to return to it at time tt. We prove in the appendix that for the Frucht graph (e−Lt)1,1=(e−Lt)10,10(e^{-Lt})_{1,1}=(e^{-Lt})_{10,10}, justifying their indistinguishability from the information only on the diagonal.

However, there is much more information in the heat kernel that is not captured in the diagonal, involving walks that start and end at different nodes. Najem and Mouawad [33] were cognizant of the presence of this information in the off-diagonal terms of the expansion. Nevertheless, they did not draw on it for the following reason: if the ansatz is adopted analogously with the Riemannian setting (1), then for i≠ji \ne j the kernel has a dependence on dd through ∝e−d(i,j)2/4t\propto e^{-d(i,j)^2/4t}. Then if the standard graph distance is used, and, for the reasons we delineated above, which include subdivision, size growth, and a contrived spectral dimension, to list a few of them, it is not an adequate expansion for graphs. Otherwise, if the analogy with the latent manifold is pushed, with the latter’s distance measure is unknown, then a nonlinear least-squares problem has to be solved that requires fitting for uk(i,j)u_k(i,j) and d(i,j)d(i,j) simultaneously. The two parameter sets are coupled making their simultaneous estimation hard and ill-posed, in addition to being an evident source of error for a problem that is precision-critical. Hence, a way to circumvent the shortcoming of the diagonal and the fit using the off-diagonal elements is to shift to the full row element, in the form of the signatures

sig⁡(i)={K(i,j,t):j=1,…,n; t=0,Δt,2Δt,…,T}.(14)\operatorname{sig}(i)=\{K(i,j,t):j=1,\ldots,n;\ t=0,\Delta t,2\Delta t,\ldots,T\}. \tag*{(14)}

Some information is lost in just looking at the values as a set (or as a lexicographically sorted array). We can retain more information by sorting the rows in a BFS-aware manner and preserving the temporal order, as such

References

  1. [1]Landau, L. The theory of phase transitions. Nature 138, 840–841 (1936).DOI
  2. [2]Chaikin, P. M., Lubensky, T. C. & Witten, T. A. Principles of condensed matter physics (Cambridge university press, Cambridge, 1995).
  3. [3]Goldenfeld, N. Lectures on phase transitions and the renormalization group (CRC Press, 2018).DOI
  4. [4]Nishimori, H., Ortiz, G. & Nishimori, H. Elements of phase transitions and critical phenomena (2011).
  5. [5]Stanley, H. E. & Ahlers, G. Introduction to phase transitions and critical phenomena 1973.
  6. [6]Kardar, M. Statistical physics of fields (Cambridge University Press, 2007).
  7. [7]Domb, C. Phase transitions and critical phenomena (Elsevier, 2000).
  8. [8]Fisher, M. E. The renormalization group in the theory of critical behavior. Reviews of Modern Physics 46, 597 (1974).DOI
  9. [9]Stanley, H. E. Scaling, universality, and renormalization: Three pillars of modern critical phenomena. Reviews of modern physics 71, S358 (1999).
  10. [10]Tang, Y., Shi, D. & Lü, L. Optimizing higher-order network topology for synchronization of coupled phase oscillators. Communications Physics 5, 96 (2022).arxiv.org/abs/2108.11200
  11. [11]Pecora, L. M., Sorrentino, F., Hagerstrom, A. M., Murphy, T. E. & Roy, R. Cluster synchronization and isolated desynchronization in complex networks with symmetries. Nature communications 5, 4079 (2014).DOI
  12. [12]Sánchez-García, R. J. Exploiting symmetry in network analysis. Communications Physics 3, 87 (2020).DOI
  13. [13]Bayani, A. et al. The transition to synchronization of networked systems. Nature Communications 15, 4955 (2024).arxiv.org/abs/2303.08668
  14. [14]Battiston, F. et al. Collective dynamics on higher-order networks. Nature Reviews Physics 8, 146–159 (2026).DOI
  15. [15]Xiao, Y., Xiong, M., Wang, W. & Wang, H. Emergence of symmetry in complex networks. Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 77, 066108 (2008).DOI
  16. [16]Nishikawa, T. & Motter, A. E. Network-complement transitions, symmetries, and cluster synchronization. Chaos: An Interdisciplinary Journal of Nonlinear Science 26 (2016).DOI
  17. [17]MacArthur, B. D., Sánchez-García, R. J. & Anderson, J. W. Symmetry in complex networks. Discrete Applied Mathematics 156, 3525–3531 (2008).
  18. [18]Tononi, G., Sporns, O. & Edelman, G. M. Measures of degeneracy and redundancy in biological networks. Proceedings of the National Academy of Sciences 96, 3257–3262 (1999).pubmed.ncbi.nlm.nih.gov/10077671
  19. [19]MacArthur, B. D. & Sánchez-García, R. J. Spectral characteristics of network redundancy. Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 80, 026117 (2009).DOI
  20. [20]Ward, J. A., Tapper, A., Simon, P. L. & Mann, R. P. Micro-scale foundation with error quantification for the approximation of dynamics on networks. Communications Physics 5, 71 (2022).DOI
  21. [21]McKay, B. D. & Piperno, A. Practical Graph Isomorphism, II. Journal of Symbolic Computation 60, 94–112 (2014).arxiv.org/abs/1301.1493
  22. [22]Babai, L. Graph Isomorphism in Quasipolynomial Time in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC ’16) (2016), 684–697.arxiv.org/abs/1512.03547
  23. [23]Grohe, M. & Schweitzer, P. The Graph Isomorphism Problem. Communications of the ACM 63, 128–134 (2020).
  24. [24]Grohe, M. & Neuen, D. in Surveys in Combinatorics 2021 187–234 (Cambridge University Press, 2021).
  25. [25]Kiefer, S. The Weisfeiler–Leman Algorithm: An Exploration of Its Power. ACM SIGLOG News 7, 5–27 (2020).
  26. [26]Cai, J.-Y., Fürer, M. & Immerman, N. An Optimal Lower Bound on the Number of Variables for Graph Identification. Combinatorica 12, 389–410 (1992).
  27. [27]Merris, R. Laplacian Matrices of Graphs: A Survey. Linear Algebra and its Applications 197–198, 143–176 (1994).DOI
  28. [28]Van Dam, E. R. & Haemers, W. H. Which Graphs Are Determined by Their Spectrum? Linear Algebra and its Applications 373, 241–272 (2003).
  29. [29]Kempton, M., Sinkovic, J., Smith, D. & Webb, B. Characterizing Cospectral Vertices via Isospectral Reduction. Linear Algebra and its Applications 594, 226–248 (2020).arxiv.org/abs/1906.07705
  30. [30]Sun, J., Ovsjanikov, M. & Guibas, L. A Concise and Provably Informative Multi-Scale Signature Based on Heat Diffusion. Computer Graphics Forum 28, 1383–1392 (2009).DOI
  31. [31]Raviv, D., Kimmel, R. & Bruckstein, A. M. Graph Isomorphisms and Automorphisms via Spectral Signatures. IEEE Transactions on Pattern Analysis and Machine Intelligence 35, 1985–1993 (2013).DOI
  32. [32]Masuda, N., Porter, M. A. & Lambiotte, R. Random Walks and Diffusion on Networks. Physics Reports 716–717, 1–58 (2017).DOI
  33. [33]Najem, S. & Mouawad, A. E. Finding graph isomorphisms in heated spaces in almost no time. arXiv preprint arXiv:2601.03787 (2026).arxiv.org/abs/2601.03787
  34. [34]De C. Loures, M., Piovesana, A. A. & Brum, J. A. Laplacian Coarse Graining in Complex Networks 2023. arXiv: 2302. 07093 [cond-mat.dis-nn]. https://arxiv.org/abs/2302. 07093.
  35. [35]Bianconi, G. The topological Dirac equation of networks and simplicial complexes. Journal of Physics: Complexity 2, 035022. ISSN: 2632-072X. http://dx.doi.org/10.1088/2632-072X/ac19be (2021).
  36. [36]Chavel, I., Randol, B. & Dodziuk, J. Eigenvalues in Riemannian Geometry ISBN: 9780080874340 (Academic Press, 1984).
  37. [37]Gilkey, P. B. Asymptotic formulae in spectral geometry (CRC press, 2003).DOI
  38. [38]Minakshisundaram, S. & Pleijel, Å. Some Properties of the Eigenfunctions of The Laplace-Operator on Riemannian Manifolds. Canadian Journal of Mathematics 1, 242–256 (1949).DOI
  39. [39]Suleymanova, A. On the spectral geometry of manifolds with conic singularities PhD thesis (Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2017).arxiv.org/abs/1710.05355
  40. [40]Torres, J. J. & Bianconi, G. Simplicial complexes: higher-order spectral dimension and dynamics. Journal of Physics: Complexity 1, 015002 (2020).DOI
  41. [41]Keller, M., Lenz, D., Münch, F., Schmidt, M. & Telcs, A. Note on short-time behavior of semigroups associated to self-adjoint operators. Bulletin of the London Mathematical Society, bdw054 (2016).DOI
  42. [42]Steinerberger, S. Varadhan asymptotics for the heat kernel on finite graphs. arXiv preprint arXiv:1801.02183 (2018).arxiv.org/abs/1801.02183
  43. [43]Cheeger, J., Ebin, D. G. & Ebin, D. G. Comparison theorems in Riemannian geometry (North-Holland, Amsterdam, 1975).
  44. [44]McKay, B. D. & Piperno, A. Libraries of benchmark graphs https://pallini.di.uniroma1.it/Graphs.html. Accessed: 2026-10-13.
  45. [45]Arora, S., Glück, J. & Mui, J. Eventual Positivity Lecture notes for the 29th Internet Seminar. Winter term 2025/26. 2025. https://fan.uni-wuppertal.de/fileadmin/mathe/reine_mathematik/funktionalanalysis/glueck/Sonstiges/2025-10_ISEM29/lecture_notes/ISem_29__Up_to_Chapter_14.pdf.
  46. [46]Immerman, N. & Sengupta, R. The k-Dimensional Weisfeiler–Leman Algorithm 2019. arXiv: 1907.09582 [cs.CC]. https://arxiv.org/abs/1907.09582.
  47. [47]Berkholz, C., Bonsma, P. & Grohe, M. Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. Theory of Computing Systems 60, 581–614 (2017).arxiv.org/abs/1509.08251

Paper details

vlnc:W_7g24yef2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents