Related papers: Trapping in complex networks
It has been well-known that many real networks are scale-free (SF) but extremely vulnerable against attacks. We investigate the robustness of connectivity and the lengths of the shortest loops in randomized SF networks with realistic…
We analyze the effects of electron-electron and electron-phonon interactions in the dynamics of a system of two or three electrons that can be trapped to a localized state and detrapped to ab extended band states of a quantum dot using a…
A many-body system of fermion atoms with a model interaction characterized by the scattering length $a$ is considered. We treat both $a$ and the density as parameters assuming that the system can be created artificially in a trap. If $a$ is…
With a simple attack and repair evolution model, we investigate the stability and structural changes of the Erdos-Renyi random graphs (RG) and Barabasi-Albert scale-free (SF) networks. We introduce a new quantity, invulnerability I(s), to…
In this thesis, we study three physically relevant models of strongly correlated random variables: trapped fermions, random matrices and random walks. In the first part, we show several exact mappings between the ground state of a trapped…
We study transport properties such as electrical and frictionless flow conductance on scale-free and Erdos-Renyi networks. We consider the conductance G between two arbitrarily chosen nodes where each link has the same unit resistance. Our…
We consider an excitatory random network of leaky integrate-and-fire pulse coupled neurons. The neurons are connected as in a directed Erd\"os-Renyi graph with average connectivity $<k>$ scaling as a power law with the number of neurons in…
We consider navigation or search schemes on networks which have a degree distribution of the form $P(k) \propto \exp(-k^\gamma)$. In addition, the linking probability is taken to be dependent on social distances and is governed by a…
We investigate saturation effects in susceptible-infected-susceptible (SIS) models of the spread of epidemics in heterogeneous populations. The structure of interactions in the population is represented by networks with connectivity…
In this paper, we present a detailed framework to analyze the evolution of the random topology of a time-varying wireless network via the information theoretic notion of entropy rate. We consider a propagation channel varying over time with…
We study the evolution of a random weighted network with complex nonlinear dynamics at each node, whose activity may cease as a result of interactions with other nodes. Starting from a knowledge of the micro-level behaviour at each node, we…
Many dynamical phenomena in complex systems concern spreading that plays out on top of networks with changing architecture over time -- commonly known as temporal networks. A complex system's proneness to facilitate spreading phenomena,…
Experiments on particles' motion in living cells show that it is often subdiffusive. This subdiffusion may be due to trapping, percolation-like structures, or viscoelatic behavior of the medium. While the models based on trapping (leading…
We study the intrinsic properties of attractors in the Boolean dynamics in complex network with scale-free topology, comparing with those of the so-called random Kauffman networks. We have numerically investigated the frozen and relevant…
Random network models play a prominent role in modeling, analyzing and understanding complex phenomena on real-life networks. However, a key property of networks is often neglected: many real-world networks exhibit spatial structure, the…
Dynamical scalings for the end-to-end distance $R_{ee}$ and the number of distinct visited nodes $N_v$ of random walks (RWs) on finite scale-free networks (SFNs) are studied numerically. $\left< R_{ee} \right>$ shows the dynamical scaling…
We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…
We study the structure of the load-based spanning tree (LST) that carries the maximum weight of the Erdos-Renyi (ER) random network. The weight of an edge is given by the edge-betweenness centrality, the effective number of shortest paths…
A new method called diffusion factorial moment (DFM) is used to obtain scaling features embedded in spectra of complex networks. For an Erdos-Renyi network with connecting probability $p_{ER} < \frac{1}{N}$, the scaling parameter is $\delta…
We study the level spacing distribution p(s) in the spectrum of random networks. According to our numerical results, the shape of p(s) in the Erdos-Renyi (E-R) random graph is determined by the average degree <k>, and p(s) undergoes a…