Laplacians and the Cheeger inequality for directed graphs
From MaRDI portal
Publication:1773876
DOI10.1007/s00026-005-0237-zzbMath1059.05070OpenAlexW2069992656MaRDI QIDQ1773876
Publication date: 28 April 2005
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-005-0237-z
Discrete-time Markov processes on general state spaces (60J05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Directed graphs (digraphs), tournaments (05C20)
Related Items
Markov chains on finite fields with deterministic jumps, Dynamic graph models and their properties, Exploring the heterogeneity for node importance byvon Neumann entropy, Cheeger Inequalities for General Edge-Weighted Directed Graphs, Random rigidity in the free group., Spectral bounds of directed Cayley graphs of finite groups, Finding Cheeger cuts in hypergraphs via heat equation, Adaptive directional Haar tight framelets on bounded domains for digraph signal representations, On the graph Laplacian and the rankability of data, Analysis and stability of consensus in networked control systems, Representation of functions on big data associated with directed graphs, Magnetic eigenmaps for the visualization of directed networks, A generalized inverse for graphs with absorption, Uniform upper bound of the second largest eigenvalue of stochastic matrices with equal-neighbor rule, Distributed constrained optimization for multi-agent systems over a directed graph with piecewise stepsize, Data Analytics on Graphs Part I: Graphs and Spectra on Graphs, Depth-based hypergraph complexity traces from directed line graphs, Eigenvalues of LRU via a linear algebraic approach, Efficient and Reliable Overlay Networks for Decentralized Federated Learning, Connectivity‐informed adaptive regularization for generalized outcomes, Gelfand's inverse problem for the graph Laplacian, Monitoring effective connectivity in the preterm brain: a graph approach to study maturation, Discrepancy inequalities for directed graphs, Heat flow and concentration of measure on directed graphs with a lower Ricci curvature bound, Understanding the message passing in graph neural networks via power iteration clustering, Scale fragilities in localized consensus dynamics, Geometric and spectral properties of directed graphs under a lower Ricci curvature bound, Geometric scattering on measure spaces, Multi-linear pseudo-PageRank for hypergraph partitioning, Spectral complexity of directed graphs and application to structural decomposition, Random subshifts of finite type, Normalized graph Laplacians for directed graphs, Quantum encoding of dynamic directed graphs, Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs, Spectral analysis of non-Hermitian matrices and directed graphs, Unnamed Item, Distances and isomorphism between networks: stability and convergence of network invariants, On the multiplicative Chung-Diaconis-Graham process, Geometric and spectral analysis on weighted digraphs, Commute times for a directed graph using an asymmetric Laplacian, Large scale Ricci curvature on graphs, Amenability and geometry of semigroups, Generators and relations for subsemigroups via boundaries in Cayley graphs., Performance and stability of direct methods for computing generalized inverses of the graph Laplacian, On entropy-type functionals arising in stochastic chemical kinetics related to the concentration of the invariant measure and playing the role of Lyapunov functions in the dynamics of quasiaverages, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, Effective Resistance Preserving Directed Graph Symmetrization, Learning to rank on graphs, Relating field theories via stochastic quantization, Hermitian normalized Laplacian matrix for directed networks, Graph ambiguity, Bipartitioning of directed and mixed random graphs, Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler, Random walks on graphs and Monte Carlo methods, Algebraic connectivity may explain the evolution of gene regulatory networks, An Entropic Edge Assortativity Measure, Phase synchronization control of complex networks of Lagrangian systems on adaptive digraphs, Distributed optimization over directed graphs with row stochasticity and constraint regularity, Identifying transition states of chemical kinetic systems using network embedding techniques, Detecting groups in large vector autoregressions, A unified framework for harmonic analysis of functions on directed graphs and changing data, Unnamed Item, Eigenvalues of 2-edge-coverings, Clustering and community detection in directed networks: a survey, Maximum Flows and Minimum Cuts in the Plane, Markov chain methods for analyzing urban networks, Spectra of digraphs, Hypergraph Coloring Games and Voter Models, On the isoperimetric spectrum of graphs and its approximations, Which digraphs with ring structure are essentially cyclic?, Go with the flow, on Jupiter and snow. Coherence from model-free video data without trajectories, Random walks and flights over connected graphs and complex networks, Maximum flows and minimum cuts in the plane, Orbigraphs: a graph-theoretic analog to Riemannian orbifolds, On fast computation of directed graph Laplacian pseudo-inverse, Extreme values of the stationary distribution of random walks on directed graphs, On the mathematics of emergence, Dominant vertices in regulatory networks dynamics, Coevolutionary systems and PageRank, PageRank Beyond the Web, The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum, Voter Model on Signed Social Networks, Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity, Diffusion operator and spectral analysis for directed hypergraph Laplacian, Learning a Random DFA from Uniform Strings and State Information, Diffusion and consensus on weakly connected directed graphs, Synchronisation of heterogeneous Kuramoto oscillators with sampled information and a constant leader, Splines and wavelets on circulant graphs, A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities, The spectra of digraphs with Morita equivalent \(C^\ast\)-algebras, Community detection by resistance distance: automation and benchmark testing, The spectrum and eigenvectors of the Laplacian matrices of the Brualdi-Li tournament digraphs, List-Decoding with Double Samplers, Directed graph encoding in quantum computing supporting edge-failures, On the restricted numerical range of the Laplacian matrix for digraphs, Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets, Loose laplacian spectra of random hypergraphs, On efficient randomized algorithms for finding the PageRank vector
