arXiv subjects

P. Minnhagen

Publications and source records attributed to P. Minnhagen.

5 recordsLinked to original sources

arXiv2007

New Results on the Phase Diagram of the FFXY Model: A Twisted CFT Approach

The issue of the number, nature and sequence of phase transitions in the fully frustrated XY (FFXY) model is a highly non trivial one due to the complex interplay between its continuous and discrete degrees of freedom. In this contribution we attack such a problem by means of a twisted conformal field theory (CFT) approach and show how it gives rise to the U (1)$\otimes Z_{2}$ symmetry and to the whole spectrum of excitations of the FFXY model.

hep-th↗

arXiv2005

Navigating Networks with Limited Information

We study navigation with limited information in networks and demonstrate that many real-world networks have a structure which can be described as favoring communication at short distance at the cost of constraining communication at long distance. This feature, which is robust and more evident with limited than with complete information, reflects both topological and possibly functional design characteristics. For example, the characteristics of the networks studied derived from a city and from the Internet are manifested through modular network designs. We also observe that directed navigation in typical networks requires remarkably little information on the level of individual nodes. By studying navigation, or specific signaling, we take a complementary approach to the common studies of information transfer devoted to broadcasting of information in studies of virus spreading and the like.

cond-mat.dis-nn↗

arXiv2005

Searchability of Networks

We investigate the searchability of complex systems in terms of their interconnectedness. Associating searchability with the number and size of branch points along the paths between the nodes, we find that scale-free networks are relatively difficult to search, and thus that the abundance of scale-free networks in nature and society may reflect an attempt to protect local areas in a highly interconnected network from nonrelated communication. In fact, starting from a random node, real-world networks with higher order organization like modular or hierarchical structure are even more difficult to navigate than random scale-free networks. The searchability at the node level opens the possibility for a generalized hierarchy measure that captures both the hierarchy in the usual terms of trees as in military structures, and the intrinsic hierarchical nature of topological hierarchies for scale-free networks as in the Internet.

cond-mat.dis-nn↗

arXiv2005

Networks and Cities: An Information Perspective

Traffic is constrained by the information involved in locating the receiver and the physical distance between sender and receiver. We here focus on the former, and investigate traffic in the perspective of information handling. We re-plot the road map of cities in terms of the information needed to locate specific addresses and create information city networks with roads mapped to nodes and intersections to links between nodes. These networks have the broad degree distribution found in many other complex networks. The mapping to an information city network makes it possible to quantify the information associated with locating specific addresses.

cond-mat.dis-nn↗

arXiv2004

Self-organization of structures and networks from merging and small-scale fluctuations

We discuss merging-and-creation as a self-organizing process for scale-free topologies in networks. Three power-law classes characterized by the power-law exponents 3/2, 2 and 5/2 are identified and the process is generalized to networks. In the network context the merging can be viewed as a consequence of optimization related to more efficient signaling.

cond-mat.dis-nn↗