Fetching the paper…
Reading the bibliography…
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy.
J. von Neumann, Mathematische Grundlagen der Quantenmechanik , Berlin, 1932; English translation by R. T. Beyer, Mathematical Foundations of Quantum Mechanics , Princeton, 1955
1955
Earlier work this paper cites.
M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Mathematics Journal , 23
1973
Earlier work this paper cites.
J. Körner, Coding of an information source having ambiguous alphabet and entropy of graphs, In Proc. 6th Prague Conference on Information Theory (1973) , pp. 411–425
1973
Earlier work this paper cites.
H. H. Lieb, M. B. Ruskai, Proof of the strong subadditivity of quantum-mechanical entropy, J. Math. Phys. 14
1973
Earlier work this paper cites.
L. C. Freeman, A set of measures of centrality based on betweenness, Sociometry , 40, 35–41 (1977)
1977
Earlier work this paper cites.
I. Gutman, The energy of a graph, Ber. Math. Stat. Sekt. Forschungszentrum Graz. , 103
1978
Earlier work this paper cites.
D. M. Cvetkovic, M. Doob, H. Sachs, Spectra of graph theory and applications, VEB Deutscher Berlin, Academic Press, New York, 1979
1979
Earlier work this paper cites.
R. Grone, R. Merris, V. Sunder, The Laplacian spectrum of a graph, SIAM J. Matrix Anal. Appl. 11
1990
Earlier work this paper cites.
T. Cover and J. Thomas, Elements of information theory , John Wiley, New York, 1991
1991
Earlier work this paper cites.
B. Mohar, The Laplacian spectrum of graphs. Graph Theory, Combinatorics, and Applications , 2
1991
Earlier work this paper cites.
N. Biggs, Algebraic Graph Theory , Cambridge, UK: Cambridge University Press, 1993
1993
Cited alongside, same era.
M. Ohya, D. Petz, Quantum entropy and its use . Texts and Monographs in Physics. Springer-Verlag, Berlin, 1993
1993
Cited alongside, same era.
R. Grone, R. Merris, The Laplacian spectrum of a graph, II. SIAM J. Discrete Math. 7
1994
Cited alongside, same era.
G. Simonyi, Graph entropy. In Combinatorial Optimization , L. L. W. Cook and P. Seymour, Eds., vol. 20 of DIMACS Series on Discrete Math and Computer Science . 1995, pp. 391–441
1995
Cited alongside, same era.
L. Lovász, Random walks on graphs: a survey. Combinatorics, Paul Erdős is eighty, Vol. 2 (Keszthely, 1993), 353–397, Bolyai Soc. Math. Stud., 2, János Bolyai Math. Soc., Budapest, 1996
1996
Cited alongside, same era.
E. Estrada, Characterization of the folding degree of proteins, Bioinformatics 18
2002
Later among the works it cites.
D. Kielpinski, C. Monroe, and D. J. Wineland, Nature 417
2002
Later among the works it cites.
B. B. Blinov, D. L. Moehring, L.-M. Duan, and C. Monroe, Nature 428
2004
Later among the works it cites.
M. Hein, J. Eisert, and H.J. Briegel. Multi-party entanglement in graph states, Phys. Rev. A 69
2004
Later among the works it cites.
D. Bonchev and G. A. Buck, Quantitative Measures of Network Complexity . In: Complexity in Chemistry, Biology and Ecology, D. Bonchev and D. H. Rouvray, Eds., Springer, New York, 2005, p. 191-235
2005
Later among the works it cites.
E. Estrada and J. A. Rodríguez-Velázquez, Subgraph centrality in complex networks, Phys. Rev. E 71
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. R. K. Chung, Spectral graph theory , CBMS Regional Conference Series in Mathematics, 92. Published for the Conference Board of the Mathematical Sciences, Washington, DC; by the American Mathematical Society, Providence, RI, 1997
1997
Cited alongside, same era.
A. Terras, Fourier analysis on finite groups and applications , London Mathematical Society Student Texts, 43. Cambridge University Press, Cambridge (1999)
1999
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information , Cambridge University Press, Cambridge, 2000
2000
Cited alongside, same era.
H.-J. Briegel and R. Raussendorf, Phys. Rev. Lett. 86
2001
Cited alongside, same era.
A. M. Duval and V. Reiner, Shifted simplicial complexes are Laplacian integral, Trans. Amer. Math. Soc. , 354(11):4313-4344, 2002
2002
Cited alongside, same era.
G. Bianconi, The entropy of network ensembles. arXiv:0802.2888v2 [cond-mat.dis-nn]
Cited in the paper.
F. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme gef¨uhrt wird. Ann. Phys. Chem. 72
Cited in the paper.
2005
Later among the works it cites.
S. Braunstein, S. Ghosh, S. Severini, The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states, Ann. of Combinatorics , 10
2006
Later among the works it cites.
M. Lazić, On the Laplacian energy of a graph, Czechoslovak Math. J . 56
2006
Later among the works it cites.
S. Bose, Contemporary Physics, Vol. 48
2007
Later among the works it cites.
R. Hildebrand, S. Mancini, S. Severini, Combinatorial laplacians and positivity under partial transpose, Math. Struct. in Comp. Science (2008), 18
2008
Closest in time.