Browse
Submit Data
Databases
API
Help

Dataset Information

16 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Renormalization and small-world model of fractal quantum repeater networks.

ABSTRACT: Quantum networks provide access to exchange of quantum information. The primary task of quantum networks is to distribute entanglement between remote nodes. Although quantum repeater protocol enables long distance entanglement distribution, it has been restricted to one-dimensional linear network. Here we develop a general framework that allows application of quantum repeater protocol to arbitrary quantum repeater networks with fractal structure. Entanglement distribution across such networks is mapped to renormalization. Furthermore, we demonstrate that logarithmical times of recursive such renormalization transformations can trigger fractal to small-world transition, where a scalable quantum small-world network is achieved. Our result provides new insight into quantum repeater theory towards realistic construction of large-scale quantum networks.

SUBMITTER: Wei ZW

PROVIDER: S-EPMC3564040 | biostudies-literature | 2013

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Renormalization and small-world model of fractal quantum repeater networks.

Wei Zong-Wen ZW Wang Bing-Hong BH Han Xiao-Pu XP

Scientific reports 20130205

Quantum networks provide access to exchange of quantum information. The primary task of quantum networks is to distribute entanglement between remote nodes. Although quantum repeater protocol enables long distance entanglement distribution, it has been restricted to one-dimensional linear network. Here we develop a general framework that allows application of quantum repeater protocol to arbitrary quantum repeater networks with fractal structure. Entanglement distribution across such networks is ...[more]

PMID: 23386977

Similar Datasets

Adaptive reconfiguration of fractal small-world human brain functional networks.

Project description:Brain function depends on adaptive self-organization of large-scale neural assemblies, but little is known about quantitative network parameters governing these processes in humans. Here, we describe the topology and synchronizability of frequency-specific brain functional networks using wavelet decomposition of magnetoencephalographic time series, followed by construction and analysis of undirected graphs. Magnetoencephalographic data were acquired from 22 subjects, half of whom performed a finger-tapping task, whereas the other half were studied at rest. We found that brain functional networks were characterized by small-world properties at all six wavelet scales considered, corresponding approximately to classical delta (low and high), , alpha, beta, and gamma frequency bands. Global topological parameters (path length, clustering) were conserved across scales, most consistently in the frequency range 2-37 Hz, implying a scale-invariant or fractal small-world organization. Dynamical analysis showed that networks were located close to the threshold of order/disorder transition in all frequency bands. The highest-frequency gamma network had greater synchronizability, greater clustering of connections, and shorter path length than networks in the scaling regime of (lower) frequencies. Behavioral state did not strongly influence global topology or synchronizability; however, motor task performance was associated with emergence of long-range connections in both beta and gamma networks. Long-range connectivity, e.g., between frontal and parietal cortex, at high frequencies during a motor task may facilitate sensorimotor binding. Human brain functional networks demonstrate a fractal small-world architecture that supports critical dynamics and task-related spatial reconfiguration while preserving global topological parameters.

| S-EPMC1838565 | biostudies-literature

Geometric assortative growth model for small-world networks.

Project description:It has been shown that both humanly constructed and natural networks are often characterized by small-world phenomenon and assortative mixing. In this paper, we propose a geometrically growing model for small-world networks. The model displays both tunable small-world phenomenon and tunable assortativity. We obtain analytical solutions of relevant topological properties such as order, size, degree distribution, degree correlation, clustering, transitivity, and diameter. It is also worth noting that the model can be viewed as a generalization for an iterative construction of Farey graphs.

| S-EPMC3919055 | biostudies-other

A big world inside small-world networks.

Project description:Real networks, including biological networks, are known to have the small-world property, characterized by a small "diameter", which is defined as the average minimal path length between all pairs of nodes in a network. Because random networks also have short diameters, one may predict that the diameter of a real network should be even shorter than its random expectation, because having shorter diameters potentially increases the network efficiency such as minimizing transition times between metabolic states in the context of metabolic networks. Contrary to this expectation, we here report that the observed diameter is greater than the random expectation in every real network examined, including biological, social, technological, and linguistic networks. Simulations show that a modest enlargement of the diameter beyond its expectation allows a substantial increase of the network modularity, which is present in all real networks examined. Hence, short diameters appear to be sacrificed for high modularities, suggesting a tradeoff between network efficiency and advantages offered by modularity (e.g., multi-functionality, robustness, and/or evolvability).

| S-EPMC2682646 | biostudies-literature

Spatially embedded growing small-world networks.

Project description:Networks in nature are often formed within a spatial domain in a dynamical manner, gaining links and nodes as they develop over time. Motivated by the growth and development of neuronal networks, we propose a class of spatially-based growing network models and investigate the resulting statistical network properties as a function of the dimension and topology of the space in which the networks are embedded. In particular, we consider two models in which nodes are placed one by one in random locations in space, with each such placement followed by configuration relaxation toward uniform node density, and connection of the new node with spatially nearby nodes. We find that such growth processes naturally result in networks with small-world features, including a short characteristic path length and nonzero clustering. We find no qualitative differences in these properties for two different topologies, and we suggest that results for these properties may not depend strongly on the topology of the embedding space. The results do depend strongly on dimension, and higher-dimensional spaces result in shorter path lengths but less clustering.

| S-EPMC4231322 | biostudies-other

Characterization of real-world networks through quantum potentials.

