相关论文: Collective navigation of complex networks: Partici…
Navigation on graphs is the problem how an agent walking on the graph can get from a source to a target with limited information about the graph. The information and the way to exploit it can vary. In this paper, we study navigation on…
During the last decade of network research focusing on structural and dynamical properties of networks, the role of network users has been more or less underestimated from the bird's-eye view of global perspective. In this era of global…
This paper mainly investigates why small-world networks are navigable and how to navigate small-world networks. We find that the navigability can naturally emerge from self-organization in the absence of prior knowledge about underlying…
We propose a dynamical process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of individuals are linked by a short chain of acquaintances computable…
Information routing is one of the main tasks in many complex networks with a communication function. Maps produced by embedding the networks in hyperbolic space can assist this task enabling the implementation of efficient navigation…
Navigability of networks, that is the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small-world networks…
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…
Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of…
To investigate the role of information flow in group formation, we introduce a model of communication and social navigation. We let agents gather information in an idealized network society, and demonstrate that heterogeneous groups can…
We model a system of networking agents that seek to optimize their centrality in the network while keeping their cost, the number of connections they are participating in, low. Unlike other game-theory based models for network evolution,…
Network navigability is a key feature of complex networked systems. For a network embedded in a geometrical space, maximization of greedy routing (GR) measures based on the node geometrical coordinates can ensure efficient greedy…
The real world is awash with multi-agent problems that require collective action by self-interested agents, from the routing of packets across a computer network to the management of irrigation systems. Such systems have local incentives…
Localization and tracking of moving nodes via network navigation gives rise to a new paradigm, where nodes exploit both temporal and spatial cooperation to infer their positions based on intra- and inter-node measurements. While such…
Greedy navigation/routing plays an important role in geometric routing of networks because of its locality and simplicity. This can operate in geometrically embedded networks in a distributed manner, distances are calculated based on…
Collaboration is a fundamental and essential characteristic of many complex systems, ranging from ant colonies to human societies. Each component within a complex system interacts with others, even at a distance, to accomplish a given task.…
We propose a information theoretical framework to capture transition and information costs of network navigation models. Based on the minimum description length principle and the Markov decision process, we demonstrate that efficient global…
The ultimate navigation efficiency of mobile robots in human environments will depend on how we will appraise them: merely as impersonal machines or as human-like agents. In the latter case, an agent may take advantage of the cooperative…
Information delivery in a network of agents is a key issue for large, complex systems that need to do so in a predictable, efficient manner. The delivery of information in such multi-agent systems is typically implemented through routing…
Today's networks consist of many autonomous entities that follow their own objectives, i.e., smart devices or parts of large AI systems, that are interconnected. Given the size and complexity of most communication networks, each entity…
We investigate efficient methods for packets to navigate in complex networks. The packets are assumed to have memory, but no previous knowledge of the graph. We assume the graph to be indexed, i.e. every vertex is associated with a number…