Related papers: Login times in e-mail servers are scale-free
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
Global observations of ocean swell, from satellite Synthetic Aperture Radar data, are used to estimate the dissipation of swell energy for a number of storms. Swells can be very persistent with energy e-folding scales exceeding 20,000 km.…
We investigate a growing network model that combines preferential and uniform attachment with two distinct mechanisms of edge deletion. In addition to the usual uniform probability edge deletion, we introduce a novel node-based rule in…
We present an analysis of the classical contact process on scale-free networks. A mean-field study, both for finite and infinite network sizes, yields an absorbing-state phase transition at a finite critical value of the control parameter,…
We study level number variance in a two-dimensional random matrix model characterized by a power-law decay of the matrix elements. The amplitude of the decay is controlled by the parameter b. We find analytically that at small values of b…
We analyze the geometry of the species- and genotype-size distribution in evolving and adapting populations of single-stranded self-replicating genomes: here programs in the Avida world. We find that a scale-free distribution (power law)…
In this paper we model the tomography of scale free networks by studying the structure of layers around an arbitrary network node. We find, both analytically and empirically, that the distance distribution of all nodes from a specific…
In this manuscript we present a comparative study about the determination of the relaxation (\textit{i.e.}, independence) time scales obtained from the correlation function, the mutual information, and a criterion based on the evaluation of…
This paper considers the mean waiting times in discrete-time preemptive-resume and nonpreemptive priority single-server queues fed by K independent batch Markovian arrival streams with geometrically distributed idle periods. While being…
Based on the minute-by-minute data of the Hang Seng Index in Hong Kong and the analysis of probability distribution and autocorrelations, we find that the index fluctuations for the first few minutes of daily opening show behaviors very…
Using Monte Carlo simulations we study the phase ordering dynamics of a \textit{multi}-species system modeled via the prototype $q$-state Potts model. In such a \textit{multi}-species system, we identify a spin states or species as the…
A many-server queueing system is considered in which customers arrive according to a renewal process and have service and patience times that are drawn from two independent sequences of independent, identically distributed random variables.…
A transfer matrix scaling technique is developed for randomly diluted systems, and applied to the site-diluted Ising model on a square lattice in two dimensions. For each allowed disorder configuration between two adjacent columns, the…
We investigate the statistics of the number of time slots $T$ that it takes a packet to travel through a chain of wireless relays. Derivations are performed assuming an interference model for which interference possesses spatiotemporal…
We provide a novel expression of the scale function for a L\'evy processes with negative phase-type jumps. It is in terms of a certain transition rate matrix which is explicit up to a single positive number. A monotone iterative scheme for…
Almost all of us have multiple cyberspace identities, and these {\em cyber}alter egos are networked together to form a vast cyberspace social network. This network is distinct from the world-wide-web (WWW), which is being queried and mined…
Motivated by distributed schedulers that combine the power-of-d-choices with late binding and systems that use replication with cancellation-on-start, we study the performance of the LL(d) policy which assigns a job to a server that…
We present a model for growing information networks where the ageing of a node depends on the time at which it entered the network and on the last time it was cited. The model is shown to undergo a transition from a small-world to…
We examine lossless data compression from an average delay perspective. An encoder receives input symbols one per unit time from an i.i.d. source and submits binary codewords to a FIFO buffer that transmits bits at a fixed rate to a…
We present the simulation of the time evolution of the distance matrix. The result is the node-node distance distribution for various kinds of networks. For the exponential trees, analytical formulas are derived for the moments of the…