Search results for "Mathematica"

showing 10 items of 7971 documents

2021

Abstract We prove the existence of a smoothing for a toroidal crossing space under mild assumptions. By linking log structures with infinitesimal deformations, the result receives a very compact form for normal crossing spaces. The main approach is to study log structures that are incoherent on a subspace of codimension 2 and prove a Hodge–de Rham degeneration theorem for such log spaces that also settles a conjecture by Danilov. We show that the homotopy equivalence between Maurer–Cartan solutions and deformations combined with Batalin–Vilkovisky theory can be used to obtain smoothings. The construction of new Calabi–Yau and Fano manifolds as well as Frobenius manifold structures on moduli…

Statistics and ProbabilityFrobenius manifoldPure mathematicsAlgebra and Number TheoryConjectureHomotopyCodimensionFano planeSpace (mathematics)Moduli spaceMathematics::Algebraic GeometryDiscrete Mathematics and CombinatoricsGeometry and TopologyMathematics::Symplectic GeometryMathematical PhysicsAnalysisSmoothingMathematicsForum of Mathematics, Pi
researchProduct

Sharp dimension free quantitative estimates for the Gaussian isoperimetric inequality

2017

We provide a full quantitative version of the Gaussian isoperimetric inequality: the difference between the Gaussian perimeter of a given set and a half-space with the same mass controls the gap between the norms of the corresponding barycenters. In particular, it controls the Gaussian measure of the symmetric difference between the set and the half-space oriented so to have the barycenter in the same direction of the set. Our estimate is independent of the dimension, sharp on the decay rate with respect to the gap and with optimal dependence on the mass.

Statistics and ProbabilityGaussianGaussian isoperimetric inequality01 natural sciencesPerimeterSet (abstract data type)symbols.namesakeMathematics - Analysis of PDEsDimension (vector space)quantitative isoperimetric inequalityFOS: MathematicsMathematics::Metric Geometry0101 mathematicsSymmetric differenceGaussian isoperimetric inequalityQuantitative estimatesMathematics010102 general mathematicsMathematical analysisProbability (math.PR)49Q20Gaussian measure010101 applied mathematicssymbolsHigh Energy Physics::Experiment60E15Statistics Probability and UncertaintyMathematics - ProbabilityAnalysis of PDEs (math.AP)
researchProduct

Modular Structures on Trace Class Operators and Applications to Landau Levels

2009

The energy levels, generally known as the Landau levels, which characterize the motion of an electron in a constant magnetic field, are those of the one-dimensional harmonic oscillator, with each level being infinitely degenerate. We show in this paper how the associated von Neumann algebra of observables displays a modular structure in the sense of the Tomita–Takesaki theory, with the algebra and its commutant referring to the two orientations of the magnetic field. A Kubo–Martin–Schwinger state can be built which, in fact, is the Gibbs state for an ensemble of harmonic oscillators. Mathematically, the modular structure is shown to arise as the natural modular structure associated with the…

Statistics and ProbabilityGeneral Physics and AstronomyFOS: Physical sciencesGibbs state01 natural sciencessymbols.namesake0103 physical sciences0101 mathematics010306 general physicsSettore MAT/07 - Fisica MatematicaHarmonic oscillatorMathematical PhysicsMathematical physicsPhysicsNuclear operatorMathematics::Operator AlgebrasLandau level010102 general mathematicsDegenerate energy levelsHilbert spaceStatistical and Nonlinear PhysicsObservableLandau quantizationMathematical Physics (math-ph)Von Neumann algebraModeling and Simulationsymbolsmodular structure
researchProduct

From deterministic cellular automata to coupled map lattices

2016

A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have recently derived and that is not dependent on any freely adjustable parameters. The CMLs thus constructed are termed real-valued deterministic cellular automata (RDCA) and encompass all deterministic CAs in rule space in the asymptotic limit $\kappa \to 0$ of a continuous parameter $\kappa$. Thus, RDCAs generalize CAs in such a way that they constitute CMLs when $\kappa$ is finite and nonvanishing. In the limit $\kappa \to \infty$ all RDCAs are shown to ex…

