Three conjectures of Ostrander on digraph Laplacian eigenvectors
From MaRDI portal
Publication:5888904
DOI10.26493/2590-9770.1420.b57OpenAlexW3181290837WikidataQ122972284 ScholiaQ122972284MaRDI QIDQ5888904
Publication date: 25 April 2023
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/2590-9770.1420.b57
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstruction of eigenfunctions of a \(q\)-ary \(n\)-dimensional hypercube
- A short remark on the surjectivity of the combinatorial Laplacian on infinite graphs
- Characterisations of algebraic properties of groups in terms of harmonic functions
- The surjectivity of the combinatorial Laplacian on infinite graphs
- Modeling, estimation and control. Festschrift in honor of Giorgio Picci on the occasion of his sixty-fifth birthday. Papers presented at the symposium, Venice, Italy, October 4--5, 2007.
- Periodic harmonic functions on lattices and points count in positive characteristic
- Perron eigenvectors and the symmetric transportation polytope
- The existence of nonconstant harmonic functions on infinite vertex-symmetric graphs
- Fundamentals of spreading processes in single and multilayer complex networks
- Random walks and diffusion on networks
- Nodal decompositions of graphs
- On multi-consensus and almost equitable graph partitions
- Discrepancy minimizing spectral clustering
- A combinatorial proof of a formula of Biane and Chapuy
- Wave equations for graphs and the edge-based Laplacian
- On the spectra of nonsymmetric Laplacian matrices
- A proof of the Markov chain tree theorem
- Discrete Green's functions and random walks on graphs
- Riesz decompositions for Schrödinger operators on graphs
- Counting trees with random walks
- Graph Laplace and Markov operators on a measure space
- Laplacian matrices and spanning trees of tree graphs
- Flows on measurable spaces
- Magnetic-sparseness and Schrödinger operators on graphs
- On the graph Laplacian and the rankability of data
- Diffusion operator and spectral analysis for directed hypergraph Laplacian
- Diffusion and consensus on weakly connected directed graphs
- Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition
- Laplacian matrices and Alexandrov topologies of digraphs
- Sign-changing diagonal perturbations of Laplacian matrices of graphs
- On the diffusion geometry of graph Laplacians and applications
- Schur reduction of trees and extremal entries of the Fiedler vector
- Laplacian dynamics on general graphs
- Kernels of directed graph Laplacians
- Handbook of Linear Algebra
- Energy Minimization of Repelling Particles on a Toric Grid
- The Garden of Eden theorem for linear cellular automata
- Properties of first eigenvectors and eigenvalues of nonsingular weighted directed graphs
- The Decomposition-Separation Theorem for Finite Nonhomogeneous Markov Chains and Related Problems
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- Infinite weighted graphs with bounded resistance metric
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis
- Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
- Graphs and Geometry
- A Hitting Time Formula for the Discrete Green's Function
- Optimal Assignments of Numbers to Vertices
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs
This page was built for publication: Three conjectures of Ostrander on digraph Laplacian eigenvectors
