scientific article; zbMATH DE number 964896
From MaRDI portal
zbMath0867.05046MaRDI QIDQ5691133
Publication date: 14 January 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
random walksadjacency matrixLaplacian matrixSobolev inequalitiesexpandersspectral graph theorygraph spectraHarnack inequalitiesdiagonal matrixrapidly mixing Markov chainssymmetry of eigenvalues
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Spectral problems; spectral geometry; scattering theory on manifolds (58J50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Spectral theory; trace formulas (e.g., that of Selberg) (11F72)
Related Items
Signals on graphs: transforms and tomograms, Scaling of weighted spectral distribution in deterministic scale-free networks, Characterizing the topological and controllability features of U.S. power transmission networks, Multifractal analysis and topological properties of a new family of weighted Koch networks, Spectral concentration and greedy \(k\)-clustering, iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data, Eigenvalue location in graphs of small clique-width, Polynomial control on stability, inversion and powers of matrices on simple graphs, The rational parameterisation theorem for multisite post-translational modification systems, Isoperimetry in supercritical bond percolation in dimensions three and higher, New lower bounds for the Randić spread, Maximal determinants of combinatorial matrices, Sparse subspace clustering with jointly learning representation and affinity matrix, Effect on normalized graph Laplacian spectrum by motif attachment and duplication, \(p\)-th Kazdan-Warner equation on graph in the negative case, A hierarchical structure for the sharp constants of discrete Sobolev inequalities on a weighted complete graph, Modeling and estimation for self-exciting spatio-temporal models of terrorist activity, Manifold adaptive kernelized low-rank representation for semisupervised image classification, Spectral gap of random hyperbolic graphs and related parameters, An explicit prime geodesic theorem for discrete tori and the hypergeometric functions, Local community detection in dynamic graphs using personalized centrality, Studies of the adaptive network-constrained linear regression and its application, Intrinsic isoperimetry of the giant component of supercritical bond percolation in dimension two, Semisupervised tangent space discriminant analysis, Spectral clustering with local projection distance measurement, A new condition for blow-up solutions to discrete semilinear heat equations on networks, Kernel spectral clustering with memory effect, Manifold learning for the emulation of spatial fields from computational models, A novel clustering method based on quasi-consensus motions of dynamical multiagent systems, Systematic evaluation of a new combinatorial curvature for complex networks, Multiple kernel clustering based on centered kernel alignment, Graph regularized multiset canonical correlations with applications to joint feature extraction, Greedy approaches to semi-supervised subspace learning, Spectral and structural properties of random interdependent networks, Mathematics of the genome, Scientific data interpolation with low dimensional manifold model, A forest building process on simple graphs, The geometry of nodal sets and outlier detection, Random walks and diffusion on networks, First eigenvalue estimates of Dirichlet-to-Neumann operators on graphs, Graph sampling, Parseval wavelets on hierarchical graphs, Random sampling of bandlimited signals on graphs, Weighted nonlocal Laplacian on interpolation from sparse data, Relating zeta functions of discrete and quantum graphs, Synchronisation under shocks: the Lévy Kuramoto model, Multiscale persistent functions for biomolecular structure characterization, On spectral integral variations of mixed graphs, Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications, On the optimality of J. Cheeger and P. Buser inequalities., Neumann Cheeger constants on graphs, Exemplar-based low-rank matrix decomposition for data clustering, Event-triggered sliding mode based consensus tracking in second order heterogeneous nonlinear multi-agent systems, Normalized Laplacian spectrum of some subdivision-joins and \(R\)-joins of two regular graphs, Evolutionary soft co-clustering: formulations, algorithms, and applications, Adaptive distributed convex optimization for multi-agent and its application in flocking behavior, Distributed consensus tracking for second-order nonlinear multiagent systems with a specified reference state, Distributed consensus-based robust adaptive formation control for nonholonomic mobile robots with partial known dynamics, Cheeger constants of Platonic graphs., The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes, The bisection width and the isoperimetric number of arrays., Eigenvalues, inequalities and ergodic theory, Lipschitz property of harmonic function on graphs, Kirchhoff indexes of a network, A survey of automated conjectures in spectral graph theory, Detecting the fuzzy clusters of complex networks, Interactive image segmentation using probabilistic hypergraphs, Bounds and conjectures for the signless Laplacian index of graphs, Generalized iterative RELIEF for supervised distance metric learning, Global and robust formation-shape stabilization of relative sensing networks, Randić index and eigenvalues of graphs, A spectral graph approach to discovering genetic ancestry, Network robustness to targeted attacks. The interplay of expansibility and degree distribution, Optimal configurations for peer-to-peer user-private information retrieval, Analysis of the physical Laplacian and the heat flow on a locally finite graph, A unified synchronization criterion for impulsive dynamical networks, Maximum flows and minimum cuts in the plane, Feature selection guided by structural information, Unboundedness of adjacency matrices of locally finite graphs, Image and video colorization using vector-valued reproducing kernel Hilbert spaces, Interlacing eigenvalues on some operations of graphs, On the mathematics of emergence, On eigenvalues of \(p\)-adic curvature., Harmonic analysis for graph refinements and the continuous graph FFT, Graph spectra as a systematic tool in computational biology, On resistance-distance and Kirchhoff index, Asymptotic behavior of the transition probability of a random walk on an infinite graph, On the isoperimetric number of a \(k\)-degree Cayley graph, Design of interpretable fuzzy rule-based classifiers using spectral analysis with structure and parameters optimization, The case of equality in the Dobrushin-Deutsch-Zenger bound, A new lower bound for the bipartite crossing number with applications, Reconstruction of weighted graphs by their spectrum, Generalization performance of graph-based semi-supervised classification, Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?, Tree and forest weights and their application to nonuniform random graphs, Lower bounds for the eigenvalues of Laplacian matrices, Spectral determinant on quantum graphs, The finite upper half space and related hypergraphs, Eigenfunction properties and approximations of selected incidence matrices employed in spatial analyses, Fast Fourier transform for fitness landscapes, Cheeger's inequalities for general symmetric forms and existence criteria for spectral gap., Web document clustering using hyperlink structures, Hermitian matrices and graphs: Singular values and discrepancy, Graph Laplacians, nodal domains, and hyperplane arrangements, Locality pursuit embedding, The geometry of spontaneous spiking in neuronal networks, Direct scaling analysis of localization in single-particle quantum systems on graphs with diagonal disorder, On delay-induced stability in diffusively coupled discrete-time systems, A new dissimilarity measure for comparing labeled graphs, Laplacians on infinite graphs: Dirichlet and Neumann boundary conditions, Inverse scattering theory for discrete Schrödinger operators on the hexagonal lattice, H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph, Random walk distances in data clustering and applications, Primal and dual model representations in kernel-based learning, Spectral clustering based on local linear approximations, Video semantic analysis based on structure-sensitive anisotropic manifold ranking, Cooperative attitude control of multiple rigid bodies with multiple time-varying delays and dynamically changing topologies, Semi-supervised local Fisher discriminant analysis for dimensionality reduction, On the eigenvectors of \(p\)-Laplacian, Learning to rank on graphs, On the properties of von Neumann kernels for link analysis, An interlacing technique for spectra of random walks and its application to finite percolation clusters, Local measurement and diffusion reconstruction for signals on a weighted graph, Blow-up solutions and global solutions to discrete \(p\)-Laplacian parabolic equations, Indefinite eigenvalue problems for \(p\)-Laplacian operators with potential terms on networks, A critical threshold for design effects in network sampling, Positive solutions of \(p\)-th Yamabe type equations on graphs, Characteristics polynomial of normalized Laplacian for trees, Lower bounds for the first eigenvalue of the Steklov problem on graphs, Algebraic connectivity may explain the evolution of gene regulatory networks, The normalized Laplacian spectrum of subdivisions of a graph, The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains, Upper bounds for some graph energies, The normalized Laplacian spectrum of quadrilateral graphs and its applications, Hodge decomposition and the Shapley value of a cooperative game, Testing goodness of fit of random graph models, Semi-supervised classification based on low rank representation, Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers, Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems, Hyperlink regression via Bregman divergence, Fast Haar transforms for graph neural networks, A low discrepancy sequence on graphs, Codes, cubes, and graphical designs, On nonexistence of global solutions for a semilinear heat equation on graphs, Tensor network and (\(p\)-adic) AdS/CFT, Supervised dimensionality reduction via distance correlation maximization, A family of graphs that are determined by their normalized Laplacian spectra, Some remarks about conservation for residual distribution schemes, Inverse scattering for Schrödinger operators on perturbed lattices, Visualizing network communities with a semi-definite programming method, Random Laplacian matrices and convex relaxations, Graph-induced restricted Boltzmann machines for document modeling, Mean first passage time of preferential random walks on complex networks with applications, Eigenvalue estimates of the \(p\)-Laplacian on finite graphs, Spectral and threshold analysis of a small rank perturbation of the discrete Laplacian, Leaderless and leader-following consensus of linear multi-agent systems with distributed event-triggered estimators, Wavelet shrinkage on paths for denoising of scattered data, Hypergraph Laplace operators for chemical reaction networks, On the second largest normalized Laplacian eigenvalue of graphs, The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs, On the Laplacian spectral radius of bipartite graphs with fixed order and size, On the normalized spectrum of threshold graphs, Distance between the normalized Laplacian spectra of two graphs, Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images, The adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphs, On sums of graph eigenvalues, On the spectra of nonsymmetric Laplacian matrices, Spectral clustering with physical intuition on spring-mass dynamics, Some results on the bounds of signless Laplacian eigenvalues, Cheeger inequalities for unbounded graph Laplacians, Combinatorial Calabi flow on 3-manifolds with toroidal boundary, Stability results for Harnack inequalities., Spectral theory of Laplace operators on oriented hypergraphs, Nonlinear network dynamics with consensus-dissensus bifurcation, An MBO scheme for minimizing the graph Ohta-Kawasaki functional, Interaction in agent-based economics: a survey on the network approach, Cucker-Smale flocking under rooted leadership with free-will agents, Community-based immunization in opportunistic social networks, Power-law partial correlation network models, Spectral properties of hypercubes with applications, On fast computation of directed graph Laplacian pseudo-inverse, Riemannian gradient descent methods for graph-regularized matrix completion, Regular graphs with minimum spectral gap, Condensed Ricci curvature of complete and strongly regular graphs, Disagreement networks, The maximum relaxation time of a random walk, Sharp bounds for the largest eigenvalue, Extremal eigenvalues of critical Erdős-Rényi graphs, Recent progress in combinatorial random matrix theory, Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case, Laplace and bi-Laplace equations for directed networks and Markov chains, Operator growth bounds from graph theory, Fluctuations of extreme eigenvalues of sparse Erdős-Rényi graphs, On the second smallest and the largest normalized Laplacian eigenvalues of a graph, The limit of first eigenfunctions of the \(p\)-Laplacian on graphs, Spectra of random regular hypergraphs, Exact bounds on the order of the maximum clique of a graph., The integrity of a cubic graph, Landscapes on spaces of trees, Spectral correspondence for point pattern matching, Spectral properties of the Laplacian on bond-percolation graphs, Full characterization of graphs having certain normalized Laplacian eigenvalue of multiplicity \(n-3\), Optimal Dirichlet control of partial differential equations on networks, Approximation theorems on graphs, Networks beyond pairwise interactions: structure and dynamics, Sobolev type inequalities for compact metric graphs, On the normalized Laplacian spectral radii of a graph and its line graph, Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport, Construction and Monte Carlo estimation of wavelet frames generated by a reproducing kernel, Geometry on probability spaces, Topology-invariant similarity of nonrigid shapes, Upper bounds on algebraic connectivity via convex optimization, Using discrepancy to control singular values for nonnegative matrices, Agent-based randomized broadcasting in large networks, The spectrum of Platonic graphs over finite fields, Random walks and local cuts in graphs, Spectral distributions of adjacency and Laplacian matrices of random graphs, Variable selection and regression analysis for graph-structured covariates with an application to genomics, Evolutionary design of oscillatory genetic networks, Multi-agent consensus using both current and outdated states with fixed and undirected interaction, Learning Markov random walks for robust subspace clustering and estimation, Convex nonnegative matrix factorization with manifold regularization, Surrounding control in cooperative agent networks, Global binary optimization on graphs for classification of high-dimensional data, The spectrum of non-local discrete Schrödinger operators with a \(\delta\)-potential, Unified spectral bounds on the chromatic number, Spectral classes of regular, random, and empirical graphs, Transformation of spectra of graph laplacians, Extinction and asymptotic behavior of solutions for the \(\omega\)-heat equation on graphs with source and interior absorption, First order approach and index theorems for discrete and metric graphs, Stability of twisted states in the Kuramoto model on Cayley and random graphs, Non-negative and sparse spectral clustering, Discriminative subspace learning with sparse representation view-based model for robust visual tracking, Joint Laplacian feature weights learning, A lattice point problem on the regular tree, \(k\)-phase oscillator synchronization for graph coloring, Graph spectra in computer science, Wavelets on graphs via spectral graph theory, Analytical relationships between metric and centrality measures of a network and its dual, Positive solutions for discrete boundary value problems involving the p-Laplacian with potential terms, Spectral clustering for detecting protein complexes in protein-protein interaction (PPI) networks, A spectral characterization of the Delaunay triangulation, Recent advances in graph-based pattern recognition with applications in document analysis, Statistical ranking and combinatorial Hodge theory, Vertex-frequency analysis on graphs, Effective masses for Laplacians on periodic graphs, Dynamic normal forms and dynamic characteristic polynomial, Multiway spectral clustering: a margin-based perspective, Transfer function representation of cyclic consensus systems, SpectralCAT: categorical spectral clustering of numerical and nominal data, A boosting approach for supervised Mahalanobis distance metric learning, On the signless Laplacian index of unicyclic graphs with fixed diameter, Essential self-adjointness of magnetic Schrödinger operators on locally finite graphs, Semi-supervised classification based on random subspace dimensionality reduction, The sparse Laplacian shrinkage estimator for high-dimensional regression, On the spectrum of the normalized graph Laplacian, On edge singularity and eigenvectors of mixed graphs, A novel supervised dimensionality reduction algorithm: graph-based Fisher analysis, Trace ratio criterion based generalized discriminative learning for semi-supervised dimensionality reduction, Certifying spatially uniform behavior in reaction-diffusion PDE and compartmental ODE systems, A unified framework for semi-supervised dimensionality reduction, Beyond the expanders, On the spectrum of the normalized Laplacian of iterated triangulations of graphs, Probabilistic relaxation labelling using the Fokker-Planck equation, Poisson equations with nonlinear source terms on networks, Eigenvalue bracketing for discrete and metric graphs, Equivalent properties for CD inequalities on graphs with unbounded Laplacians, Soft memberships for spectral clustering, with application to permeable language distinction, Discriminatively regularized least-squares classification, On connected diagrams and cumulants of Erdős-Rényi matrix models, A spectral clustering method for microarray data, Markov chain methods for analyzing urban networks, High-dimensional structure estimation in Ising models: local separation criterion, Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT, Unitary dimension reduction for a class of self-adjoint extensions with applications to graph-like structures, Low eigenvalues of Laplacian matrices of large random graphs, Spectra of large random trees, Automatically finding clusters in normalized cuts, Random walks and flights over connected graphs and complex networks, Tracking analysis for general linearly coupled dynamical systems, Convergence of the point integral method for Laplace-Beltrami equation on point cloud, Diffusion representations, Solver preconditioning using the combinatorial multilevel method on reservoir simulation, Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs, Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains, The largest normalized Laplacian spectral radius of non-bipartite graphs, A generalized Alon-Boppana bound and weak Ramanujan graphs, On matchings in stochastic Kronecker graphs, Incremental spectral clustering by efficiently updating the eigen-system, Asymptotic regularity of subdivisions of Euclidean domains by iterated PCA and iterated 2-means, On the distribution of local extrema in quantum chaos, The spectra of multiplicative attribute graphs, On spectral hypergraph theory of the adjacency tensor, A two-dimensional neighborhood preserving projection for appearance-based face recognition, Efficient linear discriminant analysis with locality preserving for face recognition, Normalized Laplacian spectrum of complete multipartite graphs, The iterated local model for social networks, Interpolating splines on graphs for data science applications, Asymptotic estimates for the \(p\)-Laplacian on infinite graphs with decaying initial data, Clique-based method for social network clustering, Testing whether the uniform distribution is a stationary distribution, Some remarks on Laplacian eigenvalues of connected graphs, Generalized modularity matrices, On spectra of spectra, Laplacian matrix of a weighted graph with new pendant vertices, A limit theorem for scaled eigenvectors of random dot product graphs, Estimating a common period for a set of irregularly sampled functions with applications to periodic variable star data, 2-dimensional combinatorial Calabi flow in hyperbolic background geometry, An eigenvalue localization theorem for stochastic matrices and its application to Randić matrices, Spectral gap, isoperimetry and concentration on trees, Graph-theoretic design and analysis of key predistribution schemes, A cospectral family of graphs for the normalized Laplacian found by toggling, On the spectral gap of a quantum graph, Extremal Halin graphs with respect to the signless Laplacian spectra, Decentralized gradient algorithm for solution of a linear equation, Spectra of semi-infinite quantum graph tubes, General Cheeger inequalities for \(p\)-Laplacians on graphs, Logarithmic Sobolev, isoperimetry and transport inequalities on graphs, Relations between connected and self-avoiding hikes in labelled complete digraphs, Distributed consensus-based formation control for nonholonomic wheeled mobile robots using adaptive neural network, Some remarks on the eigenvalue multiplicities of the Laplacian on infinite locally finite trees, Learning loopy graphical models with latent variables: efficient methods and guarantees, Kato's inequality and Liouville theorems on locally finite graphs, Adaptive exponential synchronization of coupled complex networks on general graphs, Navier-Stokes equations on weighted graphs, Geometry preserving multi-task metric learning, Inequalities for the number of walks in graphs, LPP solution schemes for use with face recognition, Graph kernels from the Jensen-Shannon divergence, On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions, Noncommutative Riemannian geometry on graphs, Two Laplacians for the distance matrix of a graph, Eigenfunctions of the edge-based Laplacian on a graph, The normalized incidence energy of a graph, Emergence of geometry in a combinatorial universe, Parabolic theory of the discrete \(p\)-Laplace operator, Random Lights Out processes on graphs, Spectra of edge-independent random graphs, Ky Fan theorem applied to Randić energy, A Cheeger-type inequality on simplicial complexes, From quasirandom graphs to graph limits and graphlets, On the spectral density function of the Laplacian of a graph, A note on an alternating upper bound for random walks on semigroups, Discrepancy inequalities for directed graphs, A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching, Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach, Normalized graph Laplacians for directed graphs, Spectra of uniform hypergraphs, On the signless Laplacian index of cacti with a given number of pendant vertices, Eigenvalue cluster traces for quantum graphs with equal edge lengths, On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes, Eigenvalues of certain weighted graphs joined at their roots having cliques at some levels, Hierarchical data organization, clustering and denoising via localized diffusion folders, Some bounds on the largest eigenvalues of graphs, Hodge theory on metric spaces. Appendix by Anthony W. Baker, Minimum vertex covers and the spectrum of the normalized Laplacian on trees, Semi-supervised wavelet shrinkage, Robust formation control of multiple wheeled mobile robots, Patch-to-tensor embedding, Diameters, distortion, and eigenvalues, Hearing the clusters of a graph: A distributed algorithm, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, Coarse-grained localized diffusion, Fast semi-supervised clustering with enhanced spectral embedding, Graph clustering, Discrete quasi-Einstein metrics and combinatorial curvature flows in 3-dimension, Decentralized observers with consensus filters for distributed discrete-time linear systems, \(L^q\) harmonic functions on graphs, Multi-way dual Cheeger constants and spectral bounds of graphs, Spectral hypergraph theory of the adjacency hypermatrix and matroids, Symmetry in world trade network, On the signless Laplacian spectra of \(k\)-trees, Minimal partitions and image classification using a gradient-free perimeter approximation, Myopic models of population dynamics on infinite networks, The synthesis of sound figures, The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph, Logarithmic Harnack inequalities for homogeneous graphs, Expansion of random graphs: new proofs, new results, Time regularity and long-time behavior of parabolic \(p\)-Laplace equations on infinite graphs, On eigenvalues of random complexes, Spectra of general hypergraphs, Probabilistic inequalities for evaluating structural network measures, A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping, On the deformation of discrete conformal factors on surfaces, Thermalization time bounds for Pauli stabilizer Hamiltonians, Clustering and community detection in directed networks: a survey, The (normalized) Laplacian eigenvalue of signed graphs, Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths, The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices, Formation control for networked spacecraft in deep space: with or without communication delays and with switching topology, Twistor theory on a finite graph, Data-driven Thresholding in Denoising with Spectral Graph Wavelet Transform, Graphs whose normalized Laplacian has three eigenvalues, Topological phases: an expedition off lattice, Global identifiability of linear structural equation models, Fast community detection by SCORE, New relations between discrete and continuous transition operators on (metric) graphs, A new nonlocal variational setting for image processing, Fully distributed flocking with a moving leader for Lagrange networks with parametric uncertainties, Bounds on normalized Laplacian eigenvalues of graphs, Complete characterization of flocking versus nonflocking of Cucker-Smale model with nonlinear velocity couplings, The exponential map for Hopf algebras, Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems, Spectral preorder and perturbations of discrete weighted graphs, Stable Gabor phase retrieval for multivariate functions, Multi-view graph convolutional networks with attention mechanism, Sparse Laplacian shrinkage with the graphical Lasso estimator for regression problems, A dynamical approach to efficient eigenvalue estimation in general multiagent networks, Multiway \(p\)-spectral graph cuts on Grassmann manifolds, Persistence in complex systems, Gradient flows in metric random walk spaces, The many facets of the Estrada indices of graphs and networks, A review on spectral clustering and stochastic block models, Enforcing exact physics in scientific machine learning: a data-driven exterior calculus on graphs, A Calderón type inverse problem for tree graphs, Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs, Eigen-stratified models, From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds, A new approach based on spectral graph theory to avoiding enclosed holes in topology optimization, Toughness and normalized Laplacian eigenvalues of graphs, On the construction of cospectral nonisomorphic bipartite graphs, Random walks and Laplacians on hypergraphs: when do they match?, Investigation of chemical space networks using graph measures and random matrix theory, Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering, A steady-state analysis of distribution networks by diffusion-limited-aggregation and multifractal geometry, Regularity-based spectral clustering and mapping the Fiedler-carpet, Relating Eulerian and Lagrangian spatial models for vector-host disease dynamics through a fundamental matrix, Attributed community mining using joint general non-negative matrix factorization with graph Laplacian, Conical \(3\)-uniform measures: a family of new examples and characterizations, Entropical optimal transport, Schrödinger's system and algorithms, Graph signal interpolation with positive definite graph basis functions, Exploring the heterogeneity for node importance byvon Neumann entropy, Hidden symmetries in real and theoretical networks, On singular signed graphs with nullspace spanned by a full vector: signed nut graphs, A note on Neumann problems on graphs, Finding structure in sequences of real numbers via graph theory: a problem list, Secure non-interactive reduction and spectral analysis of correlations, On the spectrum of dense random geometric graphs, Matrix valued inverse problems on graphs with application to mass-spring-damper systems, Spectral properties of the commuting graphs of certain groups, Partial differential equations and variational methods for geometric processing of images, Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs, Unified synchronization criteria in an array of coupled neural networks with hybrid impulses, Manifold regularized matrix completion for multi-label learning with ADMM, Multi-view clustering via multi-manifold regularized non-negative matrix factorization, A bag-of-paths framework for network data analysis, The discrete Gaussian free field on a compact manifold, Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star, Dynamic mode decomposition in vector-valued reproducing kernel Hilbert spaces for extracting dynamical structure among observables, The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain, Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering, Recovering the shape of a quantum graph, A Cheeger inequality for graphs based on a reflection principle, Geometric and spectral properties of directed graphs under a lower Ricci curvature bound, Algebraic connectivity and disjoint vertex subsets of graphs, Impact of surface defects on a condensate of electron pairs in a quantum wire, Partition of unity methods for signal processing on graphs, Heat kernels on forms defined on a subgraph of a complete graph, Convex programming based spectral clustering, The normalized Laplacians, degree-Kirchhoff index, and the complexity of Möbius graph of linear octagonal-quadrilateral networks, Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs, Some bounds for the incidence \(Q\)-spectral radius of uniform hypergraphs, A Cheeger cut for uniform hypergraphs, Learning robust affinity graph representation for multi-view clustering, Global \(\mu\)-synchronization of impulsive pantograph neural networks, An upper bound for higher order eigenvalues of symmetric graphs, Spatio-spectral limiting on discrete tori: adjacency invariant spaces, Distance preserving model order reduction of graph-Laplacians and cluster analysis, Stability of the tree of shapes to additive noise, Precise asymptotics of some meeting times arising from the voter model on large random regular graphs, Finding the resistance distance and eigenvector centrality from the network's eigenvalues, On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks, A topological approach to spectral clustering, HERMES: persistent spectral graph software, Group-annihilator graphs realised by finite abelian groups and its properties, Spectral clustering revisited: information hidden in the Fiedler vector, Green's analysis of conducting lattices, Localized Fourier analysis for graph signal processing, Lions and contamination, triangular grids, and Cheeger constants, The spectra of digraphs with Morita equivalent \(C^\ast\)-algebras, Dissecting graph measure performance for node clustering in LFR parameter space, Synchronization of complex networks subject to impulses with average characteristics, The Ricci curvature of gluing graph of two complete graphs, \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs, The SPDE approach to Matérn fields: graph representations, Biomolecular topology: modelling and analysis, State estimation using a network of distributed observers with unknown inputs, Dual-domain graph convolutional networks for skeleton-based action recognition, On the first three minimum Mostar indices of tree-like phenylenes, State estimation using a network of distributed observers with switching communication topology, Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets, Poisson statistics and localization at the spectral edge of sparse Erdős-Rényi graphs, A condition for blow-up solutions to discrete \(p\)-Laplacian parabolic equations under the mixed boundary conditions on networks, On the Kirchhoff index and the number of spanning trees of cylinder/Möbius pentagonal chain, Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization, Critical parameters of the synchronisation's stability for coupled maps in regular graphs, A necessary and sufficient condition for the existence of global solutions to discrete semilinear parabolic equations on networks, Data clustering based on the modified relaxation Cheeger cut model, The distance Randić matrix of connected graphs, Properties of nonlinear diffusion equations on networks and their geometric aspects, Minimal basis subspace representation: a unified framework for rigid and non-rigid motion segmentation, Exact \(k\)-component graph learning for image clustering, Spectral analysis of non-Hermitian matrices and directed graphs, Complex Hadamard diagonalisable graphs, On multi-modal fusion learning in constraint propagation, The geometry connectivity of hypergraphs, Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\), On the critical set for Fujita type blow-up of solutions to the discrete Laplacian parabolic equations with nonlinear source on networks, Large scale Ricci curvature on graphs, The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model, Threshold analysis of the three dimensional lattice Schrödinger operator with non-local potential, Performance and stability of direct methods for computing generalized inverses of the graph Laplacian, Complete characterization of resistance distance for linear octagonal networks, Efficiency of long-range navigation on treelike fractals, Fractional spectral graph wavelets and their applications, Hermitian normalized Laplacian matrix for directed networks, Multi-way sparsest cut problem on trees with a control on the number of parts and outliers, The discrete \(p\)-Schrödinger equations under the mixed boundary conditions on networks, Robust classification of graph-based data, Spectral analysis of the Laplacian acting on discrete cusps and funnels, On the spectra of general random mixed graphs, A combinatorial Yamabe problem on two and three dimensional manifolds, On the multiplicities of normalized Laplacian eigenvalues of graphs, Discrete Bethe-Sommerfeld conjecture for triangular, square, and hexagonal lattices, Edge-matching graph contractions and their interlacing properties, On the spectrum of hypergraphs, Eigenvalues with respect to a weight for general boundary value problems on networks, Computing the permanent of the Laplacian matrices of nonbipartite graphs, Diffusion bank networks and capital flows, Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit, Polynomial-time algorithms for submodular Laplacian systems, Polynomial control on weighted stability bounds and inversion norms of localized matrices on simple graphs, The maximum number of spanning trees of a graph with given matching number, \({\mathcal{C}}^k_{m,s}\) as a \(k\)-uniform hypergraph and some its properties, Minimum values of the second largest \(Q\)-eigenvalue, On the extensional eigenvalues of graphs, On the Randić incidence energy of graphs, Hubs-biased resistance distances on graphs and networks, Escape rate of Markov chains on infinite graphs, Adaptive synchronization in complex dynamical networks with coupling delays for general graphs, From fixed-energy localization analysis to dynamical localization: an elementary path, Ollivier's Ricci curvature, local clustering and curvature-dimension inequalities on graphs, Xheal: a localized self-healing algorithm using expanders, Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model, Schrödinger operators on periodic discrete graphs, Multi-link wavelets on hierarchical graphs, Hardy inequality and asymptotic eigenvalue distribution for discrete Laplacians, The Laplacian of a uniform hypergraph, Computing semantic clusters by semantic mirroring and spectral graph partitioning, Mean curvature, threshold dynamics, and phase field theory on finite graphs, A combinatorial Li-Yau inequality and rational points on curves, Conformally covariant operators and conformal invariants on weighted graphs, A scoring mechanism for the rank aggregation of network robustness, Spectral graph features for the classification of graphs and graph sequences, Trees with 4 or 5 distinct normalized Laplacian eigenvalues, Graph characteristics from the heat kernel trace, The \(p\)-Schrödinger equations on finite networks, Tight framelets and fast framelet filter bank transforms on manifolds, Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization, Cospectrality of graphs with respect to distance matrices, Cheeger constants, structural balance, and spectral clustering analysis for signed graphs, Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs, Semi-supervised learning for ordinal kernel discriminant analysis, Supervised aggregated feature learning for multiple instance classification, Explicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley tree, The heat flow on metric random walk spaces, The total variation flow in metric random walk spaces, Joint hypergraph learning and sparse regression for feature selection, A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights, Continuous relaxations for the traveling salesman problem, Bayesian network marker selection via the thresholded graph Laplacian Gaussian prior, Nonlocal TV-Gaussian prior for Bayesian inverse problems with applications to limited CT reconstruction, Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs, On the Cheeger constant for distance-regular graphs, Cut ratios and Laplacian eigenvalues, Similarities on graphs: kernels versus proximity measures, Distance between the spectra of graphs with respect to normalized Laplacian spectra, Blow-up problems for nonlinear parabolic equations on locally finite graphs, Spectral method and regularized MLE are both optimal for top-\(K\) ranking, Clustering based on eigenvectors of the adjacency matrix, Optimal designs for treatment comparisons represented by graphs, Spectral stability of metric-measure Laplacians, Diffusion operator and spectral analysis for directed hypergraph Laplacian, On the Laplacian spectra of some double join operations of graphs, Data scarcity, robustness and extreme multi-label classification, Spanning tree packing number and eigenvalues of graphs with given girth, Critical blow-up and global existence for discrete nonlinear \(p\)-Laplacian parabolic equations, Improved distance queries and cycle counting by Frobenius normal form, Deformed Laplacians and spectral ranking in directed networks, Splines and wavelets on circulant graphs, On multiplicity of eigenvalues in quantum graph theory, The effects of structural perturbations on the synchronizability of diffusive networks, Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI, On the normalized Laplacian spectral radius, Laplacian incidence energy and Kemeny's constant, Random Steiner systems and bounded degree coboundary expanders of every dimension, Combinatorial Calabi flow with surgery on surfaces, A characterization of effective resistance metrics, Expected hitting times for random walks on the \(k\)-triangle graph and their applications, Spectra of discrete two-dimensional periodic Schrödinger operators with small potentials, On the decomposition principle and a Persson type theorem for general regular Dirichlet forms, Random walk centrality in interconnected multilayer networks, A discrete Liouville identity for numerical reconstruction of Schrödinger potentials, Adaptive edge weighting for graph-based learning algorithms, The spectral gap of graphs arising from substring reversals, Complexity of approximating bounded variants of optimization problems, A short proof of interlacing inequalities on normalized Laplacians, Protein classification by matching and clustering surface graphs, Convergence of some time inhomogeneous Markov chains via spectral techniques, Face recognition using spectral features, Graph simplification and matching using commute times, DEX: self-healing expanders, A spectral property of discrete Schrödinger operators with non-negative potentials, Asymptotic representation theory and the spectrum of a random geometric graph on a compact Lie group, A complete characterization of the discrete \(p\)-Laplacian parabolic equations with \(q\)-nonlocal reaction with respect to the blow-up property, A dimensionality reduction framework for detection of multiscale structure in heterogeneous networks, A survey of kernel and spectral methods for clustering, Modulus of continuity eigenvalue bounds for homogeneous graphs and convex subgraphs with applications to quantum Hamiltonians, Control for a system of linear agents based on a high order adaptation algorithm, The essential spectrum of the Laplacian on rapidly branching tessellations, Three conjectures in extremal spectral graph theory, On eigenvalues of Laplacian matrix for a class of directed signed graphs, Adaptive directional Haar tight framelets on bounded domains for digraph signal representations, Symmetric Laplacians, quantum density matrices and their von-Neumann entropy, Optimal Cheeger cuts and bisections of random geometric graphs, Three-dimensional steerable discrete cosine transform with application to 3D image compression, Expected value of the one-dimensional earth mover's distance, Spectrally optimized pointset configurations, The diffusion geometry of fibre bundles: horizontal diffusion maps, Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations, Graph Fourier transform based on \(\ell_1\) norm variation minimization, The magnetic discrete Laplacian inferred from the Gauß-Bonnet operator and application, Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel, On recovery guarantees for angular synchronization, The normalized distance Laplacian, Duality structures and discrete conformal variations of piecewise constant curvature surfaces, Topological multiplicity of the maximum eigenvalue of graph \(1\)-Laplacian, Spectral classes of strongly-regular and distance-regular graphs, Harnack's inequality and Green's functions on locally finite graphs, Mean isoperimetry with control on outliers: exact and approximation algorithms, Spectral gap of the largest eigenvalue of the normalized graph Laplacian, Proximal gradient methods for general smooth graph total variation model in unsupervised learning, The Cheeger cut and Cheeger problem in metric graphs, Cross-validation of matching correlation analysis by resampling matching weights, On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues, Hierarchical clustering of asymmetric networks, The spectra of random mixed graphs, On multiplicities of eigenvalues of a boundary value problem on a snowflake graph, Green functions on product networks, Heat kernel embeddings, differential geometry and graph structure, The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications, Some new spectral bounds for graph irregularity, Bounding the sum of powers of normalized Laplacian eigenvalues of a graph, Spatially distributed sampling and reconstruction, Spectral complexity of directed graphs and application to structural decomposition, Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization, Diffusion polynomial frames on metric measure spaces, Consistency of spectral clustering, The replicator equation in stochastic spatial evolutionary games, Regularized query classification using search click information, Minimal webs in Riemannian manifolds, Commute times for a directed graph using an asymmetric Laplacian, On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs, The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions, Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues, The Laplacian incidence energy of graphs, On Randić energy, On the spectrum of the normalized Laplacian for signed graphs: interlacing, contraction, and replication, The asymptotics of ranking algorithms, Lower bounds for the Estrada index using mixing time and Laplacian spectrum, Laplacian dynamics on general graphs, On the tree-depth of random graphs, The dual Cheeger constant and spectra of infinite graphs, Branch decomposition heuristics for linear matroids, Composite centrality: a natural scale for complex evolving networks, Delay-dependent coupling for a multi-agent LTI consensus system with inter-agent delays, The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph, An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications, Six classes of trees with largest normalized algebraic connectivity, Spectral asymptotics of the Laplacian on supercritical bond-percolation graphs, A monotonicity property for weighted Delaunay triangulations, Diffusion and elastic equations on networks, Classifier learning with a new locality regularization method, Synchronization in random networks with given expected degree sequences, Laplace spectra of orgraphs and their applications, Lifshitz tails for spectra of Erdős-Rényi random graphs, Diffusion maps, Diffusion wavelets, Diffusion maps, spectral clustering and reaction coordinates of dynamical systems, Correspondence matching using kernel principal components analysis and label consistency constraints, Decentralized control of vehicle formations, The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter, Modularity spectra, eigen-subspaces, and structure of weighted graphs, Eikonal equation adaptation on weighted graphs: fast geometric diffusion process for local and non-local image and data processing, A note on label propagation for semi-supervised learning, Image segmentation by using the localized subspace iteration algorithm, The spectrum and eigenvectors of the Laplacian matrices of the Brualdi-Li tournament digraphs, Harnack inequalities for graphs with non-negative Ricci curvature, A class of Laplacian multiwavelets bases for high-dimensional data, A note on normalized Laplacian energy of graphs, Speeding up a memetic algorithm for the max-bisection problem, Giant components in Kronecker graphs, Inverse eigenvalue problems on directed graphs, LOCALITY PRESERVING NONNEGATIVE MATRIX FACTORIZATION WITH APPLICATION TO FACE RECOGNITION, Diameter of random spanning trees in a given graph, Low Rank Tensor Manifold Learning, Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms, Quadratically Regularized Optimal Transport on Graphs, Uncertainty Quantification in Graph-Based Classification of High Dimensional Data, Graphs, Vectors, and Matrices, Book Review: Ricci flow for shape analysis and surface registration: theories, algorithms and applications, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them, Testing Spatial Autocorrelation in Weighted Networks: The Modes Permutation Test, Spectrum of the 1-Laplacian and Cheeger's Constant on Graphs, Spectral properties of complex networks, Pinning controllability of complex networks with community structure, Cheeger Inequalities for General Edge-Weighted Directed Graphs, Consensus in Networks under Transmission Delays and the Normalized Laplacian, Parseval transforms for finite frames, Rotation gene set testing for longitudinal expression data, On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph, Majorisations for the eigenvectors of graph-adjacency matrices, The vertex attack tolerance of complex networks, Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs, Robustness of random graphs based on graph spectra, Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks, AUTOMATIC COMPLEXITY REDUCTION IN REINFORCEMENT LEARNING, Consistency of Dirichlet Partitions, The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning, Detection of core–periphery structure in networks using spectral methods and geodesic paths, Combinatorial Calabi flows on surfaces, SYNCHRONIZABILITY AND SYNCHRONIZATION DYNAMICS OF WEIGHED AND UNWEIGHED SCALE FREE NETWORKS WITH DEGREE MIXING, Curvature aspects of graphs, Pseudo-orthogonality for graph 1-Laplacian eigenvectors and applications to higher Cheeger constants and data clustering, Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties, Finding hidden structures, hierarchies, and cores in networks via isospectral reduction, Network Essence: PageRank Completion and Centrality-Conforming Markov Chains, Finding and Using Expanders in Locally Sparse Graphs, Spectral Identification of Networks Using Sparse Measurements, A generalized Cheeger inequality, On new PageRank computation methods using quantum computing, Stability regions for synchronized τ-periodic orbits of coupled maps with coupling delay τ, Network-complement transitions, symmetries, and cluster synchronization, Phase-locked patterns of the Kuramoto model on 3-regular graphs, Large random simplicial complexes, III the critical dimension, Upper bound for the diameter of a tree in the quantum graph theory, Blow-up Phenomena for Solutions of Discrete Nonlinear p-Laplacian Parabolic Equations on Networks, Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy, The Geometric Meaning of Curvature: Local and Nonlocal Aspects of Ricci Curvature, On some general operators of hypergraphs, Can one hear the spanning trees of a quantum graph?, The product replacement algorithm and Kazhdan’s property (T), Localization of Neumann eigenfunctions near irregular boundaries, Constrained Graph Partitioning via Matrix Differential Equations, A survey on Mesh Segmentation Techniques, Provably Shorter Regular Expressions from Deterministic Finite Automata, Drawing Big Graphs Using Spectral Sparsification, A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition, A Variational Image Segmentation Model Based on Normalized Cut with Adaptive Similarity and Spatial Regularization, Approximating Spectral Clustering via Sampling: A Review, Resilient Distributed Field Estimation, Multifractality and Laplace spectrum of horizontal visibility graphs constructed from fractional Brownian motions, Peculiar spectral statistics of ensembles of trees and star-like graphs, A SOFT-LINK SPECTRAL MODEL FOR LINK PREDICTION, Maximum Flows and Minimum Cuts in the Plane, The Grone-Merris Conjecture, Using supervised kernel locality preserving projections to improve classifier performance on credit rating forecasting, Statistical inference on random dot product graphs: a survey, Angular normal modes of a circular Coulomb cluster, Scattering on graphs and one-dimensional approximations to N-dimensional Schrödinger operators, Minimal selectors and fault tolerant networks, Estimates of bands for Laplacians on periodic equilateral metric graphs, SCALE SELECTION FOR GEOMETRIC FITTING IN NOISY POINT CLOUDS, On the graph of nilpotent matrix group of length one, Distributed finite-time consensus tracking for nonlinear multi-agent systems with a time-varying reference state, Spectra of Extended Double Cover Graphs, Diffuse Interface Models on Graphs for Classification of High Dimensional Data, Graph theoretic uncertainty and feasibility, An overview of periodic elliptic operators, A Cooperative Sensor Network: Optimal Deployment and Functioning, Graphs with Many Strong Orientations, On the Solvability of the Discrete Conductivity and Schrödinger Inverse Problems, Domination and Spectral Graph Theory, Random walks on simplicial complexes and harmonics, SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM, Lower estimates on eigenvalues of quantum graphs, An Optimisation-Based Approach to Mesh Smoothing: Reformulation and Extensions, Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors, A Fiedler-like theory for the perturbed Laplacian, Estimation of number of modes in periodic graphs, Largest Eigenvalue of the Laplacian Matrix: Its Eigenspace and Transitive Orientations, Polar Classification of Nominal Data, Unnamed Item, PINNING IMPULSIVE STABILIZATION OF NONLINEAR DYNAMICAL NETWORKS WITH TIME-VARYING DELAY, The impact of multi-group multi-layer network structure on the performance of distributed consensus building strategies, Introduction: Big data and partial differential equations, Recognizing more random unsatisfiable 3-SAT instances efficiently, Sobolev type inequalities for general symmetric forms, On Laplacian Monopoles, Shifted simplicial complexes are Laplacian integral, Diffusions on graphs, Poisson problems and spectral geometry, Some remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs, Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph, Locating eigenvalues of unicyclic graphs, The Iterated Local Directed Transitivity Model for Social Networks, Iterated Global Models for Complex Networks, On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices, A Riemann-Roch Theorem on Infinite Graphs, On 12-regular nut graphs, On the Nullity of Altans and Iterated Altans, An Improved Lower Bound for the Degree Kirchhoff Index of Bipartite Graphs, Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems, Application of a Distributed Containment Algorithm: Trajectory Tracking for Mobile Robots, Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology, Signless normalized Laplacian for hypergraphs, GKSL generators and digraphs: computing invariant states, On normalized Laplacian spectrum of zero divisor graphs of commutative ring ℤn, Threshold of discrete Schrödinger operators with delta potentials on n-dimensional lattice, Unnamed Item, Unnamed Item, Unnamed Item, Complete Minors in Graphs Without Sparse Cuts, LOCAL EXISTENCE AND BLOW-UP OF SOLUTIONS TO FUJITA-TYPE EQUATIONS INVOLVING GENERAL ABSORPTION TERM ON FINITE GRAPHS, Tight Frame Graphs Arising as Line Graphs, Localized Stability Certificates for Spatially Distributed Systems over Sparse Proximity Graphs, A condition for blow-up solutions to discrete semilinear wave equations on networks, Improvements on Spectral Bisection, On Ambarzumian type theorems for tree domains, Unnamed Item, Convergence of the Weighted Nonlocal Laplacian on Random Point Cloud, On the adjacency matrix of a complex unit gain graph, On the relationship between the Kirchhoff and the Narumi-Katayama indices, Gaussian random fields: with and without covariances, On the normalized Laplacian spectrum of the comaximal graphs, Explicit determination of three invariants associated with random walks on n-prism networks, A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes, Laplacian regularized generalized Dirichlet mixture distribution for data clustering, Fast spectral clustering with self-weighted features, Normalized Laplacian polynomial of n-Cayley graphs, Extremal hitting times of trees with some given parameters, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Hitting times for random walks on subdivision and triangulation graphs, Generalizing Diffuse Interface Methods on Graphs: Nonsmooth Potentials and Hypergraphs, Unnamed Item, Harmonic Extension on The Point Cloud, An Adaptive Fast Solver for a General Class of Positive Definite Matrices Via Energy Decomposition, Revival of oscillations from deaths in diffusively coupled nonlinear systems: Theory and experiment, The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Linear Structures for Concurrency in Probabilistic Programming Languages, A random hierarchical lattice: the series-parallel graph and its properties, On the energy and spectral properties of the He matrix of hexagonal systems, Some Typical Properties of the Spatial Preferred Attachment Model, A Local Clustering Algorithm for Connection Graphs, Unnamed Item, Generalized Ricci curvature and the geometry of graphs, Invertibility of graph translation and support of Laplacian Fiedler vectors, Robust FEM-Based Extraction of Finite-Time Coherent Sets Using Scattered, Sparse, and Incomplete Trajectories, Coping with Silent Errors in HPC Applications, Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions, Graph Similarity through Entropic Manifold Alignment, Expected hitting times for random walks on quadrilateral graphs and their applications, Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters, Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products, EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS, Numerical integration on graphs: Where to sample and how to weigh, FRACTALITY OF SUBSTITUTION NETWORKS, Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph, Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem, The SIS process in populations with exponential decay, Random walks with long-range steps generated by functions of Laplacian matrices, Normalized algebraic connectivity of graphs, Rhomboidal C4C8 toris which are Cayley graphs, Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes, Confidence sets for network structure, Nonlinear Laplacian spectral analysis: capturing intermittent and low‐frequency spatiotemporal patterns in high‐dimensional data, Interactive knowledge discovery from hidden data through sampling of frequent patterns, THE NORMALIZED LAPLACIAN, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF THE LINEAR LADDER-LIKE CHAINS, Some Properties of Random Apollonian Networks, A note on the Laplacian resolvent energy of graphs, Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank, Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks, Transport Model for Feature Extraction, Optimization of non-cylindrical domains for the exact null controllability of the 1D wave equation, On the Dual Geometry of Laplacian Eigenfunctions, On inverse eigenvalue problems for two kinds of special banded matrices, Spectra of graphs and the spectral criterion for property (T), NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS, Unnamed Item, Estimate the spectrum of affine dynamical systems from partial observations of a single trajectory data, MONOTONICITY AND ASYMPTOTIC PROPERTIES OF SOLUTIONS FOR PARABOLIC EQUATIONS VIA A GIVEN INITIAL VALUE CONDITION ON GRAPHS, Compressive Sensing for Cut Improvement and Local Clustering, Persistent Cohomology for Data With Multicomponent Heterogeneous Information, Analysis of Relaxation Time in Random Walk with Jumps, Modeling Network Populations via Graph Distances, Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving, A Convergent Point Integral Method for Isotropic Elliptic Equations on a Point Cloud, Accurate Chemical Master Equation Solution Using Multi-Finite Buffers, COMB GRAPHS AND SPECTRAL DECIMATION, Unnamed Item, Unnamed Item, Persistent Laplacians: Properties, Algorithms and Implications, Spectral properties for the Laplacian of a generalized Wigner matrix, Data Analytics on Graphs Part I: Graphs and Spectra on Graphs, Design of time-delayed connection parameters for inducing amplitude death in high-dimensional oscillator networks, A class of scale-free networks with fractal structure based on subshift of finite type, Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data, Symmetry-driven network reconstruction through pseudobalanced coloring optimization, Unnamed Item, Efficient and Reliable Overlay Networks for Decentralized Federated Learning, Unnamed Item, ON A CLASS OF NONLINEAR SCHRÖDINGER EQUATIONS ON FINITE GRAPHS, Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian, Unnamed Item, A Hitting Time Formula for the Discrete Green's Function, Chip-Firing Games and Critical Groups, Edge connectivity and the spectral gap of combinatorial and quantum graphs, Modularity of Erdős‐Rényi random graphs, On the normalized Laplacians with some classical parameters involving graph transformations, Fuzzy-Based Methods in Data Analysis with the Focus on Dimensionality Reduction, Modular-transform based clustering, Information-Maximization Clustering Based on Squared-Loss Mutual Information, Large Margin Low Rank Tensor Analysis, Unsupervised 2D Dimensionality Reduction with Adaptive Structure Learning, Spectral estimates for Schrödinger operators on periodic discrete graphs, On the critical set for discrete Laplacian parabolic equations with polynomial-type reactions, Nonnegative Matrix Factorization with Rank Regularization and Hard Constraint, Intrinsic Graph Structure Estimation Using Graph Laplacian, A Nonparametric Clustering Algorithm with a Quantile-Based Likelihood Estimator, Hodge Laplacians on Graphs, Measure-geometric Laplacians for partially atomic measures, CURE: Curvature Regularization for Missing Data Recovery, Asymptotics and estimates for the discrete spectrum of the Schrödinger operator on a discrete periodic graph, Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of P2 and Kn, Scattering on periodic metric graphs, Multiscale Discrete Framelet Transform for Graph-Structured Signals, Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata, Joint Concept Correlation and Feature-Concept Relevance Learning for Multilabel Classification, Adaptive Structure Concept Factorization for Multiview Clustering, Distance Laplacian eigenvalues and chromatic number in graphs, On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph, L p -distortion and p -spectral gap of finite graphs, Deterministic Tensor Completion with Hypergraph Expanders, Multi-way spectral partitioning and higher-order cheeger inequalities, Distributed leader-following consensus for second-order multi-agent systems with nonlinear inherent dynamics, Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry, Near-Optimal Algorithms for Online Matrix Prediction, The number of spanning trees of a graph with given matching number, Semi-supervised learning with local and global consistency, Exponential synchronization of Kuramoto oscillators using spatially local coupling, The normalized Laplacian polynomial of rooted product of graphs, Unnamed Item, Unnamed Item, Unnamed Item, Normalized Laplacian eigenvalues with chromatic number and independence number of graphs, Strongly continuous semigroups on locally finite graphs, RANDIC INCIDENCE ENERGY OF GRAPHS, Pseudorandom Graphs from Elliptic Curves, A note on some lower bounds of the Laplacian energy of a graph, Noise stability of synchronization and optimal network structures, Consensus in first order nonlinear heterogeneous multi-agent systems with event-based sliding mode control, Unnamed Item, Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations, A Geometrical Method for Low-Dimensional Representations of Simulations, On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization, Symmetric Rank-One Updates from Partial Spectrum with an Application to Out-of-Sample Extension, A Spacial Gradient Estimate for Solutions to the Heat Equation on Graphs, Unnamed Item, Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that, Geometric analysis aspects of infinite semiplanar graphs with nonnegative curvature II, Tail estimates for homogenization theorems in random media, Community detection via a triangle and edge combination conductance partitioning, Global Registration of Multiple Point Clouds Using Semidefinite Programming, Distributed consensus-based formation control for multiple nonholonomic mobile robots with a specified reference trajectory, ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS, Consensus and synchronization problems on small-world networks, From entropic to energetic barriers in glassy dynamics: the Barrat–Mézard trap model on sparse networks, Eigenvalue bounds for some classes of matrices associated with graphs, Estimating modes of a complex dynamical network from impulse response data: Structural and graph‐theoretic characterizations, Unnamed Item, Parameter Rating by Diffusion Gradient, On the normalized (distance) Laplacian spectrum of linear dependence graph of a finite-dimensional vector space, Parameterized discrete uniformization theorems and curvature flows for polyhedral surfaces, II, Energy and Randić energy of special graphs, Inequalities for real number sequences with applications in spectral graph theory, Discrete Graphs – A Paradigm Model for Quantum Chaos, The problem of deficiency indices for discrete Schrödinger operators on locally finite graphs, The Impact of Network Flows on Community Formation in Models of Opinion Dynamics, Impact of Network Structure on New Service Pricing, The higher-order spectrum of simplicial complexes: a renormalization group approach, On the Aα spectrum of the zero-divisor graphs, Rethinking data-driven point spread function modeling with a differentiable optical model, The birth of geometry in exponential random graphs, The normalized Laplacian spectrum of n -polygon graphs and applications, Two-dimensional semi-nonnegative matrix factorization for clustering, Geometric and spectral analysis on weighted digraphs, Measuring Segregation via Analysis on Graphs, Minimum supports of eigenfunctions of graphs: a survey, Front Propagation and Arrival Times in Networks with Application to Neurodegenerative Diseases, Cheeger estimates of Dirichlet-to-Neumann operators on infinite subgraphs of graphs, Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap, Thurston's sphere packings on 3-dimensional manifolds. I., Perfect reconstruction two-channel filter banks on arbitrary graphs, Factorization number and subgroup commutativity degree via spectral invariants, Forest formulas of discrete Green's functions, Graph Fourier transform based on singular value decomposition of the directed Laplacian, 𝐿₁-distortion of Wasserstein metrics: A tale of two dimensions, Graph regularization centrality, The iterated local transitivity model for tournaments, The giant component after percolation of product graphs, Independence number and the normalized Laplacian eigenvalue one, Laplacians on infinite graphs: discrete vs. continuous, The iterative independent model, Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey, Curvature on graphs via equilibrium measures, Extending compositional data analysis from a graph signal processing perspective, Iterative solution of spatial network models by subspace decomposition, Sparse Topic Modeling: Computational Efficiency, Near-Optimal Algorithms, and Statistical Inference, Cospectral quantum graphs with Dirichlet conditions at pendant vertices, Sparse linear discriminant analysis for multiview structured data, Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator, Nonnegative matrix factorization with local similarity learning, Petals and books: The largest Laplacian spectral gap from 1, Extremal normalized Laplacian spectral radii of graphs, Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks, Skysurveys, Light Curves and Statistical Challenges, Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic, Quartic graphs with minimum spectral gap, Pseudoinverses of Signed Laplacian Matrices, A spectral bound for vertex-transitive graphs and their spanning subgraphs, Random matrices with row constraints and eigenvalue distributions of graph Laplacians, Scale fragilities in localized consensus dynamics, Characterization of expansion-related properties of modular graphs, On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs, Directed Community Detection With Network Embedding, Topology-based goodness-of-fit tests for sliced spatial data, Spectral Laplace transform of signals on arbitrary domains, Existence of three solutions to a class of nonlinear equations on graphs, An evolving network model from clique extension, On the discrete spectrum of a one-dimensional discrete Schrödinger operator with a perturbation of rank one, SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS, What Are Higher-Order Networks?, Spectrum Consistent Coarsening Approximates Edge Weights, Blow-up on metric graphs and Riemannian manifolds, Gain margin and Lyapunov analysis of discrete‐time network synchronization via Riccati design, Improving nonnegative matrix factorization with advanced graph regularization, Tensor subspace clustering using consensus tensor low-rank representation, Prescription of finite Dirichlet eigenvalues and area on surface with boundary, Universal Features for High-Dimensional Learning and Inference, Adaptive Rational Krylov Methods for Exponential Runge–Kutta Integrators, Spectral analysis of weighted neighborhood networks, Localization of eigenvectors in random graphs, The Normalized Laplacian Spectrum of Folded Hypercube with Applications, Bayesian learning of Covid-19 vaccine safety while incorporating adverse events ontology, Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm, A family of gradient methods using Householder transformation with application to hypergraph partitioning, Some bounds on spectral radius of signless Laplacian matrix of k-graphs, Spectrum of random d‐regular graphs up to the edge, Determinant of the finite volume Laplacian, Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues, The Cheeger cut and Cheeger problem in metric measure spaces, Learning multi-agent coordination through connectivity-driven communication, The structure and dynamics of networks with higher order interactions, Regularized regression when covariates are linked on a network: the 3CoSE algorithm, Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs, A compressed sensing based least squares approach to semi-supervised local cluster extraction, Dirac gauge theory for topological spinors in 3+1 dimensional networks, Spectral theory of weighted hypergraphs via tensors, Approximation of seismic velocities from the spectrum of weighted graphs, High dimensional expanders and coset geometries, Spectral theory of the non-backtracking Laplacian for graphs, A geometric construction of isospectral magnetic graphs, A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling, On normalized Laplacian eigenvalues of power graphs associated to finite cyclic groups, Weighted spectra on a weighted geometric realization of 2-simplexes and 3-simplexes, Essential self-adjointness of a weighted 3-simplicial complex Laplacians, Nonlinear evolution equation associated with hypergraph Laplacian, On split graphs with three or four distinct (normalized) Laplacian eigenvalues, The mass of simple and higher-order networks, Differentiate data by higher-order structures, Dual graph-regularized sparse concept factorization for clustering, Robust Factorizations and Colorings of Tensor Graphs, Eigenpolytope Universality and Graphical Designs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Markov incremental constructions, The dynamics of Schelling-type segregation models and a nonlinear graph Laplacian variational problem, A geometric approach to on-diagonal heat kernel lower bounds on groups., Generalizing the hypergraph Laplacian via a diffusion process with mediators, An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs, On the symmetry of the Laplacian spectra of signed graphs, Dependence aliasing and the control of family-wise error rate in multiple hypothesis testing, Diffuse scattering on graphs, A decentralized algorithm for spectral analysis
