Related papers: Up and down grover walks on simplicial complexes

We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…

The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial complexes is…

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

We propose a new model of self-organized criticality. A particle is dropped at random on a lattice and moves along directions specified by arrows at each site. As it moves, it changes the direction of the arrows according to fixed rules. On…

This article introduces classes of normal and unitary operators on smooth Banach spaces, providing extensions of the classical notions of normal and unitary operators from Hilbert spaces to the smooth Banach space setting. The proposed…

The geometric theory of pseudo-differential and Fourier Integral Operators relies on the symplectic structure of cotangent bundles. If one is to study calculi with some specific feature adapted to a geometric situation, the corresponding…

Joint spectra of tuples of operators are subsets in complex projective space. The corresponding tuple of operators can be viewed as an infinite dimensional analog of a determinantal representation of the joint spectrum. We investigate the…

In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…

Here we introduce connectivity operators, namely, diffusion operators, general Laplacian operators, and general adjacency operators for hypergraphs. These operators are generalisations of some conventional notions of apparently different…

The symmetric group on a set acts transitively on its subsets of a given size. We define homomorphisms between the corresponding permutation modules, defined over a field of characteristic two, which generalize the boundary maps from…

In distributed systems, knowledge of the network structure of the connections among the unitary components is often a requirement for an accurate prediction of the emerging collective dynamics. However, in many real-world situations, one…

We discuss walking behavior in gauge theories and weak first-order phase transitions in statistical physics. Despite appearing in very different systems (QCD below the conformal window, the Potts model, deconfined criticality) these two…

We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.

We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that…

We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…

We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…

Let G be a finite connected simple graph. We define the moduli space of conformal structures on G. We propose a definition of conformally covariant operators on graphs, motivated by [25]. We provide examples of conformally covariant…

We present a general account on the stationary scattering theory for unitary operators in a two-Hilbert spaces setting. For unitary operators $U_0,U$ in Hilbert spaces ${\cal H}_0,{\cal H}$ and for an identification operator $J:{\cal…

Quantum walks, the quantum counterpart of classical random walks, are extensively studied for their applications in mathematics, quantum physics, and quantum information science. This study explores the periods and absolute zeta functions…

Theoretical development and applications of graph signal processing (GSP) have attracted much attention. In classical GSP, the underlying structures are restricted in terms of dimensionality. A graph is a combinatorial object that models…