Search results for "Random variable"

showing 10 items of 151 documents

Inferring slowly-changing dynamic gene-regulatory networks

2015

Dynamic gene-regulatory networks are complex since the interaction patterns between their components mean that it is impossible to study parts of the network in separation. This holistic character of gene-regulatory networks poses a real challenge to any type of modelling. Graphical models are a class of models that connect the network with a conditional independence relationships between random variables. By interpreting these random variables as gene activities and the conditional independence relationships as functional non-relatedness, graphical models have been used to describe gene-regulatory networks. Whereas the literature has been focused on static networks, most time-course experi…

Dynamic network analysisL1 penalized inferenceComputer scienceT-LymphocytesGene regulatory networkgene regulatory networkMachine learningcomputer.software_genreBiochemistrygene-regulatory networksStructural Biologygraphical modelscomputer simulationT lymphocyteHumansGene Regulatory NetworkshumanGraphical modelMolecular Biologylymphocyte activationClass (computer programming)Models Statisticalalgorithmbusiness.industryResearchApplied Mathematicsstatistical modelStatistical modelComplex networkQuantitative Biology::GenomicsComputer Science ApplicationsComputingMethodologies_PATTERNRECOGNITIONConditional independencemicroarray analysisComputingMethodologies_GENERALArtificial intelligencebusinessmetabolismRandom variablecomputerAlgorithmsBMC Bioinformatics
researchProduct

Scalable and Privacy-Preserving Admission Control for Smart Grids

2015

International audience; Energy demand and production need to be constantly matched in the power grid. The traditional paradigm to continuously adapt the production to the demand is challenged by the increasing penetration of more variable and less predictable energy sources, like solar photovoltaics and wind power. An alternative approach is the so called direct control of some inherently flexible electric loads to shape the demand. Direct control of deferrable loads presents analogies with flow admission control in telecommunication networks: a request for network resources (bandwidth or energy) can be delayed on the basis of the current network status in order to guarantee some performanc…

EngineeringControl and Optimizationlarge deviationRandom variableDistributed computingReal-time computingprivacyModeling and simulation[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]PhotovoltaicsAdmission control; Home appliances; Logic gates; Power demand; Privacy; Random variables; Shape; Control and Systems Engineering; Modeling and Simulation; Control and OptimizationWind poweradmission controlSettore ING-INF/03 - Telecomunicazionibusiness.industryBandwidth (signal processing)[SPI.NRJ]Engineering Sciences [physics]/Electric powerdirect load controlShapeLogic gateSmart gridsAdmission controlHome applianceSmart gridControl and Systems EngineeringModeling and SimulationScalabilityPower demand[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]businessEnergy source
researchProduct

ECONOMIC-STATISTICAL DESIGN APPROACH FOR A VSSI X-BAR CHART CONSIDERING TAGUCHI LOSS FUNCTION AND RANDOM PROCESS SHIFTS

2014

Economic design approaches of control charts are commonly based on the assumption that various cost parameters values and the occurrence risk of assignable causes have to be a priori known with precision. However, in real operative contexts, such parameters can be really difficult to accurately estimate, especially considering costs arising from out-of-control conditions of the process. As consequence, pure economic design approaches can involve chart schemes with low statistical performance. To overcome such limitation, it is herein proposed a multi-objective economic-statistical design approach for an adaptive X-bar chart. In particular, such approach aims at the minimization of both the…

EngineeringMathematical optimizationGeneral Computer Sciencebusiness.industryStochastic processEnergy Engineering and Power TechnologyAerospace Engineeringmulti-objective optimization problemStatistical process controlIndustrial and Manufacturing Engineeringadaptive X-bar control chartNuclear Energy and EngineeringChartControl chartTaguchi loss functionStatistical process controlSensitivity (control systems)ε-constraint methodElectrical and Electronic EngineeringSafety Risk Reliability and QualitybusinessRandom variableSettore ING-IND/16 - Tecnologie E Sistemi Di Lavorazione\bar x and R chart
researchProduct

Exploring the uncertainty in capacity estimation at roundabouts

2017

