Results 1  10
of
269
The structure and function of complex networks
 SIAM REVIEW
, 2003
"... 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 of these systems. Here we review developments in this field, ..."
Abstract

Cited by 1415 (9 self)
 Add to MetaCart
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 of these systems. Here we review developments in this field, including such concepts as the smallworld effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Evolution of networks
 Adv. Phys
, 2002
"... We review the recent fast progress in statistical physics of evolving networks. Interest has focused mainly on the structural properties of random complex networks in communications, biology, social sciences and economics. A number of giant artificial networks of such a kind came into existence rece ..."
Abstract

Cited by 269 (2 self)
 Add to MetaCart
We review the recent fast progress in statistical physics of evolving networks. Interest has focused mainly on the structural properties of random complex networks in communications, biology, social sciences and economics. A number of giant artificial networks of such a kind came into existence recently. This opens a wide field for the study of their topology, evolution, and complex processes occurring in them. Such networks possess a rich set of scaling properties. A number of them are scalefree and show striking resilience against random breakdowns. In spite of large sizes of these networks, the distances between most their vertices are short — a feature known as the “smallworld” effect. We discuss how growing networks selforganize into scalefree structures and the role of the mechanism of preferential linking. We consider the topological and structural properties of evolving networks, and percolation in these networks. We present a number of models demonstrating the main features of evolving networks and discuss current approaches for their simulation and analytical study. Applications of the general results to particular networks in Nature are discussed. We demonstrate the generic connections of the network growth processes with the general problems
Flocking for multiagent dynamic systems: Algorithms and theory
 IEEE Transactions on Automatic Control
, 2006
"... Submitted to the IEEE Transactions on Automatic Control Technical Report CITCDS 2004005 In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of flocking in freespace and presence of multiple obstacles are considered. We present th ..."
Abstract

Cited by 151 (1 self)
 Add to MetaCart
Submitted to the IEEE Transactions on Automatic Control Technical Report CITCDS 2004005 In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of flocking in freespace and presence of multiple obstacles are considered. We present three flocking algorithms: two for freeflocking and one for constrained flocking. A comprehensive analysis of the first two algorithms is provided. We demonstrate the first algorithm embodies all three rules of Reynolds. This is a formal approach to extraction of interaction rules that lead to the emergence of collective behavior. We show that the first algorithm generically leads to regular fragmentation, whereas the second and third algorithms both lead to flocking. A systematic method is provided for construction of cost functions (or collective potentials) for flocking. These collective potentials penalize deviation from a class of latticeshape objects called αlattices. We use a multispecies framework for construction of collective potentials that consist of flockmembers, or αagents, and virtual agents associated with αagents called β and γagents. We show that the tracking/migration problem for flocks can be solved using an algorithm with a peertopeer architecture. Each node (or macroagent) of this peertopeer network is the aggregation of all three species of agents. The implication of this fact is that “flocks
Comparing community structure identification
 Journal of Statistical Mechanics: Theory and Experiment
, 2005
"... ..."
Random graph models of social networks
"... We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predic ..."
Abstract

Cited by 141 (1 self)
 Add to MetaCart
We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of realworld social networks and find that in some cases the models are in remarkable agreement with the data, while in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.
The LargeScale Structure of Semantic Networks: Statistical Analyses and a Model of Semantic Growth
 Cognitive Science
"... We present statistical analyses of the largescale structure of three types of semantic networks: word associations, WordNet, and Roget's thesaurus. We show that they have a smallworld structure, characterized by sparse connectivity, short average pathlengths between words, and strong local clu ..."
Abstract

Cited by 122 (1 self)
 Add to MetaCart
We present statistical analyses of the largescale structure of three types of semantic networks: word associations, WordNet, and Roget's thesaurus. We show that they have a smallworld structure, characterized by sparse connectivity, short average pathlengths between words, and strong local clustering. In addition, the distributions of the number of connections follow power laws that indicate a scalefree pattern of connectivity, with most nodes having relatively few connections joined together through a small number of hubs with many connections. These regularities have also been found in certain other complex natural networks, such as the world wide web, but they are not consistent with many conventional models of semantic organization, based on inheritance hierarchies, arbitrarily structured networks, or highdimensional vector spaces. We propose that these structures reflect the mechanisms by which semantic networks grow. We describe a simple model for semantic growth, in which each new word or concept is connected to an existing network by differentiating the connectivity pattern of an existing node. This model generates appropriate smallworld statistics and powerlaw connectivity distributions, and also suggests one possible mechanistic basis for the effects of learning history variables (ageofacquisition, usage frequency) on behavioral performance in semantic processing tasks.
Microscopic Evolution of Social Networks
, 2008
"... We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at such a large scale, we study individual node arrival and edge creation processes that collectively lead to macroscopic pr ..."
Abstract