Statistics and ProbabilityGeneral Physics and AstronomyFOS: Physical sciencesPattern Formation and Solitons (nlin.PS)Space (mathematics)01 natural sciences010305 fluids & plasmasLinear stability analysis0103 physical sciencesLimit (mathematics)Statistical physics010306 general physicsMathematical PhysicsBifurcationPhysicsCellular Automata and Lattice Gases (nlin.CG)Quiescent stateStatistical and Nonlinear PhysicsNonlinear Sciences - Chaotic DynamicsNonlinear Sciences - Pattern Formation and SolitonsCellular automatonNonlinear Sciences - Adaptation and Self-Organizing SystemsHomogeneousModeling and SimulationContinuous parameterChaotic Dynamics (nlin.CD)Adaptation and Self-Organizing Systems (nlin.AO)Nonlinear Sciences - Cellular Automata and Lattice Gases
researchProduct

dglars: An R Package to Estimate Sparse Generalized Linear Models

2014

dglars is a publicly available R package that implements the method proposed in Augugliaro, Mineo, and Wit (2013), developed to study the sparse structure of a generalized linear model. This method, called dgLARS, is based on a differential geometrical extension of the least angle regression method proposed in Efron, Hastie, Johnstone, and Tibshirani (2004). The core of the dglars package consists of two algorithms implemented in Fortran 90 to efficiently compute the solution curve: a predictor-corrector algorithm, proposed in Augugliaro et al. (2013), and a cyclic coordinate descent algorithm, proposed in Augugliaro, Mineo, and Wit (2012). The latter algorithm, as shown here, is significan…

Statistics and ProbabilityGeneralized linear modelEXPRESSIONMathematical optimizationTISSUESFortrancyclic coordinate descent algorithmdgLARSFeature selectionDANTZIG SELECTORpredictor-corrector algorithmLIKELIHOODLEAST ANGLE REGRESSIONsparse modelsDifferential (infinitesimal)differential geometrylcsh:Statisticslcsh:HA1-4737computer.programming_languageMathematicsLeast-angle regressionExtension (predicate logic)Expression (computer science)generalized linear modelsBREAST-CANCER RISKVARIABLE SELECTIONDifferential geometrydifferential geometry generalized linear models dgLARS predictor-corrector algorithm cyclic coordinate descent algorithm sparse models variable selection.MARKERSHRINKAGEStatistics Probability and UncertaintyHAPLOTYPESSettore SECS-S/01 - StatisticacomputerAlgorithmSoftware
researchProduct

Extended differential geometric LARS for high-dimensional GLMs with general dispersion parameter

2018

A large class of modeling and prediction problems involves outcomes that belong to an exponential family distribution. Generalized linear models (GLMs) are a standard way of dealing with such situations. Even in high-dimensional feature spaces GLMs can be extended to deal with such situations. Penalized inference approaches, such as the $$\ell _1$$ or SCAD, or extensions of least angle regression, such as dgLARS, have been proposed to deal with GLMs with high-dimensional feature spaces. Although the theory underlying these methods is in principle generic, the implementation has remained restricted to dispersion-free models, such as the Poisson and logistic regression models. The aim of this…

Statistics and ProbabilityGeneralized linear modelMathematical optimizationGeneralized linear modelsPredictor-€“corrector algorithmGeneralized linear model02 engineering and technologyPoisson distributionDANTZIG SELECTOR01 natural sciencesCross-validationHigh-dimensional inferenceTheoretical Computer Science010104 statistics & probabilitysymbols.namesakeExponential familyLEAST ANGLE REGRESSION0202 electrical engineering electronic engineering information engineeringApplied mathematicsStatistics::Methodology0101 mathematicsCROSS-VALIDATIONMathematicsLeast-angle regressionLinear model020206 networking & telecommunicationsProbability and statisticsVARIABLE SELECTIONEfficient estimatorPredictor-corrector algorithmComputational Theory and MathematicsDispersion paremeterLINEAR-MODELSsymbolsSHRINKAGEStatistics Probability and UncertaintySettore SECS-S/01 - StatisticaStatistics and Computing
researchProduct

Differential geometric least angle regression: a differential geometric approach to sparse generalized linear models

2013

