相关论文: Network protocol scalability via a topological Kad…
Motivated by widespread dominance hierarchy, growth of group sizes, and feedback mechanisms in social species, we are devoted to exploring the scalable second-order consensus of hierarchical groups. More specifically, a hierarchical group…
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…
A proper abstraction of a large-scale linear consensus network with a dense coupling graph is one whose number of coupling links is proportional to its number of subsystems and its performance is comparable to the original network. Optimal…
Scale invariance profoundly influences the dynamics and structure of complex systems, spanning from critical phenomena to network architecture. Here, we propose a precise definition of scale-invariant networks by leveraging the concept of a…
Random abstract simplicial complex representation provides a mathematical description of wireless networks and their topology. In order to reduce the energy consumption in this type of network, we intend to reduce the number of network…
In this paper, a way of generalizing the tensor renormalization group(TRG) is proposed. Mathematically, the connection between patterns of tensor renormalization group and the concept of truncation sequence in polytope geometry is…
We introduce Network Automata, a framework which couples the topological evolution of a network to its structure. It is useful for dealing with networks in which the topology evolves according to some specified microscopic rules and,…
A new framework to perform routing at the Autonomous System level is proposed in this paper. This mechanism, called Chain Routing, uses complete orders as its main topological unit. Since complete orders are acyclic digraphs that possess a…
Renormalization schemes and cutoff schemes allow for the introduction of various distinct renormalization scales for distinct couplings. We consider the coupled renormalization group flow of several marginal couplings which depend on just…
The ability to reroute and control flow is vital to the function of venation networks across a wide range of organisms. By modifying individual edges in these networks, either by adjusting edge conductances or creating and destroying edges,…
We present a simple model of network dynamics that can be solved analytically for uniform networks. We obtain the dynamics of response of the system to perturbations. The analytical solution is an excellent approximation for random…
A common feature of biological networks is the geometric property of self-similarity. Molecular regulatory networks through to circulatory systems, nervous systems, social systems and ecological trophic networks, show self-similar…
The interconnection network comprises a significant portion of the cost of large parallel computers, both in economic terms and power consumption. Several previous proposals exploit large-radix routers to build scalable low-distance…
A new family of graphs, {\it entangled networks}, with optimal properties in many respects, is introduced. By definition, their topology is such that optimizes synchronizability for many dynamical processes. These networks are shown to have…
We prove that a parabolically rescaled and suitably renormalised height function of a weakly asymmetric simple exclusion process on a circle converges to the Cole-Hopf solution of the KPZ equation. This is an analogue of the celebrated…
Inspired by the power of abstraction in information theory, we consider quantum rebound protocols as a way of providing a unifying perspective to deal with several information-processing tasks related to and extending quantum channel…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
The Population Protocol model is a distributed model that concerns systems of very weak computational entities that cannot control the way they interact. The model of Network Constructors is a variant of Population Protocols capable of…
We study the renormalization group flow of $\phi^4$ theory in two dimensions. Regularizing space into a fine-grained lattice and discretizing the scalar field in a controlled way, we rewrite the partition function of the theory as a tensor…
Many modern networks are \emph{reconfigurable}, in the sense that the topology of the network can be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc networks are reconfigurable. More generally, many…