Related papers: Orientation in Social Networks
It is commonly known that there exist short paths between vertices in a network showing the small-world effect. Yet vertices, for example, the individuals living in society, usually are not able to find the shortest paths, due to the very…
To comprehend the multipartite organization of large-scale biological and social systems, we introduce a new information theoretic approach that reveals community structure in weighted and directed networks. The method decomposes a network…
Great part of the interest in complex networks has been motivated by the presence of structured, frequently non-uniform, connectivity. Because diverse connectivity patterns tend to result in distinct network dynamics, and also because they…
We present a study of information flow that takes into account the observation that an item relevant to one person is more likely to be of interest to individuals in the same social circle than those outside of it. This is due to the fact…
We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neighbor of maximal degree, as long as the degree is increasing.…
Characterizing large online social networks (OSNs) through node querying is a challenging task. OSNs often impose severe constraints on the query rate, hence limiting the sample size to a small fraction of the total network. Various ad-hoc…
Routing information through networks is a universal phenomenon in both natural and manmade complex systems. When each node has full knowledge of the global network connectivity, finding short communication paths is merely a matter of…
We develop a network in which the natural numbers are the vertices. We use the decomposition of natural numbers by prime numbers to establish the connections. We perform data collapse and show that the degree distribution of these networks…
Computer experiments are performed to investigate why protein contact networks (networks induced by spatial contacts between amino acid residues of a protein) do not have shorter average shortest path lengths in spite of their importance to…
Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route, or navigate, between vertices in few steps even with very…
We propose a simple growing model for the evolution of small-world networks. It is introduced as a modified BA model in which all the edges connected to the new nodes are made locally to the creator and its nearest neighbors. It is found…
Properties of networks are often characterized in terms of features such as node degree distributions, average path lengths, diameters, or clustering coefficients. Here, we study shortest path length distributions. On the one hand, average…
Real-world networks are often organized as modules or communities of similar nodes that serve as functional units. These networks are also rich in content, with nodes having distinguishing features or attributes. In order to discover a…
We study the dynamics of the processes in the small-world networks with a power-law degree distribution where every node is considered to be in one of the two available statuses. We present an algorithm for generation of such network and…
In many real, directed networks, the strongly connected component of nodes which are mutually reachable is very small. This does not fit with current theory, based on random graphs, according to which strong connectivity depends on mean…
Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior…
Many real world systems or web services can be represented as a network such as social networks and transportation networks. In the past decade, many algorithms have been developed to detect the communities in a network using connections…
Self-organization of robust and efficient networks is important for a future design of communication or transportation systems, because both characteristics are not coexisting in many real networks. As one of the candidates for the…
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…
This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path…