Search results for "Statistical"

showing 10 items of 4960 documents

Simulation-based marginal likelihood for cluster strong lensing cosmology

2015

Comparisons between observed and predicted strong lensing properties of galaxy clusters have been routinely used to claim either tension or consistency with $\Lambda$CDM cosmology. However, standard approaches to such cosmological tests are unable to quantify the preference for one cosmology over another. We advocate approximating the relevant Bayes factor using a marginal likelihood that is based on the following summary statistic: the posterior probability distribution function for the parameters of the scaling relation between Einstein radii and cluster mass, $\alpha$ and $\beta$. We demonstrate, for the first time, a method of estimating the marginal likelihood using the X-ray selected …

FOS: Computer and information sciencesSTATISTICAL [METHODS]Cold dark matterCosmology and Nongalactic Astrophysics (astro-ph.CO)NUMERICAL [METHODS]Ciencias FísicasPosterior probabilityFOS: Physical sciencesAstrophysics::Cosmology and Extragalactic Astrophysics01 natural sciencesStatistics - ApplicationsCosmologymethods: numerical//purl.org/becyt/ford/1 [https]cosmology: theory0103 physical sciencesCluster (physics)Applications (stat.AP)Statistical physics010303 astronomy & astrophysicsInstrumentation and Methods for Astrophysics (astro-ph.IM)Galaxy clusterPhysicsmethods: statisticalgravitational lensing: strong; methods: numerical; methods: statistical; galaxies: clusters: general; cosmology: theory010308 nuclear & particles physicsgravitational lensing: strongAstronomy and AstrophysicsBayes factor//purl.org/becyt/ford/1.3 [https]STRONG [GRAVITATIONAL LENSING]RedshiftMarginal likelihoodAstronomíaTHEORY [COSMOLOGY]Space and Planetary Sciencegalaxies: clusters: generalPhysics - Data Analysis Statistics and ProbabilityCLUSTERS: GENERAL [GALAXIES]Astrophysics - Instrumentation and Methods for AstrophysicsData Analysis Statistics and Probability (physics.data-an)CIENCIAS NATURALES Y EXACTASAstrophysics - Cosmology and Nongalactic Astrophysics
researchProduct

Random Interruptions in Cooperation for Spectrum Sensing in Cognitive Radio Networks

2015

In this paper, a new cooperation structure for spectrum sensing in cognitive radio networks is proposed which outperforms the existing commonly-used ones in terms of energy efficiency. The efficiency is achieved in the proposed design by introducing random interruptions in the cooperation process between the sensing nodes and the fusion center, along with a compensation process at the fusion center. Regarding the hypothesis testing problem concerned, first, the proposed system behavior is thoroughly analyzed and its associated likelihood-ratio test (LRT) is provided. Next, based on a general linear fusion rule, statistics of the global test summary are derived and the sensing quality is cha…

FOS: Computer and information sciencesSemidefinite programmingMathematical optimizationta213Computer scienceInformation Theory (cs.IT)Computer Science - Information Theory010401 analytical chemistrydecision/data fusion020206 networking & telecommunications02 engineering and technology01 natural sciencesStatistical power0104 chemical sciencescooperative spectrum sensingCognitive radionon-ideal reporting channelsefficiency0202 electrical engineering electronic engineering information engineeringcognitive radio (CR)False alarmElectrical and Electronic EngineeringStatistical hypothesis testingEfficient energy use
researchProduct

A quantum vocal theory of sound

2020

Concepts and formalism from acoustics are often used to exemplify quantum mechanics. Conversely, quantum mechanics could be used to achieve a new perspective on acoustics, as shown by Gabor studies. Here, we focus in particular on the study of human voice, considered as a probe to investigate the world of sounds. We present a theoretical framework that is based on observables of vocal production, and on some measurement apparati that can be used both for analysis and synthesis. In analogy to the description of spin states of a particle, the quantum-mechanical formalism is used to describe the relations between the fundamental states associated with phonetic labels such as phonation, turbule…

FOS: Computer and information sciencesSound (cs.SD)Computer scienceAudio processingAnalogyAudio processing; Quantum-inspired algorithms; Sound representation01 natural sciencesComputer Science - Sound050105 experimental psychologyTheoretical Computer Sciencesymbols.namesakeAudio and Speech Processing (eess.AS)0103 physical sciencesFOS: Electrical engineering electronic engineering information engineering0501 psychology and cognitive sciencesPhonationElectrical and Electronic Engineering010306 general physicsQuantumHuman voiceQuantum computerSound representationSettore INF/01 - Informatica05 social sciencesStatistical and Nonlinear PhysicsObservableSettore MAT/04 - Matematiche ComplementariElectronic Optical and Magnetic MaterialsVibrationClassical mechanicsFourier transformComputer Science::SoundModeling and SimulationSignal ProcessingsymbolsQuantum-inspired algorithms Audio processing Sound representationQuantum-inspired algorithmsSettore ING-INF/05 - Sistemi di Elaborazione delle InformazioniElectrical Engineering and Systems Science - Audio and Speech Processing
researchProduct

Microstructure reconstruction using entropic descriptors

2009

A multi-scale approach to the inverse reconstruction of a pattern's microstructure is reported. Instead of a correlation function, a pair of entropic descriptors (EDs) is proposed for stochastic optimization method. The first of them measures a spatial inhomogeneity, for a binary pattern, or compositional one, for a greyscale image. The second one quantifies a spatial or compositional statistical complexity. The EDs reveal structural information that is dissimilar, at least in part, to that given by correlation functions at almost all of discrete length scales. The method is tested on a few digitized binary and greyscale images. In each of the cases, the persuasive reconstruction of the mic…

FOS: Computer and information sciencesStatistical Mechanics (cond-mat.stat-mech)General MathematicsComputer Vision and Pattern Recognition (cs.CV)Computer Science - Computer Vision and Pattern RecognitionGeneral EngineeringGeneral Physics and AstronomyBinary numberInverseFOS: Physical sciencesBinary patternGrayscaleImage (mathematics)CorrelationCorrelation function (statistical mechanics)Computer Science::Computer Vision and Pattern RecognitionStochastic optimizationStatistical physicsCondensed Matter - Statistical MechanicsMathematics
researchProduct

Conditional particle filters with diffuse initial distributions

2020

Conditional particle filters (CPFs) are powerful smoothing algorithms for general nonlinear/non-Gaussian hidden Markov models. However, CPFs can be inefficient or difficult to apply with diffuse initial distributions, which are common in statistical applications. We propose a simple but generally applicable auxiliary variable method, which can be used together with the CPF in order to perform efficient inference with diffuse initial distributions. The method only requires simulatable Markov transitions that are reversible with respect to the initial distribution, which can be improper. We focus in particular on random-walk type transitions which are reversible with respect to a uniform init…

FOS: Computer and information sciencesStatistics and ProbabilityComputer scienceGaussianBayesian inferenceMarkovin ketjut02 engineering and technology01 natural sciencesStatistics - ComputationArticleTheoretical Computer ScienceMethodology (stat.ME)010104 statistics & probabilitysymbols.namesakeAdaptive Markov chain Monte Carlotilastotiede0202 electrical engineering electronic engineering information engineeringStatistical physics0101 mathematicsDiffuse initialisationHidden Markov modelComputation (stat.CO)Statistics - MethodologyState space modelHidden Markov modelbayesian inferenceMarkov chaindiffuse initialisationbayesilainen menetelmäconditional particle filtersmoothingmatemaattiset menetelmät020206 networking & telecommunicationsConditional particle filterCovariancecompartment modelRandom walkCompartment modelstate space modelComputational Theory and MathematicsAutoregressive modelsymbolsStatistics Probability and UncertaintyParticle filterSmoothingSmoothing
researchProduct

A novel exact representation of stationary colored Gaussian processes (fractional differential approach)

2010

A novel representation of functions, called generalized Taylor form, is applied to the filtering of white noise processes. It is shown that every Gaussian colored noise can be expressed as the output of a set of linear fractional stochastic differential equations whose solution is a weighted sum of fractional Brownian motions. The exact form of the weighting coefficients is given and it is shown that it is related to the fractional moments of the target spectral density of the colored noise.

FOS: Computer and information sciencesStatistics and ProbabilityDifferential equationFOS: Physical sciencesGeneral Physics and AstronomyStatistics - ComputationStochastic differential equationsymbols.namesakeSpectral MomentsApplied mathematicsStationary processeGaussian processCondensed Matter - Statistical MechanicsComputation (stat.CO)Mathematical PhysicsMathematicsGeneralized functionStatistical Mechanics (cond-mat.stat-mech)Statistical and Nonlinear PhysicsMathematical Physics (math-ph)White noiseClosed and exact differential formsColors of noiseGaussian noiseFractional CalculuModeling and SimulationsymbolsSettore ICAR/08 - Scienza Delle Costruzioni
researchProduct

Fractal surfaces from simple arithmetic operations

2015

Fractal surfaces ('patchwork quilts') are shown to arise under most general circumstances involving simple bitwise operations between real numbers. A theory is presented for all deterministic bitwise operations on a finite alphabet. It is shown that these models give rise to a roughness exponent $H$ that shapes the resulting spatial patterns, larger values of the exponent leading to coarser surfaces.

FOS: Computer and information sciencesStatistics and ProbabilityDiscrete mathematicsOther Computer Science (cs.OH)Condensed Matter Physics01 natural sciences010305 fluids & plasmasSelf-affinityFractalSimple (abstract algebra)Computer Science - Other Computer Science0103 physical sciencesRoughness exponentExponentStatistical physicsAlphabet010306 general physicsBitwise operationReal numberMathematics
researchProduct

KFAS : Exponential Family State Space Models in R

2017

State space modelling is an efficient and flexible method for statistical inference of a broad class of time series and other data. This paper describes an R package KFAS for state space modelling with the observations from an exponential family, namely Gaussian, Poisson, binomial, negative binomial and gamma distributions. After introducing the basic theory behind Gaussian and non-Gaussian state space models, an illustrative example of Poisson time series forecasting is provided. Finally, a comparison to alternative R packages suitable for non-Gaussian time series modelling is presented.

FOS: Computer and information sciencesStatistics and ProbabilityaikasarjatGaussianNegative binomial distributionforecastingPoisson distribution01 natural sciencesStatistics - ComputationMethodology (stat.ME)010104 statistics & probability03 medical and health sciencessymbols.namesake0302 clinical medicineExponential familyexponential familyGamma distributionStatistical inferenceState spaceApplied mathematicsSannolikhetsteori och statistik030212 general & internal medicine0101 mathematicsProbability Theory and Statisticslcsh:Statisticslcsh:HA1-4737Computation (stat.CO)Statistics - MethodologyMathematicsR; exponential family; state space models; time series; forecasting; dynamic linear modelsta112state space modelsSeries (mathematics)RStatistics; Computer softwaresymbolsStatistics Probability and Uncertaintytime seriesSoftwaredynamic linear models
researchProduct

Community characterization of heterogeneous complex systems

2011

We introduce an analytical statistical method to characterize the communities detected in heterogeneous complex systems. By posing a suitable null hypothesis, our method makes use of the hypergeometric distribution to assess the probability that a given property is over-expressed in the elements of a community with respect to all the elements of the investigated set. We apply our method to two specific complex networks, namely a network of world movies and a network of physics preprints. The characterization of the elements and of the communities is done in terms of languages and countries for the movie network and of journals and subject categories for papers. We find that our method is ab…

FOS: Computer and information sciencesStatistics and Probabilityrandom graphs networks statistical inference socio-economic networksPhysics - Physics and SocietyTheoretical computer scienceProperty (programming)Complex systemFOS: Physical sciencesPhysics and Society (physics.soc-ph)socio-economic networksStatistical inferenceSocial and Information Networks (cs.SI)Random graphComputer Science - Social and Information NetworksStatistical and Nonlinear PhysicsProbability and statisticsComplex networkSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Hypergeometric distributionPhysics - Data Analysis Statistics and ProbabilitynetworkStatistics Probability and UncertaintyNull hypothesisData Analysis Statistics and Probability (physics.data-an)random graphstatistical inferenceJournal of Statistical Mechanics: Theory and Experiment
researchProduct

Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness

2016

We study space and time efficient quantum algorithms for two graph problems -- deciding whether an $n$-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms for deciding both properties in $\tilde{O}(n^{3/2})$ time and using $O(\log n)$ classical and quantum bits of storage in the adjacency matrix model. We then present quantum algorithms for deciding the two properties in the adjacency array model, which run in time $\tilde{O}(n\sqrt{d_m})$ and also require $O(\log n)$ space, where $d_m$ is the maximum degree of any vertex in the input graph.

FOS: Computer and information sciencesVertex (graph theory)Quantum PhysicsNuclear and High Energy PhysicsReduction (recursion theory)Two-graphFOS: Physical sciencesGeneral Physics and AstronomyStatistical and Nonlinear PhysicsTheoretical Computer ScienceCombinatoricsComputational Theory and MathematicsComputer Science - Data Structures and AlgorithmsBipartite graphGraph (abstract data type)Adjacency listData Structures and Algorithms (cs.DS)Quantum algorithmAdjacency matrixQuantum Physics (quant-ph)Mathematical PhysicsMathematicsofComputing_DISCRETEMATHEMATICSMathematicsQuantum Information and Computation
researchProduct