Abstract Purpose In gap-acceptance theory the critical and the follow-up headways have a significant role in determining roundabout entry capacities which in turn depend on circulating flow rates under a specified arrival headway distribution. Calculation considers single mean values of the gap-acceptance parameters, neglecting the inherent variations in these random variables and providing a single value of entry capacity. The purpose of this paper is to derive the entry capacity distribution which accounts for the variations of the contributing (random) variables and suggest how to consider this issue in the operational analysis of the roundabouts. Methods We performed a Monte Carlo simul…

EngineeringRoundaboutMonte Carlo methodTransportationProbability density function010501 environmental sciences01 natural sciencesGap-acceptance parameter0502 economics and businessHeadwayStatisticsOperationsSettore ICAR/04 - Strade Ferrovie Ed AeroportiPoint estimationSimulation0105 earth and related environmental sciences050210 logistics & transportationbusiness.industryMechanical Engineering05 social sciencesEntry capacityUncertaintylcsh:TA1001-1280lcsh:HE1-9990Distribution (mathematics)Roundabout entry capacity gap-acceptance parameter operations uncertaintyAutomotive EngineeringRoundaboutProbability distributionlcsh:Transportation engineeringlcsh:Transportation and communicationsbusinessRandom variableEuropean Transport Research Review
researchProduct

First-order linear differential equations whose data are complex random variables: Probabilistic solution and stability analysis via densities

2022

[EN] Random initial value problems to non-homogeneous first-order linear differential equations with complex coefficients are probabilistically solved by computing the first probability density of the solution. For the sake of generality, coefficients and initial condition are assumed to be absolutely continuous complex random variables with an arbitrary joint probability density function. The probability of stability, as well as the density of the equilibrium point, are explicitly determined. The Random Variable Transformation technique is extensively utilized to conduct the overall analysis. Several examples are included to illustrate all the theoretical findings.

Equilibrium pointcomplex differential equations with uncertaintiesuncertainty quantificationGeneral Mathematicsrandom modelsProbabilistic logicProbability density functionrandom variable transformation methodStability (probability)Transformation (function)Linear differential equationprobability density functionQA1-939Applied mathematicsInitial value problemMATEMATICA APLICADARandom variableMathematicsMathematicsAIMS Mathematics
researchProduct

Backwards Martingales and Exchangeability

2020

With many data acquisitions, such as telephone surveys, the order in which the data come does not matter. Mathematically, we say that a family of random variables is exchangeable if the joint distribution does not change under finite permutations. De Finetti’s structural theorem says that an infinite family of E-valued exchangeable random variables can be described by a two-stage experiment. At the first stage, a probability distribution Ξ on E is drawn at random. At the second stage, independent and identically distributed random variables with distribution Ξ are implemented.

Exchangeable random variablesDiscrete mathematicsIndependent and identically distributed random variablesDistribution (number theory)Conditional independenceJoint probability distributionProbability distributionConditional probability distributionRandom variableMathematics
researchProduct

Forward and backward diffusion approximations for haploid exchangeable population models

2001

