Related papers: Scaling in directed dynamical small-world networks…
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 study the decay process for the reaction-diffusion process of three species on the small-world network. The decay process is manipulated from the deterministic rate equation of three species in the reaction-diffusion system. The particle…
Random scale-free networks are ultrasmall worlds. The average length of the shortest paths in networks of size N scales as lnlnN. Here we show that these ultrasmall worlds can be navigated in ultrashort time. Greedy routing on scale-free…
Complex networks underlie an enormous variety of social, biological, physical, and virtual systems. A profound complication for the science of complex networks is that in most cases, observing all nodes and all network interactions is…
We present an exact description of a crossover between two different regimes of simple analogies of small-world networks. Each of the sites chosen with a probability $p$ from $n$ sites of an ordered system defined on a circle is connected…
We introduce a minimal model of small-world growing network generated by attaching to edges. The produced network is a plane graph which exists in real-life world. We obtain the analytic results of degree distribution decaying exponentially…
In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free…
We propose a procedure to generate dynamical networks with bursty, possibly repetitive and correlated temporal behaviors. Regarding any weighted directed graph as being composed of the accumulation of paths between its nodes, our…
The problem of predicting links in large networks is an important task in a variety of practical applications, including social sciences, biology and computer security. In this paper, statistical techniques for link prediction based on the…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
Data-driven epidemic simulation helps better policymaking. Compared with macro-scale simulations driven by statistical data, individual-level GPS data can afford finer and spatialized results. However, the big GPS data, usually collected…
We obtain the Brownian net of Sun and Swart (2008) as the scaling limit of the paths traced out by a system of continuous (one-dimensional) space and time branching and coalescing random walks. This demonstrates a certain universality of…
Networks are ubiquitous throughout science and engineering. A number of methods, including some from our own group, have explored how one goes about computing or predicting the dynamics of networks given information about internal models of…
The formation of network structure is mainly influenced by an individual node's activity and its memory, where activity can usually be interpreted as the individual inherent property and memory can be represented by the interaction strength…
A model for the spread of an infection is analyzed for different population structures. The interactions within the population are described by small world networks, ranging from ordered lattices to random graphs. For the more ordered…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
The network-based model of social contagion has revolved around information on local interactions; its central focus has been on network topological properties shaping the local interactions and, ultimately, social contagion outcomes. We…
This paper suggests a generalized distribution of response times to new information $\sim t^{-b}$ for human populations in the absence of deadlines. This has important implications for psychological and social studies as well the study of…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…