Related papers: Edge Laplacians and Edge Poisson Transforms for Gr…
We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim…
We propose a novel dynamic network model to capture evolving latent communities within temporal networks. To achieve this, we decompose each observed dynamic edge between vertices using a Poisson-gamma edge partition model, assigning each…
Substituting each edge of a simple connected graph $G$ by a path of length 1 and $k$ paths of length 5 generates the $k$-hexagonal graph $H^k(G)$. Iterative graph $H^k_n(G)$ is produced when the preceding constructions are repeated $n$…
Given a finite simple graph $\cG$ with $n$ vertices, we can construct the Cayley graph on the symmetric group $S_n$ generated by the edges of $\cG$, interpreted as transpositions. We show that, if $\cG$ is complete multipartite, the…
We analyze geometry of the second order differential operators, having in mind applications to Batalin--Vilkovisky formalism in quantum field theory. As we show, an exhaustive picture can be obtained by considering pencils of differential…
We give a new and self-contained proof of a generic version of the (former) Helgason conjecture. It says that for generic spectral parameters the Poisson transform is a topological isomorphism, with the inverse given by a boundary value…
Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for the Hodge Laplacian -- the generalization of the graph…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
The spectral properties of the Laplacian operator on ``small-world'' lattices, that is mixtures of unidimensional chains and random graphs structures are investigated numerically and analytically. A transfer matrix formalism including a…
We develop a geometric approach to Poisson electrodynamics, that is, the semi-classical limit of noncommutative $U(1)$ gauge theory. Our framework is based on an integrating symplectic groupoid for the underlying Poisson brackets, which we…
We give the detale description from various points of view of Pascal automorphism,--- a natural transformation of the space of paths in the Pascal graph (= infinite Pascal triangle), and describetha plan of the proof of continuiuty of its…
This paper is a sequel to the work of Bhattacharjya et al.\ (J. Phys. A-Math. 57.33: 335303, https://doi.org/10.1088/1751-8121/ad6653) on quantum state transfer on blow-up graphs, where instead of the adjacency matrix, we take the Laplacian…
We define a number of natural (from geometric and combinatorial points of view) deformation spaces of valuations on finite graphs, and study functions over these deformation spaces. These functions include both direct metric invariants…
In the present article magnetic Laplacians on a graph are analyzed. We provide a complete description of the set of all operators which can be obtained from a given self-adjoint Laplacian by perturbing it by magnetic fields. In particular,…
We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…
We formulate a Euclidean theory of edge length dynamics based on a notion of Ricci curvature on graphs with variable edge lengths. In order to write an explicit form for the discrete analog of the Einstein-Hilbert action, we require that…
We study diffusions, variational principles and associated boundary value problems on directed graphs with natural weightings. Using random walks and exit times, we associate to certain subgraphs (domains) a pair of sequences, each of which…
We prove spectral localization for infinite metric graphs with a self-adjoint Laplace operator and a random potential. To do so we adapt the multiscale analysis (MSA) from the R^d-case to metric graphs. In the MSA a covering of the graph is…
We investigate properties of spectrum of normalized Laplacian $\mathcal L$ for finite graphs over non-Archimedean ordered fields. We prove a Cheeger's inequality for first non-zero eigenvalue. Then we describe properties of the operator…