Results 31 to 40 of about 929 (112)
Survey on Visualization of Information Diffusion over Networks
Abstract Information Diffusion (ID) describes how a value (e.g., a pathogen, a rumor, a packet) spreads through an underlying “medium” network of elements (e.g., a social or computer network). Understanding the information diffusion process is essential to predicting trends, controlling misinformation, and enhancing decision‐making as well as ...
T. Baumgartl +8 more
wiley +1 more source
Solving Stochastic Climate‐Economy Models: A Deep Least‐Squares Monte Carlo Approach
ABSTRACT Stochastic versions of recursive integrated climate‐economy assessment models are essential for studying and quantifying policy decisions under uncertainty. However, as the number of state variables and stochastic shocks increases, solving these models via deterministic grid‐based dynamic programming (e.g., value‐function iteration/projection ...
Aleksandar Arandjelović +4 more
wiley +1 more source
On computing local monodromy and the numerical local irreducible decomposition
Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
On the additive image of zeroth persistent homology
Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
Context‐free graphs and their transition groups
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
ABSTRACT A weak c‐colouring of a design is an assignment of colours to its points from a set of c available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Localization sequences for logarithmic topological cyclic homology
Abstract We introduce the notion of an Ek$\mathbb {E}_k$‐ring with prelogarithmic structure, define logarithmic topological Hochschild homology and logarithmic topological cyclic homology in this context, and establish localization sequences for these theories. Our approach is based on Thom R$R$‐algebras.
John Rognes +2 more
wiley +1 more source
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
ABSTRACT The numerical approximation of nonlinear chaotic differential systems, such as the modified stretch‐twist‐fold (STF) flow and multi‐bond chaotic attractors, presents a significant challenge due to their sensitive dependence on initial conditions and complex dynamics where analytical solutions are unattainable.
Shina Daniel Oloniiju, Anastacia Dlamini
wiley +1 more source
Vector‐Driven Projection and Backprojection
Abstract Background Projection and backprojection are fundamental operators in tomographic image reconstruction. Existing approaches—namely pixel‐driven (PD), ray‐driven (RD), and distance‐driven (DD)—are subject to well‐known trade‐offs among interpolation artifacts, geometric flexibility, and computational cost. Purpose This study aims to introduce a
Ismail Melik Turker, Isa Yildirim
wiley +1 more source

