Standard

Clustering of spectra and fractals of regular graphs. / Ejov, V.; Filar, J. A.; Lucas, S. K.; Zograf, P.

в: Journal of Mathematical Analysis and Applications, Том 333, № 1 SPEC. ISS., 01.09.2007, стр. 236-246.

Результаты исследований: Научные публикации в периодических изданияхстатьяРецензирование

Harvard

Ejov, V, Filar, JA, Lucas, SK & Zograf, P 2007, 'Clustering of spectra and fractals of regular graphs', Journal of Mathematical Analysis and Applications, Том. 333, № 1 SPEC. ISS., стр. 236-246. https://doi.org/10.1016/j.jmaa.2006.09.072

APA

Ejov, V., Filar, J. A., Lucas, S. K., & Zograf, P. (2007). Clustering of spectra and fractals of regular graphs. Journal of Mathematical Analysis and Applications, 333(1 SPEC. ISS.), 236-246. https://doi.org/10.1016/j.jmaa.2006.09.072

Vancouver

Ejov V, Filar JA, Lucas SK, Zograf P. Clustering of spectra and fractals of regular graphs. Journal of Mathematical Analysis and Applications. 2007 Сент. 1;333(1 SPEC. ISS.):236-246. https://doi.org/10.1016/j.jmaa.2006.09.072

Author

Ejov, V. ; Filar, J. A. ; Lucas, S. K. ; Zograf, P. / Clustering of spectra and fractals of regular graphs. в: Journal of Mathematical Analysis and Applications. 2007 ; Том 333, № 1 SPEC. ISS. стр. 236-246.

BibTeX

@article{521dfa552b3a4aaeb1e411149e6c0f59,
title = "Clustering of spectra and fractals of regular graphs",
abstract = "We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and variance of the exponentials of graph eigenvalues cluster around a line segment that we call a filar. Zooming-in reveals that this cluster splits into smaller segments (filars) labeled by the number of triangles in graphs. Further zooming-in shows that the smaller filars split into subfilars labeled by the number of quadrangles in graphs, etc. We call this fractal structure, discovered in a numerical experiment, a multifilar structure. We also provide a mathematical explanation of this phenomenon based on the Ihara-Selberg trace formula, and compute the coordinates and slopes of all filars in terms of Bessel functions of the first kind. {\textcopyright} 2006 Elsevier Inc. All rights reserved.",
keywords = "Fractal, Ihara-Selberg trace formula, Regular graph, Spectrum",
author = "V. Ejov and Filar, {J. A.} and Lucas, {S. K.} and P. Zograf",
year = "2007",
month = sep,
day = "1",
doi = "10.1016/j.jmaa.2006.09.072",
language = "English",
volume = "333",
pages = "236--246",
journal = "Journal of Mathematical Analysis and Applications",
issn = "0022-247X",
publisher = "Elsevier",
number = "1 SPEC. ISS.",

}

RIS

TY - JOUR

T1 - Clustering of spectra and fractals of regular graphs

AU - Ejov, V.

AU - Filar, J. A.

AU - Lucas, S. K.

AU - Zograf, P.

PY - 2007/9/1

Y1 - 2007/9/1

N2 - We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and variance of the exponentials of graph eigenvalues cluster around a line segment that we call a filar. Zooming-in reveals that this cluster splits into smaller segments (filars) labeled by the number of triangles in graphs. Further zooming-in shows that the smaller filars split into subfilars labeled by the number of quadrangles in graphs, etc. We call this fractal structure, discovered in a numerical experiment, a multifilar structure. We also provide a mathematical explanation of this phenomenon based on the Ihara-Selberg trace formula, and compute the coordinates and slopes of all filars in terms of Bessel functions of the first kind. © 2006 Elsevier Inc. All rights reserved.

AB - We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and variance of the exponentials of graph eigenvalues cluster around a line segment that we call a filar. Zooming-in reveals that this cluster splits into smaller segments (filars) labeled by the number of triangles in graphs. Further zooming-in shows that the smaller filars split into subfilars labeled by the number of quadrangles in graphs, etc. We call this fractal structure, discovered in a numerical experiment, a multifilar structure. We also provide a mathematical explanation of this phenomenon based on the Ihara-Selberg trace formula, and compute the coordinates and slopes of all filars in terms of Bessel functions of the first kind. © 2006 Elsevier Inc. All rights reserved.

KW - Fractal

KW - Ihara-Selberg trace formula

KW - Regular graph

KW - Spectrum

UR - http://www.scopus.com/inward/record.url?scp=34248193293&partnerID=8YFLogxK

U2 - 10.1016/j.jmaa.2006.09.072

DO - 10.1016/j.jmaa.2006.09.072

M3 - Article

AN - SCOPUS:34248193293

VL - 333

SP - 236

EP - 246

JO - Journal of Mathematical Analysis and Applications

JF - Journal of Mathematical Analysis and Applications

SN - 0022-247X

IS - 1 SPEC. ISS.

ER -

ID: 127186724