Three conjectures of Ostrander on digraph Laplacian eigenvectors
From MaRDI portal
(Redirected from Publication:5888904)
Recommendations
Cites work
- A combinatorial proof of a formula of Biane and Chapuy
- A hitting time formula for the discrete Green's function
- A proof of the Markov chain tree theorem
- A short remark on the surjectivity of the combinatorial Laplacian on infinite graphs
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs
- Characterisations of algebraic properties of groups in terms of harmonic functions
- Counting trees with random walks
- Cubature formulas, geometrical designs, reproducing kernels, and Markov operators
- Diffusion and consensus on weakly connected directed graphs
- Diffusion operator and spectral analysis for directed hypergraph Laplacian
- Discrepancy minimizing spectral clustering
- Discrete geometric analysis
- Discrete Green's functions and random walks on graphs
- Energy minimization of repelling particles on a toric grid
- Flows on measurable spaces
- Fundamentals of spreading processes in single and multilayer complex networks
- Graph Laplace and Markov operators on a measure space
- Graphs and geometry
- Handbook of linear algebra
- scientific article; zbMATH DE number 6101020 (Why is no real title available?)
- scientific article; zbMATH DE number 1234397 (Why is no real title available?)
- scientific article; zbMATH DE number 691513 (Why is no real title available?)
- scientific article; zbMATH DE number 7055828 (Why is no real title available?)
- Infinite weighted graphs with bounded resistance metric
- Kernels of directed graph Laplacians
- Laplacian dynamics on general graphs
- Laplacian matrices and Alexandrov topologies of digraphs
- Laplacian matrices and spanning trees of tree graphs
- Magnetic-sparseness and Schrödinger operators on graphs
- Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition
- 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.
- Nodal decompositions of graphs
- On multi-consensus and almost equitable graph partitions
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- On the diffusion geometry of graph Laplacians and applications
- On the graph Laplacian and the rankability of data
- On the spectra of nonsymmetric Laplacian matrices
- Optimal Assignments of Numbers to Vertices
- Periodic harmonic functions on lattices and points count in positive characteristic
- Perron eigenvectors and the symmetric transportation polytope
- Properties of first eigenvectors and eigenvalues of nonsingular weighted directed graphs
- Random walks and diffusion on networks
- Reconstruction of eigenfunctions of a \(q\)-ary \(n\)-dimensional hypercube
- Riesz decompositions for Schrödinger operators on graphs
- Schur reduction of trees and extremal entries of the Fiedler vector
- Sharp bounds on random walk eigenvalues via spectral embedding
- Sign-changing diagonal perturbations of Laplacian matrices of graphs
- The Decomposition-Separation Theorem for Finite Nonhomogeneous Markov Chains and Related Problems
- The deformed graph Laplacian and its applications to network centrality analysis
- The existence of nonconstant harmonic functions on infinite vertex-symmetric graphs
- The Garden of Eden theorem for linear cellular automata
- The surjectivity of the combinatorial Laplacian on infinite graphs
- Wave equations for graphs and the edge-based Laplacian
This page was built for publication: Three conjectures of Ostrander on digraph Laplacian eigenvectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5888904)
