Real space Green's function approach to vibrational dynamics of a Vicsek fractal

Spectrum of the tight-binding model on Cayley trees and comparison with Bethe lattices

There are few exactly solvable lattice models and even fewer solvable quantum lattice models. Here we address the problem of finding the spectrum of the tight-binding model (equivalently, the spectrum of the adjacency matrix) on Cayley trees. Recent approaches to the problem have relied on the similarity between the Cayley tree and the Bethe lattice. Here, we avoid to make any ansatz related to the Bethe lattice due to fundamental differences between the two lattices that persist even when taking the thermodynamic limit. Instead, we show that one can use a recursive procedure that starts from the boundary and then use the canonical basis to derive the complete spectrum of the tight-binding model on Cayley trees. Our resulting algorithm is extremely efficient, as witnessed with remarkable large trees having hundreds of shells. We also show that, in the thermodynamic limit, the density of states is dramatically different from that of the Bethe lattice.

Scaling laws for diffusion on (trans)fractal scale-free networks

Fractal (or transfractal) features are common in real-life networks and are known to influence the dynamic processes taking place in the network itself. Here, we consider a class of scale-free deterministic networks, called (u, v)-flowers, whose topological properties can be controlled by tuning the parameters u and v; in particular, for u > 1, they are fractals endowed with a fractal dimension df, while for u = 1, they are transfractal endowed with a transfractal dimension d̃_f. In this work, we investigate dynamic processes (i.e., random walks) and topological properties (i.e., the Laplacian spectrum) and we show that, under proper conditions, the same scalings (ruled by the related dimensions) emerge for both fractal and transfractal dimensions.

The exact Laplacian spectrum for the Dyson hierarchical network

We consider the Dyson hierarchical graph , that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter σ ∈ (1/2, 1]. Exploiting the deterministic recursivity through which is built, we are able to derive explicitly the whole set of the eigenvalues and the eigenvectors for its Laplacian matrix. Given that the Laplacian operator is intrinsically implied in the analysis of dynamic processes (e.g., random walks) occurring on the graph, as well as in the investigation of the dynamical properties of connected structures themselves (e.g., vibrational structures and relaxation modes), this result allows addressing analytically a large class of problems. In particular, as examples of applications, we study the random walk and the continuous-time quantum walk embedded in , the relaxation times of a polymer whose structure is described by , and the community structure of in terms of modularity measures.

Relaxation dynamics of Sierpinski hexagon fractal polymer: Exact analytical results in the Rouse-type approach and numerical results in the Zimm-type approach

In this paper, we focus on the relaxation dynamics of Sierpinski hexagon fractal polymer. The relaxation dynamics of this fractal polymer is investigated in the framework of the generalized Gaussian structure model using both Rouse and Zimm approaches. In the Rouse-type approach, by performing real-space renormalization transformations, we determine analytically the complete eigenvalue spectrum of the connectivity matrix. Based on the eigenvalues obtained through iterative algebraic relations we calculate the averaged monomer displacement and the mechanical relaxation moduli (storage modulus and loss modulus). The evaluation of the dynamical properties in the Rouse-type approach reveals that they obey scaling in the intermediate time/frequency domain. In the Zimm-type approach, which includes the hydrodynamic interactions, the relaxation quantities do not show scaling. The theoretical findings with respect to scaling in the intermediate domain of the relaxation quantities are well supported by experimental results.

Extended Vicsek fractals: Laplacian spectra and their applications

Extended Vicsek fractals (EVF) are the structures constructed by introducing linear spacers into traditional Vicsek fractals. Here we study the Laplacian spectra of the EVF. In particularly, the recurrence relations for the Laplacian spectra allow us to obtain an analytic expression for the sum of all inverse nonvanishing Laplacian eigenvalues. This quantity characterizes the large-scale properties, such as the gyration radius of the polymeric structures, or the global mean-first passage time for the random walk processes. Introduction of the linear spacers leads to local heterogeneities, which reveal themselves, for example, in the dynamics of EVF under external forces.

Local orientational mobility in regular hyperbranched polymers

