Related papers: Delocalization of uniform graph homomorphisms from…
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…
It is known that up to certain pathologies, a compact metric graph with standard vertex conditions has a Baire-generic set of choices of edge lengths such that all Laplacian eigenvalues are simple and have eigenfunctions that do not vanish…
We prove a variant of the Arithmetic Fundamental Lemma conjecture of Wei Zhang for n=2. More precisely, we consider the deformation lengths of certain quasi-homomorphisms of quasi-canonical lifts in the sense of Gross. We prove the…
We study 't Hooft anomalies of global symmetries in 1+1d lattice Hamiltonian systems. We consider anomalies in internal and lattice translation symmetries. We derive a microscopic formula for the "anomaly cocycle" using topological defects…
Consider the matrix $A_{\mathcal{G}}$ chosen uniformly at random from the finite set of all $N$-dimensional matrices of zero main-diagonal and binary entries, having each row and column of $A_{\mathcal{G}}$ sum to $d$. That is, the…
Chaotic dependence on temperature refers to the phenomenon of divergence of Gibbs measures as the temperature approaches a certain value. Models with chaotic behaviour near zero temperature have multiple ground states, none of which are…
We study surfaces in Euclidean space constructed by the sum of two curves or that are graphs of the product of two functions. We consider the problem to determine all these surfaces with constant Gauss curvature. We extend the results to…
Dimensionality effects pose major challenges in high-dimensional and non-Euclidean data analysis. Graph-based two-sample tests and change-point detection are particularly attractive in this context, as they make minimal distributional…
Off-diagonal disorder with random hopping between the sublattices of a bipartite lattice is described by a Hamiltonian which has chiral (sub-lattice) symmetry. The energy spectrum is symmetric around E=0 and for odd total number of lattice…
I formulate a deformation of the dimensional-regularization technique that is useful for theories where the common dimensional regularization does not apply. The Dirac algebra is not dimensionally continued, to avoid inconsistencies with…
Graph homomorphism has been an important research topic since its introduction [17]. Stated in the language of binary relational structures in that paper [17], Lov\'asz proved a fundamental theorem that, for a graph $H$ given by its $0$-$1$…
We study the interplay between the classical theory of linear series on curves, and the recent theory of linear series on graphs. We prove that every d-gonal (weighted) graph of Hurwitz type is the dual graph of a d-gonal curve. Conversely…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
We prove that certain Gibbs measures on subshifts of finite type are nonsingular and ergodic for certain countable equivalence relations, including the orbit relation of the adic transformation (the same as equality after a permutation of…
We present a powerful method for calculating the thermodynamic properties of the Hubbard model in infinite dimensions, using an exact diagonalization of an Anderson model with a finite number of sites. At finite temperatures, the explicit…
We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…
Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…
We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly…
We prove delocalization of eigenvectors of vertex-transitive graphs via elementary estimates of the spectral projector. We recover in this way known results which were formerly proved using representation theory. Similar techniques show…