Wen, Mathematical Foundations of Fractal Geometry ( Subshifts of finite type and sofic systems,” Monatsh. Random walks and effective resistance of networks,” J. Global mean first-passage times of random walks on complex networks,” Phys. Google Scholarĭetecting strange attractors in turbulence,” in Dynamical Systems and Turbulence (īerlin/Heidelberg, 1981), pp. Google Scholar CrossrefĬonstruction of Markov partitionings,” Funkcional. Markov partitions and C-diffeomorphisms,” Functional Analysis and its Applications 2(1), 61– 82 (1968). Google Scholar CrossrefĬlustering and embedding using commute times,” IEEE Trans. Xheal: Localized self-healing using expanders,” in Proceedings of the 30th annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (2011), pp. Network construction and fundamental results,” Phys. Samuel meets Amarel: Automating value function approximation using global state space analysis,” in Proceedings of AAAI (2005), Vol. Measuring the mixing time of social graphs,” in Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement (2010), pp. Random walks on graphs: A survey,” Combinatorics: Paul Erdős is Eighty (1993), Vol. Generating hierarchical scale-free graphs from fractals,” Chaos, Solitons Fractals 44(8), 651– 666 (2011). Hausdorff dimensions of sofic affine-invariant sets,” Isr. Google ScholarĬonductance and the rapid mixing property for Markov chains: The approximation of permanent resolved,” in Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (1988), pp. Grigoryan, Analysis on Graphs, Lecture Notes ( Gantmacher, Applications of the Theory of Matrices (Ĭourier Dover Publications, 2005). Falconer, Techniques in Fractal Geometry ( Scale-free topology of e-mail networks,” Phys. Google Scholar CrossrefĬombinatorial Laplacians and isoperimetric inequality,” in From Local Times to Global Geometry, Control and Physics (1986), Vol. , Google Scholar CrossrefĪMS Publications, 2006). Harnack inequalities for graphs with non-negative Ricci curvature,” J. Google Scholar CrossrefĪ lower bound for the smallest eigenvalue of the Laplacian,” in Problems in Analysis, edited by R. Bowen, Equilibrium States and the Ergodic Theory of Anosov Diffeomorphisms, Lecture Notes in Mathematics Vol. 2, edited and with a preface by Sinai (Translated from the Russian) ( Ergodic Theory with Applications to Dynamical Systems and Statistical Mechanics, Encyclopedia of Mathematical Sciences Vol. , Google Scholar Crossrefĭeterministic scale-free networks,” Physica A 299(3), 559– 564 (2001). , Google Scholar ScitationĮigenvalues and expanders,” Combinatorica 6(2), 83– 96 (1986). , Google Scholar Crossref, ISIĮigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications,” J. Marvel Universe looks almost like a real social network,” preprint arXiv cond-mat/0202174 (2002). As a result of this estimation, when the bipartite base graph is complete, we give a sharp condition to ensure that our networks are well-connected with rapid mixing property. Through an elaborate analysis of our network, we can estimate its Cheeger constant, which controls the spectral gap by Cheeger inequality. It is known that a large spectral gap in terms of normalized Laplacian is usually associated with small mixing time, which makes facilitated synchronization and rapid convergence possible. When embedding our growing network into the plane, we find its image is a graph-directed self-affine fractal, whose Hausdorff dimension is related to the power law exponent of cumulative degree distribution. To simplify our model, we suppose the base graphs are bipartite graphs and the subshift has the special form. In this paper, given a time series generated by a certain dynamical system, we construct a new class of scale-free networks with fractal structure based on the subshift of finite type and base graphs.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |