Browse
Submit Data
Databases
API
Help

Dataset Information

17 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Asymptotic Gaussian law for noninteracting indistinguishable particles in random networks.

ABSTRACT: For N indistinguishable bosons or fermions impinged on a M-port Haar-random unitary network the average probability to count n ₁, … n _r particles in a small number r???N of binned-together output ports takes a Gaussian form as N???1. The discovered Gaussian asymptotic law is the well-known asymptotic law for distinguishable particles, governed by a multinomial distribution, modified by the quantum statistics with stronger effect for greater particle density N/M. Furthermore, it is shown that the same Gaussian law is the asymptotic form of the probability to count particles at the output bins of a fixed multiport with the averaging performed over all possible configurations of the particles in the input ports. In the limit N????, the average counting probability for indistinguishable bosons, fermions, and distinguishable particles differs only at a non-vanishing particle density N/M and only for a singular binning K/M???1, where K output ports belong to a single bin.

SUBMITTER: Shchesnovich VS

PROVIDER: S-EPMC5428393 | biostudies-literature | 2017 Feb

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Asymptotic Gaussian law for noninteracting indistinguishable particles in random networks.

Shchesnovich Valery S VS

Scientific reports 20170216 1

For N indistinguishable bosons or fermions impinged on a M-port Haar-random unitary network the average probability to count n <sub>1</sub>, … n <sub>r</sub> particles in a small number r ≪ N of binned-together output ports takes a Gaussian form as N ≫ 1. The discovered Gaussian asymptotic law is the well-known asymptotic law for distinguishable particles, governed by a multinomial distribution, modified by the quantum statistics with stronger effect for greater particle density N/M. Furthermore ...[more]

PMID: 28194000

Similar Datasets

A scaling law for random walks on networks.

Project description:The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics.

| S-EPMC4214407 | biostudies-literature

Locality and entanglement of indistinguishable particles.

Project description:Entanglement is one of the strongest quantum correlation, and is a key ingredient in fundamental aspects of quantum mechanics and a resource for quantum technologies. While entanglement theory is well settled for distinguishable particles, there are five inequivalent approaches to entanglement of indistinguishable particles. We analyse the different definitions of indistinguishable particle entanglement in the light of the locality notion. This notion is specified by two steps: (i) the identification of subsystems by means of their local operators; (ii) the requirement that entanglement represent correlations between the above subsets of operators. We prove that three of the aforementioned five entanglement definitions are incompatible with any locality notion defined as above.

| S-EPMC8322085 | biostudies-literature

Reconstructible phylogenetic networks: do not distinguish the indistinguishable.

Project description:Phylogenetic networks represent the evolution of organisms that have undergone reticulate events, such as recombination, hybrid speciation or lateral gene transfer. An important way to interpret a phylogenetic network is in terms of the trees it displays, which represent all the possible histories of the characters carried by the organisms in the network. Interestingly, however, different networks may display exactly the same set of trees, an observation that poses a problem for network reconstruction: from the perspective of many inference methods such networks are "indistinguishable". This is true for all methods that evaluate a phylogenetic network solely on the basis of how well the displayed trees fit the available data, including all methods based on input data consisting of clades, triples, quartets, or trees with any number of taxa, and also sequence-based approaches such as popular formalisations of maximum parsimony and maximum likelihood for networks. This identifiability problem is partially solved by accounting for branch lengths, although this merely reduces the frequency of the problem. Here we propose that network inference methods should only attempt to reconstruct what they can uniquely identify. To this end, we introduce a novel definition of what constitutes a uniquely reconstructible network. For any given set of indistinguishable networks, we define a canonical network that, under mild assumptions, is unique and thus representative of the entire set. Given data that underwent reticulate evolution, only the canonical form of the underlying phylogenetic network can be uniquely reconstructed. While on the methodological side this will imply a drastic reduction of the solution space in network inference, for the study of reticulate evolution this is a fundamental limitation that will require an important change of perspective when interpreting phylogenetic networks.

| S-EPMC4388854 | biostudies-literature

Correction: Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable.

Project description:[This corrects the article DOI: 10.1371/journal.pcbi.1004135.].

| S-EPMC6568377 | biostudies-literature

Asymptotic entropy of the Gibbs state of complex networks.

Project description:In this work we study the entropy of the Gibbs state corresponding to a graph. The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature. We illustrate our analytical results with numerical simulations for Erdős-Rényi, Watts-Strogatz, Barabási-Albert and Chung-Lu graph models and a few real-world graphs. Our results show that the behavior of Gibbs entropy as a function of the temperature differs for a choice of real networks when compared to the random Erdős-Rényi graphs.

| S-EPMC7801599 | biostudies-literature

The asymptotic distribution of modularity in weighted signed networks.

