相关论文: Typical length scales in conducting disorderless n…

We study a stochastically-driven standard map. The addition of a noise term destroys the invariant manifolds that organize the phase space which allows for more widespread transport than in the noiseless case. Using appropriately defined…

We study a network of coupled logistic maps whose interactions occur with a certain distribution of delay times. The local dynamics is chaotic in the absence of coupling and thus the network is a paradigm of a complex system. There are two…

We investigate the structural organization of the point-to-point electric, diffusive or hydraulic transport in complex scale-free networks. The random choice of two nodes, a source and a drain, to which a potential difference is applied,…

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…

We study the statistical properties of the sampled scale-free networks, deeply related to the proper identification of various real-world networks. We exploit three methods of sampling and investigate the topological properties such as…

We study coupled maps on a Cayley tree, with local (nearest-neighbor) interactions, and with a variety of boundary conditions. The homogeneous state (where every lattice site has the same value) and the node-synchronized state (where sites…

In this review, we provide an account of the recent progress in understanding electronic transport in disordered graphene systems. Starting from a theoretical description that emphasizes the role played by band structure properties and…

In recent decades, much attention has been focused on the topic of optimal paths in weighted networks due to its broad scientific interest and technological applications. In this work we revisit the problem of the optimal path between two…

We study the influence of network topology and connectivity on the synchronization properties of chaotic logistic maps, interacting with random delay times. Four different types of topologies are investigated: two regular (a ring-type and a…

Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movement patterns are generated by a subset of automorphisms of the…

The crossover in energy level statistics of a quasi-1-dimensional disordered wire as a function of its length L is used, in order to derive its averaged localization length, without magnetic field, in a magnetic field and for moderate spin…

We study spatial networks constructed by randomly placing nodes on a manifold and joining two nodes with an edge whenever their distance is less than a certain cutoff. We derive the general expression for the connectivity distribution of…

We review our recent work on the synchronization of a network of delay-coupled maps, focusing on the interplay of the network topology and the delay times that take into account the finite velocity of propagation of interactions. We assume…

The propagation of an interacting particle pair in a disordered chain is characterized by a set of localization lengths which we define. The localization lengths are computed by a new decimation algorithm and provide a more comprehensive…

The existence of localization and mobility edges in one-dimensional lattices is commonly thought to depend on disorder (or quasidisorder). We investigate localization properties of a disorder-free lattice subject to an equally spaced…

According to the exact controllability theory, the controllability is investigated analytically for two typical types of self-similar bipartite networks, i.e., the classic deterministic scale-free networks and Cayley trees. Due to their…

We develop a formalism for mapping the exact dynamics of an ensemble of disordered quantum systems onto the dynamics of a single particle propagating along a semi-infinite lattice, with parameters determined by the probability distribution…

In this letter we study the conductance G through one-dimensional quantum wires with disorder configurations characterized by long-tailed distributions (Levy-type disorder). We calculate analytically the conductance distribution which…

We consider the role of network geometry in two types of diffusion processes: transport of constant-density information packets with queuing on nodes, and constant voltage-driven tunneling of electrons. The underlying network is a…

The purpose of this paper is to assess the statistical characterization of weighted networks in terms of the generalization of the relevant parameters, namely average path length, degree distribution and clustering coefficient. Although the…