Project description:Network connectivity has been thoroughly investigated in several domains, including physics, neuroscience, and social sciences. This work tackles the possibility of characterizing the topological properties of real-world networks from a quantum-inspired perspective. Starting from the normalized Laplacian of a network, we use a well-defined procedure, based on the dressing transformations, to derive a 1-dimensional Schrödinger-like equation characterized by the same eigenvalues. We investigate the shape and properties of the potential appearing in this equation in simulated small-world and scale-free network ensembles, using measures of fractality. Besides, we employ the proposed framework to compare real-world networks with the Erdős-Rényi, Watts-Strogatz and Barabási-Albert benchmark models. Reconstructed potentials allow to assess to which extent real-world networks approach these models, providing further insight on their formation mechanisms and connectivity properties.

| S-EPMC8277057 | biostudies-literature

Small-World Propensity and Weighted Brain Networks.

Project description:Quantitative descriptions of network structure can provide fundamental insights into the function of interconnected complex systems. Small-world structure, diagnosed by high local clustering yet short average path length between any two nodes, promotes information flow in coupled systems, a key function that can differ across conditions or between groups. However, current techniques to quantify small-worldness are density dependent and neglect important features such as the strength of network connections, limiting their application in real-world systems. Here, we address both limitations with a novel metric called the Small-World Propensity (SWP). In its binary instantiation, the SWP provides an unbiased assessment of small-world structure in networks of varying densities. We extend this concept to the case of weighted brain networks by developing (i) a standardized procedure for generating weighted small-world networks, (ii) a weighted extension of the SWP, and (iii) a method for mapping observed brain network data onto the theoretical model. In applying these techniques to compare real-world brain networks, we uncover the surprising fact that the canonical biological small-world network, the C. elegans neuronal network, has strikingly low SWP. These metrics, models, and maps form a coherent toolbox for the assessment and comparison of architectural properties in brain networks.

| S-EPMC4766852 | biostudies-other

The ubiquity of small-world networks.

Project description:Small-world networks, according to Watts and Strogatz, are a class of networks that are "highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs." These characteristics result in networks with unique properties of regional specialization with efficient information transfer. Social networks are intuitive examples of this organization, in which cliques or clusters of friends being interconnected but each person is really only five or six people away from anyone else. Although this qualitative definition has prevailed in network science theory, in application, the standard quantitative application is to compare path length (a surrogate measure of distributed processing) and clustering (a surrogate measure of regional specialization) to an equivalent random network. It is demonstrated here that comparing network clustering to that of a random network can result in aberrant findings and that networks once thought to exhibit small-world properties may not. We propose a new small-world metric, ? (omega), which compares network clustering to an equivalent lattice network and path length to a random network, as Watts and Strogatz originally described. Example networks are presented that would be interpreted as small-world when clustering is compared to a random network but are not small-world according to ?. These findings have important implications in network science because small-world networks have unique topological properties, and it is critical to accurately distinguish them from networks without simultaneous high clustering and short path length.

| S-EPMC3604768 | biostudies-literature

Graph fractal dimension and the structure of fractal networks.

Project description:Fractals are geometric objects that are self-similar at different scales and whose geometric dimensions differ from so-called fractal dimensions. Fractals describe complex continuous structures in nature. Although indications of self-similarity and fractality of complex networks has been previously observed, it is challenging to adapt the machinery from the theory of fractality of continuous objects to discrete objects such as networks. In this article, we identify and study fractal networks using the innate methods of graph theory and combinatorics. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to known graph-theoretical characteristics: rank dimension and product dimension. Our approach reveals how self-similarity and fractality of a network are defined by a pattern of overlaps between densely connected network communities. It allows us to identify fractal graphs, explore the relations between graph fractality, graph colourings and graph descriptive complexity, and analyse the fractality of several classes of graphs and network models, as well as of a number of real-life networks. We demonstrate the application of our framework in evolutionary biology and virology by analysing networks of viral strains sampled at different stages of evolution inside their hosts. Our methodology revealed gradual self-organization of intra-host viral populations over the course of infection and their adaptation to the host environment. The obtained results lay a foundation for studying fractal properties of complex networks using combinatorial methods and algorithms.

| S-EPMC7673317 | biostudies-literature

Dynamics of semiflexible recursive small-world polymer networks.

Project description:One of the fundamental issues in polymer physics is to reveal the relation between the structures of macromolecules and their various properties. In this report, we study the dynamical properties of a family of deterministically growing semiflexible treelike polymer networks, which are built in an iterative method. From the analysis of the corresponding dynamical matrix we derive the solution for its eigenvalues and their multiplicities, making use of a combined numerical and analytical approach. The eigenvalue spectra allow us to investigate the mechanical relaxation forms in depth for different values of the stiffness parameter. We observe that the dynamics of semiflexible networks is sensitive to the stiffness parameter. Our work paves a way to explore the structures of the highly symmetric polymers and provides a comprehensive understanding of the role of semiflexibility for the regular treelike networks which possess a small-world feature.

| S-EPMC4271264 | biostudies-other

Mandala networks: ultra-small-world and highly sparse graphs.

Project description:The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to systematically construct networks which are robust against random failures. Furthermore, as the size of the network increases, its shortest path becomes asymptotically invariant and the density of links goes to zero, making it ultra-small world and highly sparse, respectively. The first property is ideal for communication and navigation purposes, while the second is interesting economically. Finally, we show that some simple changes on the original network formulation can lead to an improved topology against malicious attacks.

| S-EPMC4357991 | biostudies-other

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data