Project description:Modularity is a popular metric for quantifying the degree of community structure within a network. The distribution of the largest eigenvalue of a network's edge weight or adjacency matrix is well studied and is frequently used as a substitute for modularity when performing statistical inference. However, we show that the largest eigenvalue and modularity are asymptotically uncorrelated, which suggests the need for inference directly on modularity itself when the network size is large. To this end, we derive the asymptotic distributions of modularity in the case where the network's edge weight matrix belongs to the Gaussian orthogonal ensemble, and study the statistical power of the corresponding test for community structure under some alternative models. We empirically explore universality extensions of the limiting distribution and demonstrate the accuracy of these asymptotic distributions through Type I error simulations. We also compare the empirical powers of the modularity based tests with some existing methods. Our method is then used to test for the presence of community structure in two real data applications.

| S-EPMC8300091 | biostudies-literature

Untangling the Hairball: Fitness-Based Asymptotic Reduction of Biological Networks.

Project description:Complex mathematical models of interaction networks are routinely used for prediction in systems biology. However, it is difficult to reconcile network complexities with a formal understanding of their behavior. Here, we propose a simple procedure (called ?¯) to reduce biological models to functional submodules, using statistical mechanics of complex systems combined with a fitness-based approach inspired by in silico evolution. The ?¯ algorithm works by putting parameters or combination of parameters to some asymptotic limit, while keeping (or slightly improving) the model performance, and requires parameter symmetry breaking for more complex models. We illustrate ?¯ on biochemical adaptation and on different models of immune recognition by T cells. An intractable model of immune recognition with close to a hundred individual transition rates is reduced to a simple two-parameter model. The ?¯ algorithm extracts three different mechanisms for early immune recognition, and automatically discovers similar functional modules in different models of the same process, allowing for model classification and comparison. Our procedure can be applied to biological networks based on rate equations using a fitness function that quantifies phenotypic performance.

| S-EPMC5647575 | biostudies-literature

Gaussian synapses for probabilistic neural networks.

Project description:The recent decline in energy, size and complexity scaling of traditional von Neumann architecture has resurrected considerable interest in brain-inspired computing. Artificial neural networks (ANNs) based on emerging devices, such as memristors, achieve brain-like computing but lack energy-efficiency. Furthermore, slow learning, incremental adaptation, and false convergence are unresolved challenges for ANNs. In this article we, therefore, introduce Gaussian synapses based on heterostructures of atomically thin two-dimensional (2D) layered materials, namely molybdenum disulfide and black phosphorus field effect transistors (FETs), as a class of analog and probabilistic computational primitives for hardware implementation of statistical neural networks. We also demonstrate complete tunability of amplitude, mean and standard deviation of the Gaussian synapse via threshold engineering in dual gated molybdenum disulfide and black phosphorus FETs. Finally, we show simulation results for classification of brainwaves using Gaussian synapse based probabilistic neural networks.

| S-EPMC6744503 | biostudies-literature

Human Activity Recognition Using Gaussian Mixture Hidden Conditional Random Fields.

Project description:In healthcare, the analysis of patients' activities is one of the important factors that offer adequate information to provide better services for managing their illnesses well. Most of the human activity recognition (HAR) systems are completely reliant on recognition module/stage. The inspiration behind the recognition stage is the lack of enhancement in the learning method. In this study, we have proposed the usage of the hidden conditional random fields (HCRFs) for the human activity recognition problem. Moreover, we contend that the existing HCRF model is inadequate by independence assumptions, which may reduce classification accuracy. Therefore, we utilized a new algorithm to relax the assumption, allowing our model to use full-covariance distribution. Also, in this work, we proved that computation wise our method has very much lower complexity against the existing methods. For the experiments, we used four publicly available standard datasets to show the performance. We utilized a 10-fold cross-validation scheme to train, assess, and compare the proposed model with the conditional learning method, hidden Markov model (HMM), and existing HCRF model which can only use diagonal-covariance Gaussian distributions. From the experiments, it is obvious that the proposed model showed a substantial improvement with p value ?0.2 regarding the classification accuracy.

| S-EPMC6935449 | biostudies-literature

Pooling designs for outcomes under a Gaussian random effects model.

Project description:Due to the rising cost of laboratory assays, it has become increasingly common in epidemiological studies to pool biospecimens. This is particularly true in longitudinal studies, where the cost of performing multiple assays over time can be prohibitive. In this article, we consider the problem of estimating the parameters of a Gaussian random effects model when the repeated outcome is subject to pooling. We consider different pooling designs for the efficient maximum likelihood estimation of variance components, with particular attention to estimating the intraclass correlation coefficient. We evaluate the efficiencies of different pooling design strategies using analytic and simulation study results. We examine the robustness of the designs to skewed distributions and consider unbalanced designs. The design methodology is illustrated with a longitudinal study of premenopausal women focusing on assessing the reproducibility of F2-isoprostane, a biomarker of oxidative stress, over the menstrual cycle.

| S-EPMC4159259 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

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