Abstract The class of haploid population models with non-overlapping generations and fixed population size N is considered such that the family sizes ν1,…,νN within a generation are exchangeable random variables. A criterion for weak convergence in the Skorohod sense is established for a properly time- and space-scaled process counting the number of descendants forward in time. The generator A of the limit process X is constructed using the joint moments of the offspring variables ν1,…,νN. In particular, the Wright–Fisher diffusion with generator Af(x)= 1 2 x(1−x)f″(x) appears in the limit as the population size N tends to infinity if and only if the condition lim N→∞ E((ν 1 −1) 3 )/(N Var …

Exchangeable random variablesStatistics and ProbabilityDualityPopulation geneticsCoalescent theoryDiffusion approximationModelling and SimulationQuantitative Biology::Populations and EvolutionNeutralityWright–Fisher diffusionHille–Yosida theoremWeak convergenceMathematicsWeak convergenceApplied MathematicsMathematical analysisHeavy traffic approximationCommutative diagramHille–Yosida theoremPopulation modelDiffusion processModeling and SimulationAncestorsDescendantsExchangeabilityCoalescentStochastic Processes and their Applications
researchProduct

Kernel methods and their derivatives: Concept and perspectives for the earth system sciences.

2020

Kernel methods are powerful machine learning techniques which implement generic non-linear functions to solve complex tasks in a simple way. They Have a solid mathematical background and exhibit excellent performance in practice. However, kernel machines are still considered black-box models as the feature mapping is not directly accessible and difficult to interpret.The aim of this work is to show that it is indeed possible to interpret the functions learned by various kernel methods is intuitive despite their complexity. Specifically, we show that derivatives of these functions have a simple mathematical formulation, are easy to compute, and can be applied to many different problems. We n…

FOS: Computer and information sciencesComputer Science - Machine LearningSupport Vector MachineTheoretical computer scienceComputer scienceEntropyKernel FunctionsNormal Distribution0211 other engineering and technologies02 engineering and technologyMachine Learning (cs.LG)Machine LearningStatistics - Machine LearningSimple (abstract algebra)0202 electrical engineering electronic engineering information engineeringOperator TheoryData ManagementMultidisciplinaryGeographyApplied MathematicsSimulation and ModelingQRDensity estimationKernel methodKernel (statistics)Physical SciencessymbolsMedicine020201 artificial intelligence & image processingAlgorithmsResearch ArticleComputer and Information SciencesScienceMachine Learning (stat.ML)Research and Analysis MethodsKernel MethodsKernel (linear algebra)symbols.namesakeArtificial IntelligenceSupport Vector MachinesHumansEntropy (information theory)Computer SimulationGaussian process021101 geological & geomatics engineeringData VisualizationCorrectionRandom VariablesFunction (mathematics)Probability TheorySupport vector machineAlgebraPhysical GeographyLinear AlgebraEarth SciencesEigenvectorsRandom variableMathematicsEarth SystemsPLoS ONE
researchProduct

Order-distance and other metric-like functions on jointly distributed random variables

2013

We construct a class of real-valued nonnegative binary functions on a set of jointly distributed random variables, which satisfy the triangle inequality and vanish at identical arguments (pseudo-quasi-metrics). These functions are useful in dealing with the problem of selective probabilistic causality encountered in behavioral sciences and in quantum physics. The problem reduces to that of ascertaining the existence of a joint distribution for a set of variables with known distributions of certain subsets of this set. Any violation of the triangle inequality or its consequences by one of our functions when applied to such a set rules out the existence of this joint distribution. We focus on…

FOS: Computer and information sciencesMeasurable functionComputer Science - Artificial IntelligenceGeneral MathematicsMathematics - Statistics TheoryStatistics Theory (math.ST)Quantitative Biology - Quantitative Methods01 natural sciences050105 experimental psychologyJoint probability distribution0103 physical sciencesFOS: Mathematics0501 psychology and cognitive sciences010306 general physicsQuantitative Methods (q-bio.QM)60B99 (Primary) 81Q99 91E45 (Secondary)Probability measureMathematicsDiscrete mathematicsTriangle inequalityApplied MathematicsProbability (math.PR)05 social sciencesFunction (mathematics)Artificial Intelligence (cs.AI)Distribution (mathematics)FOS: Biological sciencesSample spaceRandom variableMathematics - ProbabilityProceedings of the American Mathematical Society
researchProduct

The Max-Product Algorithm Viewed as Linear Data-Fusion: A Distributed Detection Scenario

2019

In this paper, we disclose the statistical behavior of the max-product algorithm configured to solve a maximum a posteriori (MAP) estimation problem in a network of distributed agents. Specifically, we first build a distributed hypothesis test conducted by a max-product iteration over a binary-valued pairwise Markov random field and show that the decision variables obtained are linear combinations of the local log-likelihood ratios observed in the network. Then, we use these linear combinations to formulate the system performance in terms of the false-alarm and detection probabilities. Our findings indicate that, in the hypothesis test concerned, the optimal performance of the max-product a…

FOS: Computer and information sciencesfactor graphsComputer scienceComputer Science - Information TheoryMarkovin ketjut02 engineering and technologyMarkov random fieldsalgoritmit0202 electrical engineering electronic engineering information engineeringMaximum a posteriori estimationmax-product algorithmElectrical and Electronic EngineeringLinear combinationStatistical hypothesis testingdistributed systemsMarkov random fieldspectrum sensingApplied MathematicsNode (networking)Information Theory (cs.IT)linear data-fusionApproximation algorithm020206 networking & telecommunicationsComputer Science Applicationssum-product algorithmPairwise comparisonRandom variableAlgorithmstatistical inference
researchProduct