Related papers: Iwasawa theory for weighted graphs

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…

A 3d generally covariant field theory having some unusual properties is described. The theory has a degenerate 3-metric which effectively makes it a 2d field theory in disguise. For 2-manifolds without boundary, it has an infinite number of…

We study an analogue of the Herbrand-Ribet theorem, and its refinement by Mazur and Wiles, in graph theory. For an odd prime number $p$, we let $\mathbb{F}_{p}$ and $\mathbb{Z}_{p}$ denote the finite field with $p$ elements and the ring of…

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

We analyze a general model of weighted graphs, introduced by de Panafieu and Ravelomanana (2014) and similar to the "inhomogeneous graph model" of S\"oderberg (2002). Each vertex receives a "type" among a set of $q$ possibilities as well as…

A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009)]. We present a version based instead on the discrete time…

Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let $G$ be a weighted graph with $n$ vertices. In the most general setting, the $n$ vertices are known and no other information about $G$…

Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…

We construct a new class of Iwasawa modules, which are the number field analogues of the p-adic realizations of the Picard 1-motives constructed by Deligne in the 1970s and studied extensively from a Galois module structure point of view in…

Berry and Wang [Phys. Rev. A {\bf 83}, 042317 (2011)] show numerically that a discrete-time quantum random walk of two noninteracting particles is able to distinguish some non-isomorphic strongly regular graphs from the same family. Here we…

We present a category theoretical generalization of the Goussarov theorem for finite type invariants, relating generating sets for generalized finite type theories with diagrams systems for the corresponding topological objects. We will…

This survey paper is focused on a connection between the geometry of $\mathrm{GL}_d$ and the arithmetic of $\mathrm{GL}_{d-1}$ over global fields, for integers $d \ge 2$. For $d = 2$ over $\mathbb{Q}$, there is an explicit conjecture of the…

We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…

Recently, Asao and Izumihara introduced CW-complexes whose homology groups are isomorphic to direct summands of the graph magnitude homology group. In this paper, we study the homotopy type of the CW-complexes in connection with the…

We prove a general stability theorem for $p$-class groups of number fields along relative cyclic extensions of degree $p^2$, which is a generalization of a finite-extension version of Fukuda's theorem by Li, Ouyang, Xu and Zhang. As an…

We present a comprehensive study of the geometry of Hilbert $p$-adic eigenvarieties at classical parallel weight one intersection points of their cuspidal and Eisenstein loci. For instance, we determine all such points at which the weight…

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…