We study the dynamics of local bond orientation in regular hyperbranched polymers modeled by Vicsek fractals. The local dynamics is investigated through the temporal autocorrelation functions of single bonds and the corresponding relaxation forms of the complex dielectric susceptibility. We show that the dynamic behavior of single segments depends on their remoteness from the periphery rather than on the size of the whole macromolecule. Remarkably, the dynamics of the core segments (which are most remote from the periphery) shows a scaling behavior that differs from the dynamics obtained after structural average. We analyze the most relevant processes of single segment motion and provide an analytic approximation for the corresponding relaxation times. Furthermore, we describe an iterative method to calculate the orientational dynamics in the case of very large macromolecular sizes.

Dynamics of comb-of-comb networks

The dynamics of complex networks, a current hot topic in many scientific fields, is often coded through the corresponding Laplacian matrix. The spectrum of this matrix carries the main features of the networks' dynamics. Here we consider the deterministic networks which can be viewed as "comb-of-comb" iterative structures. For their Laplacian spectra we find analytical equations involving Chebyshev polynomials whose properties allow one to analyze the spectra in deep. Here, in particular, we find that in the infinite size limit the corresponding spectral dimension goes as d(s) → 2. The d(s) leaves its fingerprint on many dynamical processes, as we exemplarily show by considering the dynamical properties of polymer networks, including single monomer displacement under a constant force, mechanical relaxation, and fluorescence depolarization.

Equivalence between a generalized dendritic network and a set of one-dimensional networks as a ground of linear dynamics

It has been shown by some existing studies that some linear dynamical systems defined on a dendritic network are equivalent to those defined on a set of one-dimensional networks in special cases and this transformation to the simple picture, which we call linear chain (LC) decomposition, has a significant advantage in understanding properties of dendrimers. In this paper, we expand the class of LC decomposable system with some generalizations. In addition, we propose two general sufficient conditions for LC decomposability with a procedure to systematically realize the LC decomposition. Some examples of LC decomposable linear dynamical systems are also presented with their graphs. The generalization of the LC decomposition is implemented in the following three aspects: (i) the type of linear operators; (ii) the shape of dendritic networks on which linear operators are defined; and (iii) the type of symmetry operations representing the symmetry of the systems. In the generalization (iii), symmetry groups that represent the symmetry of dendritic systems are defined. The LC decomposition is realized by changing the basis of a linear operator defined on a dendritic network into bases of irreducible representations of the symmetry group. The achievement of this paper makes it easier to utilize the LC decomposition in various cases. This may lead to a further understanding of the relation between structure and functions of dendrimers in future studies.

Laplacian spectra of a class of small-world networks and their applications

One of the most crucial domains of interdisciplinary research is the relationship between the dynamics and structural characteristics. In this paper, we introduce a family of small-world networks, parameterized through a variable d controlling the scale of graph completeness or of network clustering. We study the Laplacian eigenvalues of these networks, which are determined through analytic recursive equations. This allows us to analyze the spectra in depth and to determine the corresponding spectral dimension. Based on these results, we consider the networks in the framework of generalized Gaussian structures, whose physical behavior is exemplified on the relaxation dynamics and on the fluorescence depolarization under quasiresonant energy transfer. Although the networks have the same number of nodes (beads) and edges (springs) as the dual Sierpinski gaskets, they display rather different dynamic behavior.

Two universality classes for random hyperbranched polymers

We grow AB2 random hyperbranched polymer structures in different ways and using different simulation methods. In particular we use a method of ad hoc construction of the connectivity matrix and the bond fluctuation model on a 3D lattice. We show that hyperbranched polymers split into two universality classes depending on the growth process. For a "slow growth" (SG) process where monomers are added sequentially to an existing molecule which strictly avoids cluster-cluster aggregation the resulting structures share all characteristic features with regular dendrimers. For a "quick growth" (QG) process which allows for cluster-cluster aggregation we obtain structures which can be identified as random fractals. Without excluded volume interactions the SG model displays a logarithmic growth of the radius of gyration with respect to the degree of polymerization while the QG model displays a power law behavior with an exponent of 1/4. By analyzing the spectral properties of the connectivity matrix we confirm the behavior of dendritic structures for the SG model and the corresponding fractal properties in the QG case. A mean field model is developed which explains the extension of the hyperbranched polymers in an athermal solvent for both cases. While the radius of gyration of the QG model shows a power-law behavior with the exponent value close to 4/5, the corresponding result for the SG model is a mixed logarithmic-power-law behavior. These different behaviors are confirmed by simulations using the bond fluctuation model. Our studies indicate that random sequential growth according to our SG model can be an alternative to the synthesis of perfect dendrimers.

