相关论文: Transitive regular $q$-analogs of graphs
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In…
Vertex-stabilizers of trivalent edge-transitive graphs have been classified by Tutte, Goldschmidt and some others in several previous papers. Tetravalent half-arc-transitive graphs form an important class of tetravalent edge-transitive…
We examine from an invariant theory viewpoint the monoid algebras for two monoids having large symmetry groups. The first monoid is the free left-regular band on $n$ letters, defined on the set of all injective words, that is, the words…
Sampling from the stationary distribution is one of the fundamental tasks of Markov chain-based algorithms and has important applications in machine learning, combinatorial optimization and network science. For the quantum case, qsampling…
We tackle the problem of attributed graph transformations and propose a new algorithmic approach for defining parallel graph transformations allowing overlaps. We start by introducing some abstract operations over graph structures. Then, we…
We introduce interpolation analogues of Schur Q-functions - the multiparameter Schur Q-functions. We obtain for them several results: a combinatorial formula, generating functions for one-row and two-rows functions, vanishing and…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
Directed q-analysis is a recent extension of q-analysis, an established method for extracting structure from networks, to directed graphs. Until recently, a lack of efficient algorithms heavily restricted the application of this technique:…
In this paper, we consider the Carlitz's type q-analogue of Changhee numbers and polynomials and we give some explicit formulae for these numbers and polynomials.
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\e and G/e is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his dissertation. However, his proof is so long that only a small…
The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and adding a new edge between two new vertices which lie on adjacent edges of $G$. In this…
A q-analogue of de Finetti's theorem is obtained in terms of a boundary problem for the q-Pascal graph. For q a power of prime this leads to a characterisation of random spaces over the Galois field F_q that are invariant under the natural…
We give a characterization of the line digraph of a regular digraph. We make use of the characterization, to show that the underlying digraph of a coined quantum random walk is a line digraph. We remark the connection between line digraphs…
As a natural generalization of ordinary Lie algebras we introduce the concept of quantum Lie algebras ${\cal L}_q(g)$. We define these in terms of certain adjoint submodules of quantized enveloping algebras $U_q(g)$ endowed with a quantum…
Catalan-Daehee numbers and polynomials, generating functions of which can be expressed as p-adic Volkenborn integrals on Zp, were studied previously. The aim of this paper is to introduce q-analogues of the catalan-Daehee numbers and…
Many common machine learning methods involve the geometric annealing path, a sequence of intermediate densities between two distributions of interest constructed using the geometric average. While alternatives such as the moment-averaging…
Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties correspond to different norms to measure this distance. For dense…
For quantum computer circuits, it is proposed that they have, besides the presently used compact graphs, an expanded system of subgraphs, in line with the quantum mechanics superposition axiom. The representation of each process by these…