Searcharxiv⌕ Search

arXiv subjects

Roberto F. S. Andrade

Publications and source records attributed to Roberto F. S. Andrade.

28 records · Page 2Linked to original sources

The dynamics of the HIV infection: a time-delay differential equation approach

In this work we introduce a differential equation model with time-delay that describes the three-stage dynamics and the two time scales observed in HIV infection. Assuming that the virus has high mutation and rapid reproduction rates that stress the immune system throughout the successive activation of new responses to new undetectable strains, the delay term describes the time interval necessary to mount new specific immune responses. This single term increases the number of possible solutions and changes the phase space dynamics if compared to the model without time delay. We observe very slow transits near the unstable fixed point, corresponding to a healthy state, and long time decay to the stable fixed point that corresponds to the infected state. In contrast to the results obtained for models using regular ODE, which only allow for partial descriptions of the course of the infection, our model describes the entire course of infection observed in infected patients: the primary infection, the latency period and the onset of acquired immunodeficiency syndrome (AIDS). The model also describes other scenarios, such as the very fast progression to the disease and the less common outcome in which, although the patient is exposed to HIV, he/she does not develop the disease.

physics.bio-ph↗

Localization properties of a tight-binding electronic model on the Apollonian network

An investigation on the properties of electronic states of a tight-binding Hamiltonian on the Apollonian network is presented. This structure, which is defined based on the Apollonian packing problem, has been explored both as a complex network, and as a substrate, on the top of which physical models can defined. The Schrodinger equation of the model, which includes only nearest neighbor interactions, is written in a matrix formulation. In the uniform case, the resulting Hamiltonian is proportional to the adjacency matrix of the Apollonian network. The characterization of the electronic eigenstates is based on the properties of the spectrum, which is characterized by a very large degeneracy. The $2π/3$ rotation symmetry of the network and large number of equivalent sites are reflected in all eigenstates, which are classified according to their parity. Extended and localized states are identified by evaluating the participation rate. Results for other two non-uniform models on the Apollonian network are also presented. In one case, interaction is considered to be dependent of the node degree, while in the other one, random on-site energies are considered.

cond-mat.dis-nn↗

What are the Best Hierarchical Descriptors for Complex Networks?

This work reviews several hierarchical measurements of the topology of complex networks and then applies feature selection concepts and methods in order to quantify the relative importance of each measurement with respect to the discrimination between four representative theoretical network models, namely Erdös-Rényi, Barabási-Albert, Watts-Strogatz as well as a geographical type of network. The obtained results confirmed that the four models can be well-separated by using a combination of measurements. In addition, the relative contribution of each considered feature for the overall discrimination of the models was quantified in terms of the respective weights in the canonical projection into two dimensions, with the traditional clustering coefficient, hierarchical clustering coefficient and neighborhood clustering coefficient resulting particularly effective. Interestingly, the average shortest path length and hierarchical node degrees contributed little for the separation of the four network models.

cond-mat.dis-nn↗

Mapping dynamical systems onto complex networks

A procedure to characterize chaotic dynamical systems with concepts of complex networks is pursued, in which a dynamical system is mapped onto a network. The nodes represent the regions of space visited by the system, while edges represent the transitions between these regions. Parameters used to quantify the properties of complex networks, including those related to higher order neighborhoods, are used in the analysis. The methodology is tested for the logistic map, focusing the onset of chaos and chaotic regimes. It is found that the corresponding networks show distinct features, which are associated to the particular type of dynamics that have generated them.

cond-mat.stat-mech↗

Analytical approach to directed sandpile models on the Apollonian network

We investigate a set of directed sandpile models on the Apollonian network, which are inspired on the work by Dhar and Ramaswamy (PRL \textbf{63}, 1659 (1989)) for Euclidian lattices. They are characterized by a single parameter $q$, that restricts the number of neighbors receiving grains from a toppling node. Due to the geometry of the network, two and three point correlation functions are amenable to exact treatment, leading to analytical results for the avalanche distributions in the limit of an infinite system, for $q=1,2$. The exact recurrence expressions for the correlation functions are numerically iterated to obtain results for finite size systems, when larger values of $q$ are considered. Finally, a detailed description of the local flux properties is provided by a multifractal scaling analysis.

cond-mat.stat-mech↗

