Related papers: Diffusion-annihilation proecesses in weighted scal…
Preferential attachment is one possible way to obtain a scale-free network. We develop a self-consistent method to determine whether preferential attachment occurs during the growth of a network, and to extract the preferential attachment…
By numerical simulations, we investigate the onset of synchronization of networked phase oscillators under two different weighting schemes. In scheme-I, the link weights are correlated to the product of the degrees of the connected nodes,…
We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in…
Very often, when studying topological or dynamical properties of random scale-free networks, it is tacitly assumed that degree-degree correlations are not present. However, simple constraints, such as the absence of multiple edges and…
We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the…
From the proliferative mechanisms generating neurons from progenitor cells to neuron migration and synaptic connection formation, several vicissitudes culminate in the mature brain. Both component loss and gain remain ubiquitous during…
We study the detailed mechanism of the failure of scale-free networks under intentional attacks. Although it is generally accepted that such networks are very sensitive to targeted attacks, we show that for a particular type of structure…
We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…
We study the pairwise annihilation process $A+A\to$ inert of a number of random walkers, which originally are localized in a small region in space. The size of the colony and the typical distance between particles increases with time and,…
We study the realizability of scale free-networks with a given degree sequence, showing that the fraction of realizable sequences undergoes two first-order transitions at the values 0 and 2 of the power-law exponent. We substantiate this…
Discrete element method simulations of confined bidisperse granular shear flows elucidate the balance between diffusion and segregation that can lead to either mixed or segregated states, depending on confining pressure. Results indicate…
Critical behavior of the contact process is studied in annealed scale-free networks by mapping it on the random walk problem. We obtain the analytic results for the critical scaling, using the event-driven dynamics approach. These results…
We investigate the totally asymmetric simple exclusion process on closed and directed random regular networks, which is a simple model of active transport in the one-dimensional segments coupled by junctions. By a pair mean-field theory and…
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,…
Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered.…
We introduce a correlated static model and investigate a percolation transition. The model is a modification of the static model and is characterized by assortative degree-degree correlation. As one varies the edge density, the network…
We generalize the degree-organizational view of real-world networks with broad degree-distributions in a landscape analogue with mountains (high-degree nodes) and valleys (low-degree nodes). For example, correlated degrees between adjacent…
Random scale-free overlay topologies provide a number of properties like for example high resilience against failures of random nodes, small (average) diameter as well as good expansion and congestion characteristics that make them…
We consider the inclusion process on the complete graph with vanishing diffusivity, which leads to condensation of particles in the thermodynamic limit. Describing particle configurations in terms of size-biased and appropriately scaled…
Cellular metabolic networks exhibit scale-free topologies with power-law degree distributions across diverse organisms. Although such topologies are often linked to mutational robustness and evolutionary advantage, their role in metabolic…