Cited by 107 (5 self)
 Add to MetaCart
We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at such a large scale, we study individual node arrival and edge creation processes that collectively lead to macroscopic properties of networks. Using a methodology based on the maximumlikelihood principle, we investigate a wide variety of network formation strategies, and show that edge locality plays a critical role in evolution of networks. Our findings supplement earlier network models based on the inherently nonlocal preferential attachment. Based on our observations, we develop a complete model of network evolution, where nodes arrive at a prespecified rate and select their lifetimes. Each node then independently initiates edges according to a “gap” process, selecting a destination for each edge according to a simple triangleclosing model free of any parameters. We show analytically that the combination of the gap distribution with the node lifetime leads to a power law outdegree distribution that accurately reflects the true network in all four cases. Finally, we give model parameter settings that allow automatic evolution and generation of realistic synthetic networks of arbitrary scale.
Computing communities in large networks using random walks
 J. of Graph Alg. and App. bf
, 2004
"... Dense subgraphs of sparse graphs (communities), which appear in most realworld complex networks, play an important role in many contexts. Computing them however is generally expensive. We propose here a measure of similarities between vertices based on random walks which has several important advan ..."
Abstract

Cited by 98 (2 self)
 Add to MetaCart
Dense subgraphs of sparse graphs (communities), which appear in most realworld complex networks, play an important role in many contexts. Computing them however is generally expensive. We propose here a measure of similarities between vertices based on random walks which has several important advantages: it captures well the community structure in a network, it can be computed efficiently, and it can be used in an agglomerative algorithm to compute efficiently the community structure of a network. We propose such an algorithm, called Walktrap, which runs in time O(mn 2) and space O(n 2) in the worst case, and in time O(n 2 log n) and space O(n 2) in most realworld cases (n and m are respectively the number of vertices and edges in the input graph). Extensive comparison tests show that our algorithm surpasses previously proposed ones concerning the quality of the obtained community structures and that it stands among the best ones concerning the running time.
Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks
, 2002
"... We consider a routing problem in the context of large scale networks with uncontrolled dynamics. A case of uncontrolled dynamics that has been studied extensively is that of mobile nodes, as this is typically the case in cellular and mobile adhoc networks. In this paper however we study routing in ..."
Abstract

Cited by 89 (3 self)
 Add to MetaCart
We consider a routing problem in the context of large scale networks with uncontrolled dynamics. A case of uncontrolled dynamics that has been studied extensively is that of mobile nodes, as this is typically the case in cellular and mobile adhoc networks. In this paper however we study routing in the presence of a different type of dynamics: nodes do not move, but instead switch between active and inactive states at random times. Our interest in this case is motivated by the behavior of sensor nodes powered by renewable sources, such as solar cells or ambient vibrations. In this paper we formalize the corresponding routing problem as a problem of constructing suitably constrained random walks on random dynamic graphs. We argue that these random walks should be designed so that their resulting invariant distribution achieves a certain load balancing property, and we give simple distributed algorithms to compute the local parameters for the random walks that achieve the sought behavior. A truly novel feature of our formulation is that the algorithms we obtain are able to route messages along all possible routes between a source and a destination node, without performing explicit route discovery/repair computations, and without maintaining explicit state information about available routes at the nodes. To the best of our knowledge, these are the first algorithms that achieve true multipath routing (in a statistical sense), at the complexity of simple stateless operations.
The Small World of Human Language
 Proceedings of The Royal Society of London. Series B, Biological Sciences
, 2001
"... this paper, we show that the cooccurrence of words in sentences relies on the network structure of the lexicon, the properties of which are analysed in depth. As we will show in this paper, human language can be described in terms of a graph of word interactions. This graph has some unexpected prop ..."
Abstract

Cited by 81 (5 self)
 Add to MetaCart
this paper, we show that the cooccurrence of words in sentences relies on the network structure of the lexicon, the properties of which are analysed in depth. As we will show in this paper, human language can be described in terms of a graph of word interactions. This graph has some unexpected properties (shared by other biological and technological networks (Amaral et al. 2000; Strogatz 2001)) that might underlie its diversity and exibility, and create new questions about its origins and organization