相关论文: Laplacian Fractional Revival on Graphs

In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…

Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…

We study the Laplacian on family preserving metric graphs. These are graphs that have a certain symmetry that, as we show, allows for a decomposition into a direct sum of one-dimensional operators whose properties are explicitly related to…

This paper tackles the challenging problem of jointly inferring time-varying network topologies and imputing missing data from partially observed graph signals. We propose a unified non-convex optimization framework to simultaneously…

We demonstrate a quantum walk with time-dependent coin bias. With this technique we realize an experimental single-photon one-dimensional quantum walk with a linearly-ramped time-dependent coin flip operation and thereby demonstrate two…

We show that the hitting time of the discrete quantum walk on a symmetric Cayley graph over $\Z_2^n $ from a vertex to its antipodal is polynomial in degree of the graph. We prove that returning time of quantum walk on a symmetric Cayley…

For a connected weighted hypergraph, we give a randomized almost-linear-time solver for the Poisson problem for the cut-based hypergraph Laplacian in the natural input size $P=\sum_{e\in E}|e|$, the sum of hyperedge sizes. For every fixed…

The evolution of spin network states in loop quantum gravity can be described by introducing a time variable, defined by the surfaces of constant value of an auxiliary scalar field. We regulate the Hamiltonian, generating such an evolution,…

We consider weighted, directed graphs with a notion of absorption on the vertices, related to absorbing random walks on graphs. We define a generalized inverse of the graph Laplacian, called the absorption inverse, that reflects both the…

We define the Laplacian matrix and the Jacobian group of a finite graph of groups. We prove analogues of the matrix tree theorem and the class number formula for the order of the Jacobian of a graph of groups. Given a group $G$ acting on a…

Most renormalizable quantum field theories can be rephrased in terms of Feynman diagrams that only contain dressed irreducible 2-, 3-, and 4-point vertices. These irreducible vertices in turn can be solved from equations that also only…

We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…

Let $\grad$, $\curl$, and $\dv$ be the graph-theoretic analogues of the gradient, curl, and divergence operators from multivariate calculus. The graph Laplacian $-\dv \grad$ gives rise to the celebrated Laplacian matrix, while the matrix…

We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (i, j), if i is connected to j then there is a path from j to i. We show that reversibility is a necessary and…

There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…

Returning walks on a lattice are sequences of moves that start at a given lattice site and return to the same site after $n$ steps. Determining the total number of returning walks of a given length $n$ is a typical graph-theoretical problem…

A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. In this article, Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles…

In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…