We develop a comprehensive framework for analyzing full-record statistics, covering record counts M(t_{1}),M(t_{2}),...
View Article and Find Full Text PDFVery recently, a fundamental observable has been introduced and analyzed to quantify the exploration of random walks: the time τ_{k} required for a random walk to find a site that it never visited previously, when the walk has already visited k distinct sites. Here, we tackle the natural issue of the statistics of M_{n}, the longest duration out of τ_{0},…,τ_{n-1}. This problem belongs to the active field of extreme value statistics, with the difficulty that the random variables τ_{k} are both correlated and nonidentically distributed.
View Article and Find Full Text PDFHow long is needed for an observable to exceed its previous highest value and establish a new record? This time, known as the age of a record plays a crucial role in quantifying record statistics. Until now, general methods for determining record age statistics have been limited to observations of either independent random variables or successive positions of a Markovian (memoryless) random walk. Here we develop a theoretical framework to determine record age statistics in the presence of memory effects for continuous non-smooth processes that are asymptotically scale-invariant.
View Article and Find Full Text PDFThe territory explored by a random walk is a key property that may be quantified by the number of distinct sites that the random walk visits up to a given time. We introduce a more fundamental quantity, the time τ required by a random walk to find a site that it never visited previously when the walk has already visited n distinct sites, which encompasses the full dynamics about the visitation statistics. To study it, we develop a theoretical approach that relies on a mapping with a trapping problem, in which the spatial distribution of traps is continuously updated by the random walk itself.
View Article and Find Full Text PDFWe develop a framework to determine the complete statistical behavior of a fundamental quantity in the theory of random walks, namely, the probability that n_{1},n_{2},n_{3},...
View Article and Find Full Text PDFFunctionalizing the internal structure of classical dendrimers is a new way of tailoring their properties. Using atomistic molecular dynamics simulations, we investigate the rheological behavior of functionalized dendrimer (FD) melts obtained by modifying the branching of carbosilane dendrimers (CSD). The time (relaxation modulus ()) and frequency (storage ' and loss '' moduli) dependencies of the dynamic modulus are obtained.
View Article and Find Full Text PDFChemical reactions generically require that particles come into contact. In practice, reaction is often imperfect and can necessitate multiple random encounters between reactants. In confined geometries, despite notable recent advances, there is to date no general analytical treatment of such imperfect transport-limited reaction kinetics.
View Article and Find Full Text PDFWe investigate the dynamics of fractals and other networks in a viscoelastic and active environment. The viscoelastic dynamics is modeled based on the generalized Langevin equation, where the activity is introduced to it by means of the exponentially correlated noise. The intramolecular interactions are taken into account by the bead-spring picture.
View Article and Find Full Text PDFWe study marginally compact macromolecular trees that are created by means of two different fractal generators. In doing so, we assume Gaussian statistics for the vectors connecting nodes of the trees. Moreover, we introduce bond-bond correlations that make the trees locally semiflexible.
View Article and Find Full Text PDFWe focus on macromolecules which are modeled as sequentially growing dual scale-free networks. The dual networks are built by replacing star-like units of the primal treelike scale-free networks through rings, which are then transformed in a small-world manner up to the complete graphs. In this respect, the parameter γ describing the degree distribution in the primal treelike scale-free networks regulates the size of the dual units.
View Article and Find Full Text PDFExtended 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.
View Article and Find Full Text PDFWe 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.
View Article and Find Full Text PDFWe study the dynamics of semiflexible hyperbranched macromolecules having only dendritic units and no linear spacers, while the structure of these macromolecules is modeled through T-fractals. We construct a full set of eigenmodes of the dynamical matrix, which couples the set of Langevin equations. Based on the ensuing relaxation spectra, we analyze the mechanical relaxation moduli.
View Article and Find Full Text PDFThe internally functionalized dendrimers are novel polymers that differ from conventional dendrimers by having additional functional units which do not branch out further. We investigate the dynamics of these structures with the inclusion of local semiflexibility and analyze their eigenmodes. The functionalized units clearly manifest themselves leading to a group of eigenvalues which are not present for homogeneous dendrimers.
View Article and Find Full Text PDFThe 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.
View Article and Find Full Text PDFWe study the transport efficiency of excitations on complex quantum networks with loops. For this we consider sequentially growing networks with different topologies of the sequential subgraphs. This can lead either to a universal complete breakdown of transport for complete-graph-like sequential subgraphs or to optimal transport for ringlike sequential subgraphs.
View Article and Find Full Text PDFWe consider the kinetics of first contact between two monomers of the same macromolecule. Relying on a fractal description of the macromolecule, we develop an analytical method to compute the mean first contact time for various molecular sizes. In our theoretical description, the non-Markovian feature of monomer motion, arising from the interactions with the other monomers, is captured by accounting for the nonequilibrium conformations of the macromolecule at the very instant of first contact.
View Article and Find Full Text PDFWe consider single-particle quantum transport on parametrized complex networks. Based on general arguments regarding the spectrum of the corresponding Hamiltonian, we derive bounds for a measure of the global transport efficiency defined by the time-averaged return probability. For treelike networks, we show analytically that a transition from efficient to inefficient transport occurs depending on the (average) functionality of the nodes of the network.
View Article and Find Full Text PDFOne 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.
View Article and Find Full Text PDFOne of the fundamental issues in polymer physics is to reveal the relation between the structures of macromolecules and their various properties. In this report, we study the dynamical properties of a family of deterministically growing semiflexible treelike polymer networks, which are built in an iterative method. From the analysis of the corresponding dynamical matrix we derive the solution for its eigenvalues and their multiplicities, making use of a combined numerical and analytical approach.
View Article and Find Full Text PDFScale-free networks are structures, whose nodes have degree distributions that follow a power law. Here we focus on the dynamics of semiflexible scale-free polymer networks. The semiflexibility is modeled in the framework of [M.
View Article and Find Full Text PDFSemiflexible polymer rings whose bonds obey both angular and dihedral restrictions [M. Dolgushev and A. Blumen, J.
View Article and Find Full Text PDFWe study the orientational properties of labeled segments in semiflexible dendrimers making use of the viscoelastic approach of Dolgushev and Blumen [J. Chem. Phys.
View Article and Find Full Text PDFHere we consider the dynamics of semiflexible polymers subject both to angular and to dihedral constraints. We succeed in obtaining analytically the dynamical matrix of such systems by extending the formalism developed by Dolgushev and Blumen [J. Chem.
View Article and Find Full Text PDFWe study the dynamics of semiflexible Vicsek fractals (SVF) following the framework established by Dolgushev and Blumen [J. Chem. Phys.
View Article and Find Full Text PDF