Laplacian Spectral Properties of Graphs from Random Local Samples

@article{Wu2014LaplacianSP,
  title={Laplacian Spectral Properties of Graphs from Random Local Samples},
  author={Zhengwei Wu and Victor M. Preciado},
  journal={ArXiv},
  year={2014},
  volume={abs/1310.4899}
}
The Laplacian eigenvalues of a network play an important role in the analysis of many structural and dynamical network problems. In this paper, we study the relationship between the eigenvalue spectrum of the normalized Laplacian matrix and the structure of `local' subgraphs of the network. We call a subgraph \emph{local} when it is induced by the set of nodes obtained from a breath-first search (BFS) of radius $r$ around a node. In this paper, we propose techniques to estimate spectral… 

Figures from this paper

MINIMIZING DISSEMINATION ON LARGE GRAPHS
TLDR
A scalable algorithm called MET (short for Multiple Eigenvalues Tracking), which minimize the largest eigenvalue is proposed, which can work well even if the gap between the top eigenvalues is small.
Half Sampling on Bipartite Graphs
TLDR
Both finite and infinite graphs are discussed, the appropriate definition of “half bandlimited” that involves splitting the mid frequency is given, and an explicit solution to the half sampling problem on graphs that are generated by edge substitution is given.
A Topological Approach to Meta-heuristics: Analytical Results on the BFS vs. DFS Algorithm Selection Problem
TLDR
Estimates for average BFS and DFS runtime are derived using a probabilistic model of goal distribution and an additional statistic of path redundancy and average branching factor for tree search and graph search.
Régression ridge a noyau dans un graphe : Application au réseau de distribution d'eau potable
Ce travail aborde le probleme de l'inference sur les nœuds d'un tres grand graphe, representant un reseau de distribution d'eau potable, a partir d'une observation partielle de quelques donnees,
Analysis And Control Of Networked Systems Using Structural And Measure-Theoretic Approaches
TLDR
This paper presents a meta-analysis and control study of networked systems using structure and measurement approaches to solve the challenge of knowledge representation in the rapidly changing environment.

References

SHOWING 1-10 OF 25 REFERENCES
Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks
TLDR
This work proposes a series of semidefinite programs to find new bounds on the spectral radius and the spectral gap of the Laplacian matrix in terms of a collection of local structural features of the network.
Moment-Based Spectral Analysis of Large-Scale Networks Using Local Structural Information
TLDR
This paper uses algebraic graph theory and convex optimization to study how structural properties influence the spectrum of eigenvalues of the network, and can compute, with low computational overhead, global spectral properties of a network from its local structural properties.
Random graphs with arbitrary degree distributions and their applications.
TLDR
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.
Spectral graph theory
  • U. Feige
  • Mathematics
    Zeta and 𝐿-functions in Number Theory and Combinatorics
  • 2019
With every graph (or digraph) one can associate several different matrices. We have already seen the vertex-edge incidence matrix, the Laplacian and the adjacency matrix of a graph. Here we shall
The Spectra of Random Graphs with Given Expected Degrees
TLDR
It is shown that (under certain conditions) the eigenvalues of the (normalized) Laplacian of a random power law graph follow the semicircle law while the spectrum of the adjacency matrix of a power law graphs obeys the power law.
The Laplacian spectrum of graphs
The paper is essentially a survey of known results about the spectrum of the Laplacian matrix of graphs with special emphasis on the second smallest Laplacian eigenvalue λ2 and its relation to
Random Walks on Graphs: a Survey
Dedicated to the marvelous random walk of Paul Erd} os through universities, c ontinents, and mathematics Various aspects of the theory of random walks on graphs are surveyed. In particular,
Dynamical and correlation properties of the internet.
TLDR
It is found that the Internet is characterized by non-trivial correlations among nodes and different dynamical regimes, and the importance of node hierarchy and aging in the Internet structure and growth is pointed out.
Random Walks on Graphs: A Survey
TLDR
Estimates on the important parameters of access time, commute time, cover time and mixing time are discussed and recent algorithmic applications of random walks are sketched, in particular to the problem of sampling.
An Introduction To The Theory Of Graph Spectra
TLDR
An introduction to the theory of graph spectra is available in the book collection an online access to it is set as public so you can download it instantly and is universally compatible with any devices to read.
...
...