Laplacian spectra of recursive treelike small-world polymer networks: analytical solutions and applications

A central issue in the study of polymer physics is to understand the relation between the geometrical properties of macromolecules and various dynamics, most of which are encoded in the Laplacian spectra of a related graph describing the macrostructural structure. In this paper, we introduce a family of treelike polymer networks with a parameter, which has the same size as the Vicsek fractals modeling regular hyperbranched polymers. We study some relevant properties of the networks and show that they have an exponentially decaying degree distribution and exhibit the small-world behavior. We then study the Laplacian eigenvalues and their corresponding eigenvectors of the networks under consideration, with both quantities being determined through the recursive relations deduced from the network structure. Using the obtained recursive relations we can find all the eigenvalues and eigenvectors for the networks with any size. Finally, as some applications, we use the eigenvalues to study analytically or semi-analytically three dynamical processes occurring in the networks, including random walks, relaxation dynamics in the framework of generalized Gaussian structure, as well as the fluorescence depolarization under quasiresonant energy transfer. Moreover, we compare the results with those corresponding to Vicsek fractals, and show that the dynamics differ greatly for the two network families, which thus enables us to distinguish between them.

Relaxation dynamics of scale-free polymer networks

We focus on polymer networks with a scale-free topology. In the framework of generalized Gaussian structures, by making use of the eigenvalue spectrum of the connectivity matrix, we determined numerically the averaged monomer displacement under external forces and the mechanical relaxation moduli (storage and loss modulus). First, we monitor these physical quantities and additionally the eigenvalue spectrum for structures of different sizes, but with the same γ, which is a parameter that measures the connectivity of the structure. Second, we vary the parameter γ, and we keep constant the size of the structures. This allows us to study in detail the crossover behavior from a simple linear chain to a starlike structure. As expected we encounter a more chainlike behavior for high values of γ, while for small values of γ a more starlike behavior is observed. In the intermediate time (frequency) domain, we encounter regions of constant slope for some intermediate values of γ.

Relaxation dynamics of a polymer network modeled by a multihierarchical structure

We numerically analyze the scaling behavior of experimentally accessible dynamical relaxation forms for polymer networks modeled by a finite multihierarchical structure. In the framework of generalized Gaussian structures, by making use of the eigenvalue spectrum of the connectivity matrix, we determine the averaged monomer displacement under local external forces as well as the mechanical relaxation quantities (storage and loss moduli). Hence we generalize the known analysis for both classes of fractals to the case of multihierarchical structure, for which even though we have a mixed growth algorithm, the above cited observables still give information about the two different underlying topologies. For very large lattices, reached via an algebraic procedure that avoids the numerical diagonalizations of the corresponding connectivity matrices, we depict the scaling of both component fractals in the intermediate time (frequency) domain, which manifests two different slopes.

Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices

The family of Vicsek fractals is one of the most important and frequently studied regular fractal classes, and it is of considerable interest to understand the dynamical processes on this treelike fractal family. In this paper, we investigate discrete random walks on the Vicsek fractals, with the aim to obtain the exact solutions to the global mean-first-passage time (GMFPT), defined as the average of first-passage time (FPT) between two nodes over the whole family of fractals. Based on the known connections between FPTs, effective resistance, and the eigenvalues of graph Laplacian, we determine implicitly the GMFPT of the Vicsek fractals, which is corroborated by numerical results. The obtained closed-form solution shows that the GMFPT approximately grows as a power-law function with system size (number of all nodes), with the exponent lies between 1 and 2. We then provide both the upper bound and lower bound for GMFPT of general trees, and show that the leading behavior of the upper bound is the square of system size and the dominating scaling of the lower bound varies linearly with system size. We also show that the upper bound can be achieved in linear chains and the lower bound can be reached in star graphs. This study provides a comprehensive understanding of random walks on the Vicsek fractals and general treelike networks.

Dynamics of Vicsek fractals, models for hyperbranched polymers

We consider the dynamics of Vicsek fractals of arbitrary connectivity, models for hyperbranched polymers. Their basic dynamical properties depend on their eigenvalue spectra, which can be determined iteratively. This paves the way for theoretical studies to very high precision for regular, finite, arbitrarily large hyperbranched structures.