Summary Sparsity is an essential feature of many contemporary data problems. Remote sensing, various forms of automated screening and other high throughput measurement devices collect a large amount of information, typically about few independent statistical subjects or units. In certain cases it is reasonable to assume that the underlying process generating the data is itself sparse, in the sense that only a few of the measured variables are involved in the process. We propose an explicit method of monotonically decreasing sparsity for outcomes that can be modelled by an exponential family. In our approach we generalize the equiangular condition in a generalized linear model. Although the …

Statistics and ProbabilityGeneralized linear modelSparse modelMathematical optimizationGeneralized linear modelsVariable selectionPath following algorithmEquiangular polygonGeneralized linear modelLASSODANTZIG SELECTORsymbols.namesakeExponential familyLasso (statistics)Sparse modelsDifferential geometryInformation geometryCOORDINATE DESCENTFisher informationERRORMathematicsLeast-angle regressionLeast angle regressionGeneralized degrees of freedomsymbolsSHRINKAGEStatistics Probability and UncertaintySimple linear regressionInformation geometrySettore SECS-S/01 - StatisticaAlgorithmCovariance penalty theory
researchProduct

A differential-geometric approach to generalized linear models with grouped predictors

2016

We propose an extension of the differential-geometric least angle regression method to perform sparse group inference in a generalized linear model. An efficient algorithm is proposed to compute the solution curve. The proposed group differential-geometric least angle regression method has important properties that distinguish it from the group lasso. First, its solution curve is based on the invariance properties of a generalized linear model. Second, it adds groups of variables based on a group equiangularity condition, which is shown to be related to score statistics. An adaptive version, which includes weights based on the Kullback-Leibler divergence, improves its variable selection fea…

Statistics and ProbabilityGeneralized linear modelStatistics::TheoryMathematical optimizationProper linear modelGeneral MathematicsORACLE PROPERTIESGeneralized linear modelSPARSITYGeneralized linear array model01 natural sciencesGeneralized linear mixed modelCONSISTENCY010104 statistics & probabilityScore statistic.LEAST ANGLE REGRESSIONLinear regressionESTIMATORApplied mathematicsDifferential geometry0101 mathematicsDivergence (statistics)MathematicsVariance functionDifferential-geometric least angle regressionPATH ALGORITHMApplied MathematicsLeast-angle regressionScore statistic010102 general mathematicsAgricultural and Biological Sciences (miscellaneous)Group lassoGROUP SELECTIONStatistics Probability and UncertaintyGeneral Agricultural and Biological SciencesSettore SECS-S/01 - Statistica
researchProduct

Fractional Brownian motion and Martingale-differences

2004

Abstract We generalize a result of Sottinen (Finance Stochastics 5 (2001) 343) by proving an approximation theorem for the fractional Brownian motion, with H> 1 2 , using martingale-differences.

Statistics and ProbabilityGeometric Brownian motionFractional Brownian motionMathematics::ProbabilityDiffusion processReflected Brownian motionMathematical analysisBrownian excursionStatistics Probability and UncertaintyHeavy traffic approximationMartingale (probability theory)Martingale representation theoremMathematicsStatistics & Probability Letters
researchProduct

On the derivation of a linear Boltzmann equation from a periodic lattice gas

2004

We consider the problem of deriving the linear Boltzmann equation from the Lorentz process with hard spheres obstacles. In a suitable limit (the Boltzmann-Grad limit), it has been proved that the linear Boltzmann equation can be obtained when the position of obstacles are Poisson distributed, while the validation fails, also for the "correct" ratio between obstacle size and lattice parameter, when they are distributed on a purely periodic lattice, because of the existence of very long free trajectories. Here we validate the linear Boltzmann equation, in the limit when the scatterer's radius epsilon vanishes, for a family of Lorentz processes such that the obstacles have a random distributio…

Statistics and ProbabilityHPP modelApplied MathematicsMathematical analysisLattice Boltzmann methodsHard spheresLattice gaBoltzmann equationLattice gasLattice constantModelling and SimulationModeling and SimulationLattice (order)Linear Boltzmann equationMarkov proceMarkov processJump processScalingLinear equationMathematicsStochastic Processes and their Applications
researchProduct