Characterization of complex networks by higher order neighborhood properties

A concept of higher order neighborhood in complex networks, introduced previously (PRE \textbf{73}, 046101, (2006)), is systematically explored to investigate larger scale structures in complex networks. The basic idea is to consider each higher order neighborhood as a network in itself, represented by a corresponding adjacency matrix. Usual network indices are then used to evaluate the properties of each neighborhood. Results for a large number of typical networks are presented and discussed. Further, the information from all neighborhoods is condensed in a single neighborhood matrix, which can be explored for visualizing the neighborhood structure. On the basis of such representation, a distance is introduced to compare, in a quantitative way, how far apart networks are in the space of neighborhood matrices. The distance depends both on the network topology and the adopted node numbering. Given a pair of networks, a Monte Carlo algorithm is developed to find the best numbering for one of them, holding fixed the numbering of the second network, obtaining a projection of the first one onto the pattern of the other. The minimal value found for the distance reflects differences in the neighborhood structures of the two networks that arise from distinct topologies. Examples are worked out allowing for a quantitative comparison for distances among a set of distinct networks.

cond-mat.stat-mech↗

Critical exponents for the long-range Ising chain using a transfer matrix approach

The critical behavior of the Ising chain with long-range ferromagnetic interactions decaying with distance $r^α$, $1<α<2$, is investigated using a numerically efficient transfer matrix (TM) method. Finite size approximations to the infinite chain are considered, in which both the number of spins and the number of interaction constants can be independently increased. Systems with interactions between spins up to 18 sites apart and up to 2500 spins in the chain are considered. We obtain data for the critical exponents $ν$ associated with the correlation length based on the Finite Range Scaling (FRS) hypothesis. FRS expressions require the evaluation of derivatives of the thermodynamical properties, which are obtained with the help of analytical recurrence expressions obtained within the TM framework. The Van den Broeck extrapolation procedure is applied in order to estimate the convergence of the exponents. The TM procedure reduces the dimension of the matrices and circumvents several numerical matrix operations.

cond-mat.stat-mech↗

Magnetic models on Apollonian networks

Thermodynamic and magnetic properties of Ising models defined on the triangular Apollonian network are investigated. This and other similar networks are inspired by the problem of covering an Euclidian domain with circles of maximal radii. Maps for the thermodynamic functions in two subsequent generations of the construction of the network are obtained by formulating the problem in terms of transfer matrices. Numerical iteration of this set of maps leads to exact values for the thermodynamic properties of the model. Different choices for the coupling constants between only nearest neighbors along the lattice are taken into account. For both ferromagnetic and anti-ferromagnetic constants, long range magnetic ordering is obtained. With exception of a size dependent effective critical behavior of the correlation length, no evidence of asymptotic criticality was detected.

cond-mat.stat-mech↗

Mother wavelet functions generalized through q-exponentials

We generalize some widely used mother wavelets by means of the q-exponential function $e_q^x \equiv [1+(1-q)x]^{1/(1-q)}$ ($q \in {\mathbb R}$, $e_1^x=e^x$) that emerges from nonextensive statistical mechanics. Particularly, we define extended versions of the mexican hat and the Morlet wavelets. We also introduce new wavelets that are $q$-generalizations of the trigonometric functions. All cases reduce to the usual ones as $q \to 1$. Within nonextensive statistical mechanics, departures from unity of the entropic index q are expected in the presence of long-range interactions, long-term memory, multi-fractal structures, among others. Consistently the analysis of signals associated with such features is hopefully improved by proper tuning of the value of q. We exemplify with the WTMM Method for mono- and multi-fractal self-affine signals.

cond-mat.stat-mech↗

Apollonian networks

We introduce a new family of networks, the Apollonian networks, that are simultaneously scale-free, small world, Euclidean, space-filling and matching graphs. These networks have a wide range of applications ranging from the description of force chains in polydisperse granular packings and geometry of fully fragmented porous media, to hierarchical road systems and area-covering electrical supply networks. Some of the properties of these networks, namely, the connectivity exponent, the clustering coefficient, and the shortest path are calculated and found to be particularly rich. The percolation, the electrical conduction and the Ising models on such networks are also studied and found to be quite peculiar. Consequences for applications are also discussed.

cond-mat.dis-nn↗