510 Mathematik
Refine
Year of publication
Document Type
- Article (262) (remove)
Keywords
- random point processes (17)
- statistical mechanics (17)
- stochastic analysis (17)
- data assimilation (7)
- Bayesian inference (6)
- Navier-Stokes equations (4)
- Neumann problem (4)
- discrepancy principle (4)
- ensemble Kalman filter (4)
- linear term (4)
- Bayesian inverse problems (3)
- Fokker-Planck equation (3)
- Hodge theory (3)
- clone (3)
- gradient flow (3)
- linear hypersubstitution (3)
- optimal transport (3)
- partial clone (3)
- regularization (3)
- relative rank (3)
- Bayesian inversion (2)
- Dirac operator (2)
- Dirichlet form (2)
- Edge calculus (2)
- Fredholm property (2)
- Gamma-convergence (2)
- Gaussian process (2)
- Graphs (2)
- Kalman filter (2)
- Laplacian (2)
- MCMC (2)
- Mellin symbols with values in the edge calculus (2)
- Mellin transform (2)
- Model order reduction (2)
- Onsager-Machlup functional (2)
- Royden boundary (2)
- Specific entropy (2)
- Time series (2)
- Zaremba problem (2)
- adaptive estimation (2)
- approximation (2)
- asymptotic behavior (2)
- classical solution (2)
- cohomology (2)
- de Rham complex (2)
- early stopping (2)
- estimation (2)
- filter (2)
- formula (2)
- generators (2)
- hyperbolic tilings (2)
- index (2)
- isotopic tiling theory (2)
- linear formula (2)
- linear tree language (2)
- localization (2)
- maximum a posteriori (2)
- methods (2)
- models (2)
- multiplicative noise (2)
- nonlinear operator (2)
- operator-valued symbols (2)
- orbifolds (2)
- particle filter (2)
- stochastic differential equations (2)
- term (2)
- transfer operator (2)
- transformations (2)
- transition path theory (2)
- uncertainty quantification (2)
- 26D15 (1)
- 31C20 (1)
- 35B09 (1)
- 35R02 (1)
- 39A12 (primary) (1)
- 58E35 (secondary) (1)
- AFLP (1)
- ALOS-2 PALSAR-2 (1)
- APX-hardness (1)
- Absorbed dose (1)
- Achievement goal orientation (1)
- Actin cytoskeleton dynamics (1)
- Algebraic Birkhoff factorisation (1)
- Analytic extension (1)
- Animal movement modeling (1)
- Anisotropic pseudo-differential operators (1)
- Arctic haze (1)
- Arnoldi process (1)
- Assimilation (1)
- Atiyah-Bott obstruction (1)
- Atmosphere (1)
- Automotive (1)
- Banach-valued process (1)
- Bernstein inequality (1)
- Bethe (1)
- Bisectorial operator (1)
- Blood coagulation network (1)
- Boltzmann distribution (1)
- Boolean model (1)
- Boundary value problems (1)
- Boutet de Monvel's calculus (1)
- Breathing chimera states (1)
- Brownian motion with discontinuous drift (1)
- COVID-19 (1)
- CRPS (1)
- Cartan's development (1)
- Cartesian product of varifolds (1)
- Cauchy problem (1)
- Cayley trees (1)
- Central extensions of groups (1)
- Characteristic function (1)
- Characteristic polynomial (1)
- Cheeger inequality (1)
- Chimera (1)
- Cloud Computing (1)
- Cognitive style (1)
- Coherence-incoherence (1)
- Collapse (1)
- Complete asymptotics (1)
- Complexity (1)
- Composition operators (1)
- Compound Poisson processes (1)
- Condition number (1)
- Connectivity (1)
- Conradian left-order (1)
- Constant scalar curvature (1)
- Continuum random cluster model (1)
- Control theory (1)
- Core field (1)
- Correlation based modelling (1)
- Coupled oscillators (1)
- Curvature varifold (1)
- C‐ reactive protein remission (1)
- DFN (1)
- DLR equation (1)
- DLR equations (1)
- Data assimilation (1)
- Data augmentation (1)
- De Rham complex (1)
- Delaney--Dress (1)
- Dependent thinning (1)
- Derivation (1)
- Determinant (1)
- Dirac operators (1)
- Dirichlet mixture (1)
- Dirichlet problem (1)
- Disagreement percolation (1)
- Discovery learning (1)
- Discrete Dirichlet forms (1)
- Distributed Learning (1)
- Dobrushin criterion; (1)
- Dose rate (1)
- Dynamo (1)
- E-band (1)
- Earth's magnetic field (1)
- Earthquake modeling (1)
- Effort (1)
- Elementary school students (1)
- Elliptic boundary (1)
- Elliptic complexes (1)
- Ellipticity and parametrices (1)
- Ensemble Kalman (1)
- Entdeckendes Lernen (1)
- Epistemologie (1)
- Epistemology (1)
- Error analysis (1)
- Euclidean fields (1)
- Exponential decay of pair correlation (1)
- Eye-tracking (1)
- Fast win (1)
- Fence (1)
- Finite transformation semigroup (1)
- First variation (1)
- Fluvial (1)
- Fourier and Mellin transforms (1)
- Fourier-Laplace transform (1)
- Fractional calculus (primary) (1)
- Fractional moments (1)
- Fredholm operator (1)
- Freidlin-Wentzell theory (1)
- Functional calculus (1)
- Future time interval (1)
- Gardner equation (1)
- Gauss-Bonnet-Chern (1)
- Gaussian sequence model (1)
- Gender (1)
- Generalised mean curvature vector (1)
- Geomagnetic field (1)
- Geomagnetic jerks (1)
- Geomagnetic secular variation (1)
- Geomagnetism (1)
- Gibbs point process (1)
- Gigli-Mantegazza flow (1)
- Greatest harmonic minorant (1)
- Green's function (1)
- Green´s Relations (1)
- H-infinity-functional calculus (1)
- Hamiltonian dynamics (1)
- Hamiltonicity (1)
- Harmonic measure (1)
- Hawkes process (1)
- Heavy-tailed distributions (1)
- Helmholtz problem (1)
- Hermeneutik (1)
- Heuristics (1)
- High dimensional statistical inference (1)
- Hilbert Scales (1)
- Hochschule (1)
- Holomorphic mappings (1)
- Hopf algebra (1)
- Hughes-free (1)
- IGRF (1)
- Idempotents (1)
- Ill-conditioning (1)
- Indefinite (1)
- Inference post model-selection (1)
- Infinite chain (1)
- Infinite graph (1)
- Infinite-dimensional SDE (1)
- Infinite-dimensional interacting diffusion (1)
- Inquiry-based learning (1)
- Instruction (1)
- Integral varifold (1)
- Interpolation (1)
- Intrinsicmotivation (1)
- Inverse problem (1)
- Inverse problems (1)
- Iran (1)
- Jump processes (1)
- KB-space (1)
- Kalman Bucy filter (1)
- Kato square root problem (1)
- Kegel space (1)
- Kernel regression (1)
- Koopman operator (1)
- Koopman semigroup (1)
- Lagrangian system (1)
- Lame system (1)
- Landing site selection (1)
- Landweber iteration (1)
- Langevin dynamics (1)
- Laplace-type operator (1)
- Lattice cones (1)
- Learning theory (1)
- Left-ordered groups (1)
- Leistungstests (1)
- Lerntheorie (1)
- Level of confidence (1)
- Levenberg-Marquardt method (1)
- Levy process (1)
- Levy type processes (1)
- Lie groupoid (1)
- Linear inverse problems (1)
- Locality (1)
- Lyapunov equation (1)
- Lyapunov exponent (1)
- MASCOT (1)
- MCMC modelling (1)
- MOSAiC (1)
- MSAP (1)
- Machine learning (1)
- Magnus expansion (1)
- Manifolds with boundary (1)
- Marked Gibbs process (1)
- Markov decision process; (1)
- Markov semigroups (1)
- Mathematical modeling (1)
- Mathematics classrooms (1)
- Mathematics problem-solving (1)
- Matrix function approximation (1)
- Maximum expected earthquake magnitude (1)
- Maximum likelihood estimation (1)
- McKean-Vlasov (1)
- Mean first encounter time (1)
- Measure-preserving semiflow (1)
- Mellin operators (1)
- Mellin oscillatory integrals (1)
- Mellin quantization (1)
- Mellin quantizations (1)
- Menger algebra of rank n (1)
- Metacognition (1)
- Metastasis (1)
- Minimax Optimality (1)
- Minimax convergence rates (1)
- Minimax hypothesis testing (1)
- Mittag-Leffler (1)
- Model selection (1)
- Monte Carlo (1)
- Motivation profiles (1)
- Multi-method interview approach (1)
- Multimedia learning (1)
- Multiple zeta values (1)
- Multiplicative Levy noise (1)
- Multivariate meromorphic functions (1)
- NWP (1)
- Network (1)
- Nodal domain (1)
- Non-Markov drift (1)
- Non-linear semigroups (1)
- Non-regular drift (1)
- Nonlinear systems (1)
- Numerical weather prediction (1)
- Ny-Alesund (1)
- Ollivier-Ricci (1)
- Operation (1)
- Operator differential equations (1)
- Operator-valued symbols of Mellin type (1)
- Operators on singular cones (1)
- Operators on singular manifolds (1)
- Optimality conditions (1)
- Order-preserving (1)
- Order-preserving bijections (1)
- Order-preserving transformations (1)
- Ordered fields (1)
- Orlicz space height-excess (1)
- Ornstein-Uhlenbeck (1)
- Ott-Antonsen equation (1)
- Pade approximants (1)
- Parametric drift estimation (1)
- Parametrices of elliptic operators (1)
- Partial algebra (1)
- Penalized likelihood (1)
- Perfect groups (1)
- Periodic solutions (1)
- Perron-Frobenius operator (1)
- Pfaffian (1)
- Phase transition (1)
- Physics-based machine learning (1)
- Place value (1)
- PoSI constants (1)
- Poincare inequality (1)
- Poisson process (1)
- Popular matching (1)
- Porous medium equation (1)
- Positional games (1)
- Positive scalar curvature (1)
- Positive semigroups (1)
- Potential theory (1)
- Primary 26D15 (1)
- Proper orthogonal decomposition (1)
- Pseudo-differential operators (1)
- Quadratic tilt-excess (1)
- Quadrature rule (1)
- Quasilinear equations (1)
- Quasimodes (1)
- RADFET (1)
- RMSE (1)
- Radar backscatter (1)
- Radiation hardness (1)
- Random walks (1)
- Randomisation (1)
- Randomized strategy (1)
- Rank of semigroup (1)
- Rarita-Schwinger (1)
- Rasch test modelling (1)
- Real-variable harmonic analysis (1)
- Reciprocal processes (1)
- Removable sets (1)
- Renormalisation (1)
- Renormalization (1)
- Reproducing kernel Hilbert space (1)
- Riemannian manifold (1)
- Riesz continuity (1)
- Riesz topology (1)
- Rooted trees (1)
- Rota-Baxter (1)
- Rota-Baxter algebra (1)
- Rough paths (1)
- SAR amplitude (1)
- SPDEs (1)
- Sampling (1)
- Scattering theory (1)
- Schrodinger equation (1)
- Schrödinger operator (1)
- Second fundamental form (1)
- Secular variation (1)
- Secular variation rate of change (1)
- Self-adaptive MPSoC (1)
- Self-exciting point process (1)
- Sentinel-1 (1)
- Sequential data assimilation (1)
- Sharp threshold (1)
- Shuffle products (1)
- Signatures (1)
- Simulation of Gaussian processes (1)
- Singular analysis (1)
- Singular cones (1)
- Sinkhorn approximation (1)
- Sinkhorn problem (1)
- Small (1)
- Smoothing (1)
- Sociolinguistics (1)
- Soziolinguistik (1)
- Spatio-temporal ETAS model (1)
- Spectral Regularization (1)
- Spectral analysis (1)
- Spectral flow (1)
- Spectral gap (1)
- Spectral regularization (1)
- Spin geometry (1)
- Stability (1)
- Stable matching (1)
- Statistical inverse problem (1)
- Statistical learning (1)
- Stochastic Burgers equations (1)
- Stochastic bridges (1)
- Stochastic differential equations (1)
- Stochastic domination (1)
- Stochastic epidemic model (1)
- Stochastic reaction– diffusion (1)
- Stochastic systems (1)
- Stormer-Verlet method (1)
- Stratified spaces (1)
- Structured population equation (1)
- Studium (1)
- Sturm-Liouville problems of higher order (1)
- Subcritical (1)
- Subdivision schemes (1)
- Super-quadratic tilt-excess (1)
- Surface roughness (1)
- Survival probability (1)
- Svalbard (1)
- Sylvester equations (1)
- TIMSS (1)
- TerraSAR-X/TanDEM-X (1)
- Testfähigkeit (1)
- The Yamabe (1)
- Thermal mathematical model (1)
- Tikhonov regularization (1)
- Time integration (1)
- Toeplitz-type pseudodifferential operators (1)
- Topological model (1)
- Trace Dirichlet form (1)
- Transformation semigroups (1)
- Transformation semigroups on infinite chains (1)
- Tunneling (1)
- Turbulence (1)
- Twisted product (1)
- Umbilic product (1)
- Uncertainty quantification (1)
- Unique Gibbs state (1)
- Universal covering group (1)
- Variational principle (1)
- Vector bundle (1)
- Verbalizer (1)
- Visualizer (1)
- Volterra operator (1)
- WKB-expansion (1)
- Warped product (1)
- Wasserstein distance (1)
- Weighted (1)
- Yamabe invariant (1)
- Yamabe operator (1)
- Zig-zag order (1)
- a posteriori stopping rule (1)
- accelerated small (1)
- accuracy (1)
- adaptive (1)
- adaptivity (1)
- adrenal insufficiency (1)
- aerosol (1)
- aerosol-boundary layer interactions (1)
- affine (1)
- affine invariance (1)
- algebra (1)
- algebra of rank n (1)
- algebraic systems (1)
- algebras (1)
- algorithmic (1)
- alignment (1)
- alternating direction implicit (1)
- analytic functional (1)
- animal behavior (1)
- antigen processing (1)
- aptitude tests (1)
- archaeomagnetism (1)
- articulation (1)
- association (1)
- asymptotic expansions (1)
- asymptotic method (1)
- asymptotic properties of eigenfunctions (1)
- autocorrelation function (1)
- backtrajectories; (1)
- backward heat problem (1)
- balanced dynamics (1)
- binding (1)
- bioinformatics (1)
- boundary regularity (1)
- boundary value problems (1)
- bumps (1)
- classification with partial labels (1)
- clathrin (1)
- cluster expansion (1)
- coherent set (1)
- coloration of terms (1)
- colored solid varieties (1)
- compact resolvent (1)
- compacton (1)
- companies (1)
- complex (1)
- complexity (1)
- compound polyhedra (1)
- computational biology (1)
- concentration (1)
- conditions (1)
- conditions of success (1)
- confidence intervals (1)
- confidence sets (1)
- continuous-time data assimilation (1)
- convergence assessment (1)
- convergence rate (1)
- corner Sobolev spaces with double weights (1)
- corner parametrices (1)
- correlated noise (1)
- correlations (1)
- cortisol (1)
- crossed product (1)
- cytosine methylation (1)
- data matching (1)
- data profiling (1)
- delaney-dress tiling theory (1)
- density estimation (1)
- dependency discovery (1)
- design thinking (1)
- deterministic properties (1)
- deterministic random walk (1)
- dht-symmetric category (1)
- diffusion (1)
- diffusion maps (1)
- dimension independent bound (1)
- disagreement percolation (1)
- discrete Schrodinger (1)
- distribution (1)
- distribution with asymptotics (1)
- distributions with one-sided support (1)
- division of spaces (1)
- division ring of fractions (1)
- dominant matching (1)
- dried blood spots (1)
- drug monitoring (1)
- dynamic pricing (1)
- dynamic programming (1)
- dynamical models (1)
- early mathematical education (1)
- earthquake precursor (1)
- eigenfunction (1)
- eigenvalue decay (1)
- eigenvalues (1)
- electronic mail (1)
- elliptic boundary (1)
- elliptic complexes (1)
- elliptic differential operators of firstorder (1)
- elliptic equation (1)
- ellipticity (1)
- endomorphism semigroup (1)
- ensembles (1)
- entity resolution (1)
- ergodic diffusion processes (1)
- error diagram (1)
- evolution equation (1)
- exact simulation methods (1)
- existence (1)
- exit calculus (1)
- eye movements (1)
- feedback particle filter (1)
- fence-preserving transformations (1)
- fibration (1)
- first boundary value problem (1)
- first exit location (1)
- first passage times (1)
- flood loss estimation (1)
- forecasting (1)
- formal (1)
- formulas (1)
- fractional Brownian motion (1)
- fracture (1)
- frameworks (1)
- frequency-modulated continuous-wave (FMCW) (1)
- function (1)
- functional calculus (1)
- functional dependencies (1)
- game theory (1)
- genome scan (1)
- geomagnetic field (1)
- geomorphology (1)
- geophysics (1)
- geopotential theory (1)
- gradient-free (1)
- gradient-free sampling methods (1)
- graph (1)
- graph Laplacian (1)
- green function (1)
- ground state (1)
- group (1)
- group ring (1)
- groups (1)
- heat kernel (1)
- helicates (1)
- hermeneutics (1)
- heterogeneity (1)
- heuristics (1)
- high dimensional (1)
- high-dimensional inference (1)
- higher-order Sturm–Liouville problems (1)
- highly (1)
- holomorphic function (1)
- hydraulic tomography (1)
- hydrogeophysics (1)
- idealised turbulence (1)
- idleness (1)
- ill-posed problem (1)
- ill-posed problems (1)
- infinitesimal generator (1)
- inflammatory bowel disease (1)
- infliximab dosing (1)
- interacting particle systems (1)
- interacting particles (1)
- interindividual differences (1)
- invariance (1)
- inverse Sturm-Liouville problems (1)
- inverse Sturm–Liouville problems (1)
- inverse problem (1)
- inverse semigroup (1)
- inverse theory (1)
- iterative regularization (1)
- kernel methods (1)
- kernel operator (1)
- large deviations principle (1)
- latent profile analysis (1)
- lattice packing and covering (1)
- lattices (1)
- lidar (1)
- likelihood function (1)
- limiting distribution (1)
- linear inverse problems (1)
- linear regression (1)
- linear response (1)
- linearly implicit time stepping methods (1)
- localisation (1)
- locally indicable group (1)
- log-concavity (1)
- logarithmic source condition (1)
- low rank matrix recovery (1)
- low rank recovery (1)
- low-rank approximations (1)
- magnetic field variations through (1)
- manifolds with boundary (1)
- manifolds with conical singularities (1)
- manifolds with edge and boundary (1)
- many-electron systems (1)
- mapping class (1)
- mapping class group (1)
- mapping degree (1)
- maps on surfaces (1)
- matching dependencies (1)
- mathematical concepts (1)
- matrices (1)
- matrix completion (1)
- maximal regularity (1)
- mean ergodic (1)
- mean-field equations (1)
- mean-variance optimization (1)
- memory kernel (1)
- mental arithmetic (1)
- mental number line (1)
- mesoscale forecasting (1)
- metal-organic (1)
- methods: data analysis (1)
- microphysical properties (1)
- mild solution (1)
- minimax convergence rates (1)
- minimax hypothesis testing (1)
- minimax optimality (1)
- minor planets, asteroids: individual: (162173) Ryugu (1)
- mixed membership models (1)
- mixing (1)
- mixing optimization (1)
- model error (1)
- modified Landweber method (1)
- morphology (1)
- motion correction (1)
- multi-hypersubstitutions (1)
- multi-modular morphology (1)
- multi-scale diffusion processes (1)
- multiclass classification with label noise (1)
- multivariable (1)
- mutual contamination models (1)
- n-ary operation (1)
- n-ary term (1)
- negative curvature (1)
- network creation games (1)
- neural networks (1)
- noise Levy diffusions (1)
- non-exponential relaxation (1)
- nonasymptotic minimax separation rate (1)
- nondeterministic linear hypersubstitution (1)
- nonlinear (1)
- nonlinear PDI (1)
- nonlinear equations (1)
- nonlinear filtering (1)
- nonlinear lattice (1)
- nonparametric hypothesis testing (1)
- nonparametric statistics (1)
- numerical (1)
- numerical analysis/modeling (1)
- numerical methods (1)
- numerical weather prediction (1)
- numerical weather prediction/forecasting (1)
- open mapping theorem (1)
- operational momentum (1)
- operator (1)
- operators (1)
- optimal order (1)
- optimal rate (1)
- oracle inequalities (1)
- oracle inequality (1)
- oral anticancer drugs (1)
- order continuous norm (1)
- order-preserving (1)
- ordered group (1)
- organizations (1)
- orientation-preserving (1)
- orientation-preserving transformations (1)
- oscillatory systems (1)
- palaeomagnetism (1)
- paleoearthquakes (1)
- parabolic Harnack estimate (1)
- parameter estimation (1)
- parametrices (1)
- parametrices of elliptic operators (1)
- partial (1)
- partial Menger (1)
- particle methods (1)
- patch antenna (1)
- pathwise expectations (1)
- patterns (1)
- pediatrics (1)
- personalised medicine (1)
- pharmacokinetics (1)
- phase-locked loop (PLL) (1)
- physics learning (1)
- point process (1)
- polyhedra and polytopes (1)
- popular matching (1)
- positive mass theorem (1)
- positive operators (1)
- positive solutions (1)
- posterior distribution (1)
- power amplifier (PA) (1)
- power series (1)
- power-law (1)
- prediction (1)
- presentations (1)
- price of anarchy (1)
- probabilistic modeling (1)
- problem (1)
- problem-solving (1)
- problems (1)
- proteasome (1)
- protein degradation (1)
- proteolysis (1)
- prototypes (1)
- pseudo-differential boundary value problems (1)
- pseudo-differential operators (1)
- quasilinear Fredholm operators (1)
- r-hypersubstitution (1)
- r-term (1)
- radar (1)
- radiation mechanisms: thermal (1)
- random graphs (1)
- randomness (1)
- rank (1)
- rare events (1)
- rational Krylov (1)
- reading (1)
- real-variable harmonic analysis (1)
- red blood cells (1)
- regular figures (1)
- regular polyhedra (1)
- representations of groups as automorphism groups of (1)
- reproducing kernel Hilbert space (1)
- requirements engineering (1)
- residue (1)
- resolvents (1)
- restricted isometry property (1)
- restricted range (1)
- risk aversion (1)
- rotational diffusion (1)
- rotor-router model (1)
- rough metrics (1)
- saccades (1)
- sampling (1)
- scalable (1)
- scaled Brownian motion (1)
- secular variation (1)
- seismic hazard (1)
- semi-Lagrangian method (1)
- semigroup representations (1)
- semigroups on infinite chain (1)
- shallow-water equations (1)
- short-range prediction (1)
- similarity measures (1)
- simulations (1)
- single particle tracking (1)
- single vertex discrepancy (1)
- singular Sturm-Liouville (1)
- singular foliation (1)
- singular points (1)
- skew Brownian motion (1)
- skew diffusions (1)
- small ball probabilities (1)
- small ball probabilities; (1)
- smooth drift dependence (1)
- smoother (1)
- software (1)
- solitary wave (1)
- spacecraft operations (1)
- sparsity (1)
- spatial autocorrelation (1)
- spectral cut-off (1)
- spectral flow (1)
- spectral regularization (1)
- spectral theory (1)
- spread correction (1)
- stability (1)
- stability and accuracy (1)
- stable matching (1)
- statistical (1)
- statistical methods (1)
- statistical seismology (1)
- statistics (1)
- stochastic models (1)
- stochastic systems (1)
- strongly tempered stable Levy measure (1)
- subspaces (1)
- superposition (1)
- superposition of n-ary operations and n-ary (1)
- superposition of operations (1)
- surgery (1)
- susceptibility (1)
- systems (1)
- target dimensions (1)
- targeted antineoplastic drugs (1)
- temporal discretization (1)
- terms (1)
- terms and (1)
- test ability (1)
- theorem (1)
- theory (1)
- therapeutic (1)
- theta neurons (1)
- thymoproteasome (1)
- thymus (1)
- tiling theory (1)
- time (1)
- time-fractional derivative (1)
- tools (1)
- topic modeling (1)
- tracer tomography (1)
- transceiver (TRX) (1)
- transdimensional inversion (1)
- transformation (1)
- transition paths (1)
- tree conjecture (1)
- triply periodic minimal surface (1)
- truncated SVD (1)
- two-dimensional topology (1)
- tyrosine kinase inhibitors (1)
- uniqueness (1)
- unknown variance (1)
- unsteady flow (1)
- value problems (1)
- verification (1)
- weak boundary values (1)
- weak dependence (1)
- weakly almost periodic (1)
- weighted Sobolev spaces (1)
- weighted edge and corner spaces (1)
- weighted graphs (1)
- well-posedness (1)
- когомологии (1)
- комплекс де Рама (1)
- проблема Неймана (1)
- теория Ходжа (1)
Institute
- Institut für Mathematik (229)
- Institut für Physik und Astronomie (11)
- Hasso-Plattner-Institut für Digital Engineering gGmbH (6)
- Department Psychologie (4)
- Institut für Biochemie und Biologie (4)
- Department Grundschulpädagogik (2)
- Hasso-Plattner-Institut für Digital Engineering GmbH (2)
- Historisches Institut (2)
- Institut für Geowissenschaften (2)
- Extern (1)
We present a Reduced Order Model (ROM) which exploits recent developments in Physics Informed Neural Networks (PINNs) for solving inverse problems for the Navier-Stokes equations (NSE). In the proposed approach, the presence of simulated data for the fluid dynamics fields is assumed. A POD-Galerkin ROM is then constructed by applying POD on the snapshots matrices of the fluid fields and performing a Galerkin projection of the NSE (or the modified equations in case of turbulence modeling) onto the POD reduced basis. A POD-Galerkin PINN ROM is then derived by introducing deep neural networks which approximate the reduced outputs with the input being time and/or parameters of the model. The neural networks incorporate the physical equations (the POD-Galerkin reduced equations) into their structure as part of the loss function. Using this approach, the reduced model is able to approximate unknown parameters such as physical constants or the boundary conditions. A demonstration of the applicability of the proposed ROM is illustrated by three cases which are the steady flow around a backward step, the flow around a circular cylinder and the unsteady turbulent flow around a surface mounted cubic obstacle.
The past three decades of policy process studies have seen the emergence of a clear intellectual lineage with regard to complexity. Implicitly or explicitly, scholars have employed complexity theory to examine the intricate dynamics of collective action in political contexts. However, the methodological counterparts to complexity theory, such as computational methods, are rarely used and, even if they are, they are often detached from established policy process theory. Building on a critical review of the application of complexity theory to policy process studies, we present and implement a baseline model of policy processes using the logic of coevolving networks. Our model suggests that an actor's influence depends on their environment and on exogenous events facilitating dialogue and consensus-building. Our results validate previous opinion dynamics models and generate novel patterns. Our discussion provides ground for further research and outlines the path for the field to achieve a computational turn.
Instruments for measuring the absorbed dose and dose rate under radiation exposure, known as radiation dosimeters, are indispensable in space missions. They are composed of radiation sensors that generate current or voltage response when exposed to ionizing radiation, and processing electronics for computing the absorbed dose and dose rate. Among a wide range of existing radiation sensors, the Radiation Sensitive Field Effect Transistors (RADFETs) have unique advantages for absorbed dose measurement, and a proven record of successful exploitation in space missions. It has been shown that the RADFETs may be also used for the dose rate monitoring. In that regard, we propose a unique design concept that supports the simultaneous operation of a single RADFET as absorbed dose and dose rate monitor. This enables to reduce the cost of implementation, since the need for other types of radiation sensors can be minimized or eliminated. For processing the RADFET's response we propose a readout system composed of analog signal conditioner (ASC) and a self-adaptive multiprocessing system-on-chip (MPSoC). The soft error rate of MPSoC is monitored in real time with embedded sensors, allowing the autonomous switching between three operating modes (high-performance, de-stress and fault-tolerant), according to the application requirements and radiation conditions.
In this work we consider the first encounter problems between a fixed and/or mobile target A and a moving trap B on Bethe lattices and Cayley trees. The survival probabilities (SPs) of the target A on the both kinds of structures are considered analytically and compared. On Bethe lattices, the results show that the fixed target will still prolong its survival time, whereas, on Cayley trees, there are some initial positions where the target should move to prolong its survival time. The mean first encounter time (MFET) for mobile target A is evaluated numerically and compared with the mean first passage time (MFPT) for the fixed target A. Different initial settings are addressed and clear boundaries are obtained. These findings are helpful for optimizing the strategy to prolong the survival time of the target or to speed up the search process on Cayley trees, in relation to the target's movement and the initial position configuration of the two walkers. We also present a new method, which uses a small amount of memory, for simulating random walks on Cayley trees. (C) 2020 Elsevier B.V. All rights reserved.
An instance of the marriage problem is given by a graph G = (A boolean OR B, E), together with, for each vertex of G, a strict preference order over its neighbors. A matching M of G is popular in the marriage instance if M does not lose a head-to-head election against any matching where vertices are voters. Every stable matching is a min-size popular matching; another subclass of popular matchings that always exists and can be easily computed is the set of dominant matchings. A popular matching M is dominant if M wins the head-to-head election against any larger matching. Thus, every dominant matching is a max-size popular matching, and it is known that the set of dominant matchings is the linear image of the set of stable matchings in an auxiliary graph. Results from the literature seem to suggest that stable and dominant matchings behave, from a complexity theory point of view, in a very similar manner within the class of popular matchings. The goal of this paper is to show that there are instead differences in the tractability of stable and dominant matchings and to investigate further their importance for popular matchings. First, we show that it is easy to check if all popular matchings are also stable; however, it is co-NP hard to check if all popular matchings are also dominant. Second, we show how some new and recent hardness results on popular matching problems can be deduced from the NP-hardness of certain problems on stable matchings, also studied in this paper, thus showing that stable matchings can be employed to show not only positive results on popular matchings (as is known) but also most negative ones. Problems for which we show new hardness results include finding a min-size (resp., max-size) popular matching that is not stable (resp., dominant). A known result for which we give a new and simple proof is the NP-hardness of finding a popular matching when G is nonbipartite.
The Levenberg–Marquardt regularization for the backward heat equation with fractional derivative
(2022)
The backward heat problem with time-fractional derivative in Caputo's sense is studied. The inverse problem is severely ill-posed in the case when the fractional order is close to unity. A Levenberg-Marquardt method with a new a posteriori stopping rule is investigated. We show that optimal order can be obtained for the proposed method under a Hölder-type source condition. Numerical examples for one and two dimensions are provided.
Congenital adrenal hyperplasia (CAH) is the most common form of adrenal insufficiency in childhood; it requires cortisol replacement therapy with hydrocortisone (HC, synthetic cortisol) from birth and therapy monitoring for successful treatment. In children, the less invasive dried blood spot (DBS) sampling with whole blood including red blood cells (RBCs) provides an advantageous alternative to plasma sampling.
Potential differences in binding/association processes between plasma and DBS however need to be considered to correctly interpret DBS measurements for therapy monitoring. While capillary DBS samples would be used in clinical practice, venous cortisol DBS samples from children with adrenal insufficiency were analyzed due to data availability and to directly compare and thus understand potential differences between venous DBS and plasma. A previously published HC plasma pharmacokinetic (PK) model was extended by leveraging these DBS concentrations.
In addition to previously characterized binding of cortisol to albumin (linear process) and corticosteroid-binding globulin (CBG; saturable process), DBS data enabled the characterization of a linear cortisol association with RBCs, and thereby providing a quantitative link between DBS and plasma cortisol concentrations. The ratio between the observed cortisol plasma and DBS concentrations varies highly from 2 to 8. Deterministic simulations of the different cortisol binding/association fractions demonstrated that with higher blood cortisol concentrations, saturation of cortisol binding to CBG was observed, leading to an increase in all other cortisol binding fractions.
In conclusion, a mathematical PK model was developed which links DBS measurements to plasma exposure and thus allows for quantitative interpretation of measurements of DBS samples.
In this article we prove upper bounds for the Laplace eigenvalues lambda(k) below the essential spectrum for strictly negatively curved Cartan-Hadamard manifolds. Our bound is given in terms of k(2) and specific geometric data of the manifold. This applies also to the particular case of non-compact manifolds whose sectional curvature tends to -infinity, where no essential spectrum is present due to a theorem of Donnelly/Li. The result stands in clear contrast to Laplacians on graphs where such a bound fails to be true in general.
Diffusion maps is a manifold learning algorithm widely used for dimensionality reduction. Using a sample from a distribution, it approximates the eigenvalues and eigenfunctions of associated Laplace-Beltrami operators. Theoretical bounds on the approximation error are, however, generally much weaker than the rates that are seen in practice. This paper uses new approaches to improve the error bounds in the model case where the distribution is supported on a hypertorus. For the data sampling (variance) component of the error we make spatially localized compact embedding estimates on certain Hardy spaces; we study the deterministic (bias) component as a perturbation of the Laplace-Beltrami operator's associated PDE and apply relevant spectral stability results. Using these approaches, we match long-standing pointwise error bounds for both the spectral data and the norm convergence of the operator discretization. We also introduce an alternative normalization for diffusion maps based on Sinkhorn weights. This normalization approximates a Langevin diffusion on the sample and yields a symmetric operator approximation. We prove that it has better convergence compared with the standard normalization on flat domains, and we present a highly efficient rigorous algorithm to compute the Sinkhorn weights.
Our input is a complete graph G on n vertices where each vertex has a strict ranking of all other vertices in G. The goal is to construct a matching in G that is popular. A matching M is popular if M does not lose a head-to-head election against any matching M ': here each vertex casts a vote for the matching in {M,M '} in which it gets a better assignment. Popular matchings need not exist in the given instance G and the popular matching problem is to decide whether one exists or not. The popular matching problem in G is easy to solve for odd n. Surprisingly, the problem becomes NP-complete for even n, as we show here. This is one of the few graph theoretic problems efficiently solvable when n has one parity and NP-complete when n has the other parity.