On the second eigenvalue of hypergraphs
We first define the second eigenvalue of 3-uniform hypergraph, and then discuss the general notion, as it applies to other uniform hypergraphs and graphs. Second, just as ordinary directed graphs can have multiple edges and self-loops, we can accomodate such notions here. Thirdly, we can also handle the notion of directed edges. We say that a directed 3-uniform hypergraph is a hypergraph where each edge \(\{i, j, k\}\) has a specified order. Now the trilinear form \(\tau\) is defined by \(\tau_{i, j, k}\) being the multiplicity if the edge \(\{i, j, k\}\). Fourth, we define for any trilinear form on \(L^2(V)\), \(\mu\), its first eigenvalue to be its norm with respect to \(L^2(V)\). Fifth, it becomes clear how we want to define the second eigenvalue in the more general case. Sixth, the first and second eigenvalue of multilinear forms (as defined in this paper) are always non-negative numbers. Lastly, we could define the eigenvalues and/or norms of multilinear forms with respect to other norms on the space of functions on \(V\), such as \(L^p(V)\) for any \(1\leq p\leq \infty\).
- An Estimate for Character Sums
- Characteristic vectors of bordered matrices with infinite dimensions
- Diameters and Eigenvalues
- Eigenvalues and expanders
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 3980487 (Why is no real title available?)
- scientific article; zbMATH DE number 3785204 (Why is no real title available?)
- On the second eigenvalue and random walks in random d-regular graphs
- On using deterministic functions to reduce randomness in probabilistic algorithms
- Some graphs with small second eigenvalue
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting
- Size biased couplings and the spectral gap for random regular graphs
- Some graphs with small second eigenvalue
- Simulating BPP using a general weak random source
- Sparse random tensors: concentration, regularization and applications
- Spectra of random regular hypergraphs
- Sparse SYK and traversable wormholes
- On the spectrum and linear programming bound for hypergraphs
- Analytic methods for uniform hypergraphs
- Adjacency spectra of random and complete hypergraphs
- Diffusion operator and spectral analysis for directed hypergraph Laplacian
- Spectra of cycle and path families of oriented hypergraphs
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Isoperimetric inequalities in simplicial complexes
- On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
- On the second eigenvalue of matrices associated with TCP
- Perfect packings in quasirandom hypergraphs. I.
- Inverse expander mixing for hypergraphs
- Random walks on simplicial complexes and harmonics
- On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
- Graph-theoretic design and analysis of key predistribution schemes
- Expander graphs and their applications
- Spectra of uniform hypergraphs
- scientific article; zbMATH DE number 475377 (Why is no real title available?)
- On the first and second eigenvalue of finite and infinite uniform hypergraphs
- Principal eigenvectors of general hypergraphs
- Hypergraphs and hypermatrices with symmetric spectrum
- Deterministic tensor completion with hypergraph expanders
- Lower bounds for the Laplacian spectral radius of an oriented hypergraph
- The Second-Moment Phenomenon for Monochromatic Subgraphs
- Eigenvalues and linear quasirandom hypergraphs
- Tensors in computations
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Graphs with high second eigenvalue multiplicity
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Support of closed walks and second eigenvalue multiplicity of graphs
- On the second eigenvalue of random bipartite biregular graphs
- Sparse random hypergraphs: non-backtracking spectra and community detection
- A hypergraph Heilmann-Lieb theorem
- Statistical ranking with dynamic covariates
- On the second-largest modulus among the eigenvalues of a power hypergraph
- Bisection width, discrepancy, and eigenvalues of hypergraphs
- Partial recovery and weak consistency in the non-uniform hypergraph stochastic block model
- The Hamiltonicity of quasi-random k-graphs
- Spectral Turán problems on the expansion of matchings
- Spectral approach to the communication complexity of multi-party key agreement
- Principal eigenvectors in hypergraph Turán problems
- On the Kirchhoff index of hypergraphs.
This page was built for publication: On the second eigenvalue of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1842569)
