Engineering PapersSearch

SEARCH · Engineering Papers

Results for “cluster computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

Photoelectron Spectroscopy and Computational Study on Microsolvated [B 10 H 10 ] 2– Clusters and Comparisons to Their [B 12 H 12 ] 2– Analogues

Microhydrated closo-Boranes have attracted great interests due to their superchaotropic activity related to well-known Hofmeister effect and important applications in biomedical and battery fields. In this work, we report a combined negative ion photoelectron spectroscopy and quantum chemical investigation on hydrated closo-decaborate clusters [B 10 H 10 ] 2- ·nH 2 O (n = 1 – 7) with a direct comparison to their analogues [B 12 H 12 ] 2- ·nH 2 O and free water clusters. A single H 2 O molecule is found sufficient to stabilize the intrinsically unstable [B 10 H 10 ] 2- dianion. The first two water molecules strongly interact with the solute forming B-H···H-O dihydrogen bonds while additional water molecules show substantially reduced binding energies. Unlike [B 12 H 12 ] 2- ·nH 2 O possessing highly structured water network with the attached H 2 O molecules arranged in a unified pattern by maximizing B-H···H-O dihydrogen bonding, distinct structural arrangements of the water clusters within [B 10 H 10 ] 2– ·nH 2 O are achieved with the water cluster networks from trimer to heptamer resembling free water clusters. Such a distinct difference arises from the variations in size, symmetry, and charge distributions between these two dianions. Finally, the present finding again confirms the structural diversity of hydrogen-bonding networks in microhydrated closo-boranes and enrich our understanding of aqueous borate chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Microcarbonation of Naphthalene: An Experimental and Computational Study of Photoionization in Naphthalene-Carbon Dioxide Clusters

The photoionization of naphthalene (N)-carbon dioxide (CO 2 ) clusters was studied using tunable vacuum ultraviolet (VUV) radiation from a synchrotron in the photon range of 8.0 to 13.7 eV, in combination with time-of-flight mass spectrometry. Clusters of monomer, dimer, and trimer naphthalene with CO 2 (N­(CO 2 ) 0–6 , N 2 ­(CO 2 ) 0–3 , N3) were observed. The lowest-energy conformers were obtained via a conformer search, followed by geometry optimizations at the ωB97X-V2/aug-cc-pVTZ (monomer) and ωB97X-V2/aug-cc-pVDZ (dimer) levels of theory. Carbon dioxide was found to preferentially cluster on top of the naphthalene molecule (in an out-of-plane configuration). From the mass spectra, photoionization intensity curves (PICs) were constructed, and appearance energies (AEs) were determined. No substantial trend in AE was observed with increasing size of the naphthalene-carbon dioxide clusters; rather, AE oscillations around the value for pure naphthalene were observed. These AE oscillations are also observed in a recently studied naphthalene-water cluster system, though in this system a slight downward trend in AE for pure naphthalene clusters (N1/2/3/4) was observed. The differences between the two systems are attributed to differing interaction strengths. In conclusion, understanding these differences may aid in determining how photoprocessing can proceed differently depending on the dominant matrix component in interstellar ices.

Wannenmacher, Anna [Lawrence Berkeley National Lab

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.

Density Functional Tight Binding Insights into Plasmonic Silver–Platinum Nanoparticles and Alloys for Enhanced Photocatalysis

Developing accurate and efficient Slater-Koster (SK) tight-binding parameter sets is essential for quantum plasmonic studies of alloyed metal nanoparticles, as conventional time dependent density functional theory (TD-DFT) calculations are computationally prohibitive for larger clusters. In this work, we develop and validate density functional tight binding (DFTB) parameter sets for both ground state (GS-SK) and excited state (ES-SK) calculations to study the structural, electronic, and optical properties of silver (Ag), platinum (Pt), and Ag–Pt nanoalloys. Our investigation of the ground state properties demonstrates that the GS-SK parameters enable DFTB to closely reproduce the electronic structures of platinum clusters with diverse sizes and geometries – showing qualitative agreement with DFT for density of states (DOS) profiles and energy levels. The ES-SK parameters accurately describe excited-state properties compared to TD-DFT reference calculations, including the broad, featureless absorption profiles of Pt that are dominated by interband transitions. Using the ES-SK parameters within a real-time TD-DFTB framework, we compute size-dependent optical absorption spectra of Ag, Pt and Ag-Pt nanocubes containing up to 1099 atoms (size ∼4.18 nm). A detailed study of Ag–Pt and Pt-Ag core–shell nanoparticles shows quenching of the Ag plasmon resonance even at monolayer coverage for Ag-Pt, but not for Pt-Ag. We also show how to define submonolayer Ag-core Pt-shell cubic structures that have similar optical properties to those generated experimentally for much larger particles, which offers potential for describing plasmon-enhanced photocatalysis. Collectively, the GS-SK and ES-SK parameter sets provide an accurate, computationally efficient approach for modeling the complex optical and electronic behavior of noble–transition metal nanostructures and their alloys.

SPR

A cluster of results on amplituhedron tiles

Abstract The amplituhedron is a mathematical object which was introduced to provide a geometric origin of scattering amplitudes in $$\mathcal {N}=4$$ N = 4 super Yang–Mills theory. It generalizes cyclic polytopes and the positive Grassmannian and has a very rich combinatorics with connections to cluster algebras. In this article, we provide a series of results about tiles and tilings of the $$m=4$$ m = 4 amplituhedron. Firstly, we provide a full characterization of facets of BCFW tiles in terms of cluster variables for $$\text{ Gr}_{4,n}$$ Gr 4 , n . Secondly, we exhibit a tiling of the $$m=4$$ m = 4 amplituhedron which involves a tile which does not come from the BCFW recurrence—the spurion tile, which also satisfies all cluster properties. Finally, strengthening the connection with cluster algebras, we show that each standard BCFW tile is the positive part of a cluster variety, which allows us to compute the canonical form of each such tile explicitly in terms of cluster variables for $$\text{ Gr}_{4,n}$$ Gr 4 , n . This paper is a companion to our previous paper “Cluster algebras and tilings for the $$m=4$$ m = 4 amplituhedron.”

Physics

DONKEY: A Flexible and Accurate Algorithm for Clustering

We propose an accurate clustering algorithm suitable for the varied and multidimensional data sets that correspond to temporal snapshots from on-the-fly nonadiabatic trajectory-based simulations of photoexcited dynamics. The algorithm approximates the underlying probability density function using variable kernel density estimation, with local maxima corresponding to cluster centers. Each data point is then assigned to one of the maxima by employing a maximization procedure. Finally, clusters artificially separated by minor fluctuations in the probability density are merged. The algorithm does not require parameter tuning, which ensures flexibility and reduces the risk of bias. It is tested on several synthetic data sets, where it consistently outperforms conventional clustering algorithms. As a final example, the algorithm is applied to the excited dynamics of the norbornadiene ⇌ quadricyclane (C 7 H 8 ) molecular photoswitch, demonstrating how distinct reaction pathways can be identified.

algorithms

LeaPP: Learning Pathways to Polymorphs through Machine Learning Analysis of Atomic Trajectories

Understanding the mechanisms underlying crystal nucleation and growth is crucial for many technological applications. Due to the short length and time scales involved, crystal nucleation is often studied using molecular simulations. Most existing approaches to extract the nucleation mechanism from simulations focus on the analysis of static snapshots of the configurations, potentially overlooking subtle local fluctuations and the history of the particles involved in the formation of solid nuclei. Here, in this work, we propose a novel methodology called LeaPP that categorizes nucleation trajectories based on the temporal information of their constituent particles. We leverage the time evolution of the local environment of the crystallizing particles to encapsulate the relationship between the structure and dynamics and distinguish between different evolving particle paths. Identification of the distinct particle paths further enables characterizing the nucleation trajectories into different pathways. Collectively, LeaPP provides a more nuanced understanding of nucleation through an unsupervised approach with lesser dependence on traditional order parameters. Furthermore, the pathways identified by LeaPP are predictive of the resulting polymorph. We demonstrate LeaPP on three different systems─Lennard-Jones-like particles, Ni 3 Al, and water on surfaces. The general methodology underlying LeaPP─considering the time evolution of the building blocks─applies to a wide range of self-assembly problems.

36 MATERIALS SCIENCE

Crystal Nucleation Kinetics and Mechanism: Influence of Interaction Potential

Modulating liquid-to-solid transitions and the resulting crystalline structure for tailored properties is much desired. Colloidal systems are exemplary to this end, but the fundamental knowledge gaps in relating the influence of intermolecular interactions to crystallization behavior continue to hinder progress. In this study, we address this knowledge gap by studying nucleation and growth in systems with modified Lennard-Jones potential. Specifically, we study the commonly used 12-6 potential and a softer 7-6 potential. The thermodynamic state point for the study is chosen such that both systems are investigated at the same level of supercooling and pressure. Under these conditions, we find that the nucleation rate for both systems is comparable. Interestingly, the nucleation pathways and resulting crystal structures are different. In the 12-6 system, nucleation and growth occur predominantly through the FCC structure. Softening the potential alters the critical nucleus composition and introduces two distinct nucleation pathways. One pathway predominantly leads to the nucleus with a body-centered cubic (BCC) structure, while the other favors the face-centered cubic (FCC) arrangement. Our study illustrates that polymorph selection can be achieved through modifications to intermolecular interactions without impacting nucleation kinetics. The results have significant implications in designing approaches for polymorph selection and modulating self-assembly mechanisms.

36 MATERIALS SCIENCE

Exactness of the normal-ordered two-body truncation of three-nucleon forces

Reference-state-based many-body methods start from Hamiltonians that are normal ordered with respect to the reference state. In low-energy nuclear physics applications, normal-ordered Hamiltonians consisting of two- and three-nucleon forces are usually truncated at the two-body rank with residual three-nucleon operators being discarded. Benchmark computations have shown that this truncation is accurate, but we lack an understanding about why it works. Here, we show that the normal-ordered two-body truncation is exact for zero-range three-body forces when nuclei are computed using the coupled cluster with singles and doubles method. As the nuclear three-nucleon force is short ranged and a three-body contact is a leading term in effective field theories of quantum chromodynamics, our result provides an analytical basis for the popular normal-ordered two-body approximation.

Rothman, Maxwell [Univ. of Tennessee, Knoxville, T

COLUMBUS─An Efficient and General Program Package for Ground and Excited State Computations Including Spin–Orbit Couplings and Dynamics

The COLUMBUS program system provides the tools for performing high-level multireference (MR) computations, including the multireference configuration interaction (MRCI) method and its multireference averaged quadratic coupled cluster (MR-AQCC) extension, allowing computations on a wide range of fascinating atomic and molecular systems, including the treatment of open-shells and complicated excited state phenomena. The inclusion of spin−orbit coupling (SOC) directly within the MRCI step enables the description of systems containing heavy elements, such as lanthanides and actinides, whose properties are strongly influenced by SOC. Analytic energy gradients and nonadiabatic couplings at the correlated MRCI level provide the foundation for a variety of dynamics studies, giving insight into ultrafast photochemistry. New and ongoing method developments in COLUMBUS include the computation of spin densities, improved descriptions of ionic states, enhancements to the AQCC method, and the porting of COLUMBUS to graphical processing units (GPUs). New external interfaces enable an enhanced description of electronic resonances and molecules in strong laser fields. This work highlights these new developments while providing a detailed account of the diverse applications of COLUMBUS in recent years.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Beyond real: alternative unitary cluster Jastrow models for molecular electronic structure calculations on near-term quantum computers

Near-term quantum devices require wavefunction ansätze that are expressive while also of shallow circuit depth in order to both accurately and efficiently simulate molecular electronic structure. While the unitary coupled cluster ansatz (e.g., UCCSD) has become a standard, the high gate count associated with the implementation of this limits its feasibility on noisy intermediate-scale quantum (NISQ) hardware. k -Fold unitary cluster Jastrow (uCJ) ansätze mitigate this challenge by providing O( kN 2 ) circuit scaling and favorable linear depth circuit implementation. Previous work has focused on the real orbitalrotation (Re-uCJ) variant of uCJ, which allows an exact (Trotter-free) implementation. Here we extend and generalize the k -fold uCJ framework by introducing two new variants, Im-uCJ and g-uCJ, which incorporate imaginary and fully complex orbital rotation operators, respectively. Similar to Re-uCJ, both of the new variants achieve quadratic gate-count scaling. Our results focus on the simplest k = 1 model, and show that the uCJ models frequently maintain energy errors within chemical accuracy (∼1 kcal mol −1 ). Both g-uCJ and Im-uCJ are more expressive in terms of capturing electron correlation and are also more accurate than the earlier Re-uCJ ansatz. We further show that Im-uCJ and g-uCJ circuits can also be implemented exactly, without any Trotter decomposition. Numerical tests using k = 1 on H 2 , H 3 + , Be 2 , C 2 H 4 , C 2 H 6 and C 6 H 6 in various basis sets confirm the practical feasibility of these shallow Jastrow-based ansätze for applications on near-term quantum hardware.

Tkachenko, Nikolay V. [University of California, B

Copacabana: a probabilistic membership assignment method for galaxy clusters

Cosmological analyses using galaxy clusters in optical/near-infrared photometric surveys require robust characterization of their galaxy content. Precisely determining which galaxies belong to a cluster is crucial. In this paper, we present the COlor Probabilistic Assignment of Clusters And BAyesiaN Analysis (Copacabana) algorithm. Copacabana computes membership probabilities for all galaxies within an aperture centred on the cluster using photometric redshifts, colours, and projected radial probability density functions. We use simulations to validate Copacabana and we show that it achieves up to 89 per cent membership accuracy with a mild dependence on photometric redshift uncertainties and choice of aperture size. We find that the precision of the photometric redshifts has the largest impact on the determination of the membership probabilities followed by the choice of the cluster aperture size. We also quantify how much these uncertainties in the membership probabilities affect the stellar mass–cluster mass scaling relation, a relation that directly impacts cosmology. Using the sum of the stellar masses weighted by membership probabilities (⁠μ * ⁠) as the observable, we find that Copacabana can reach an accuracy of 0.06 dex in the measurement of the scaling relation at low redshift for a Legacy Survey of Space and Time type survey. These results indicate the potential of Copacabana and μ * to be used in cosmological analyses of optically selected clusters in the future.

79 ASTRONOMY AND ASTROPHYSICS

Structure and Synthesizability of Iron–Sulfur Metal–Organic Frameworks

Sulfur-based metal–organic frameworks (MOFs) and coordination polymers (CPs) are an emerging class of hybrid materials that have received growing attention due to their magnetic, conductive, and catalytic properties with potential applications in electrocatalysis and energy storage. In this work, we report a high-throughput virtual screening protocol to predict the synthesizability of candidate metal–sulfur MOFs/CPs by computing the thermodynamically stable structures resulting from a particular combination of metal cluster, linker, cation, and synthetic conditions. Free energies are computed by using all-atom classical mechanical thermodynamic integration. Low-free-energy structures are refined using ab initio density functional theory, and pair distribution functions and powder X-ray diffraction patterns are calculated to complement and guide experimental structure determination. We validate the computational approach by retrospective predictions of the stable structure produced by experimental syntheses, and a subsequent screen predicts Fe 4 S 4 -BDT–TPP as a new thermodynamically stable one-dimensional (1D) CP comprising a redox-active Fe 4 S 4 cluster, a 1,4-benzenedithiolate (BDT) linker, and a tetraphenylphosphonium (TPP) countercation. Furthermore, this material is experimentally synthesized, and the 1D chain structure of the crystal is confirmed using microcrystal electron diffraction. The computational screening pipeline is generically transferable to neutral and ionic MOFs/CPs comprising arbitrary metal clusters, linkers, cations, and synthetic conditions, and we make it freely available as an open source tool to guide and accelerate the discovery and engineering of novel porous materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Performance Analysis of Data Processing in Distributed File Systems with Near Data Processing

In the era of big data, the escalating volume and velocity of data generation pose significant challenges in data processing. Traditional systems like Spark and Hadoop manage the increasing amount and velocity of data by improving data placement and processing speeds. However, they face inherent limitations due to the essential data movement required for processing. In this paper, we explore the Skyhook framework, a novel extension of the Ceph distributed system, which significantly reduces the need for data movement. We present an extensive case study using the Skyhook framework, applying it with the TPC-H and K-means clustering algorithms. More specifically, we leverage the TPC-H benchmark to distinguish between CPU-intensive and I/O-intensive tasks. We explore the integration of K-means clustering into SQL, coupled with a near-data processing system to offload the computational burden of the K-means clustering algorithm to storage nodes. We conduct a comprehensive performance evaluation of distributed data processing applications across three processing approaches: traditional layout (baseline), optimized layout, and near-data processing. Additionally, we introduce the use of the FIO tool to simulate real-world system workloads, enabling the measurement of performance metrics such as average latency and CPU utilization. Our research is a significant advance in understanding how to optimize data processing systems to meet the demands of the modern data landscape.

Hou, Shiyue

Uncertainty estimation of bifurcated solutions in the Rayleigh–Bénard problem for advanced nuclear reactors applications

Multiphysics models of nuclear reactors frequently comprise nonlinear systems of equations. The nonlinear nature of these models could lead to solution bifurcations, where a small change in a certain parameter, e.g., the thermophysical properties of the coolant, can lead to a sudden change in the system’s behavior. At the point in parameter space where this happens, called a critical point, the Jacobian matrix of the model’s nonlinear operator becomes singular potentially permitting multiple solutions to coexist. In this paper, we perform uncertainty estimation (UE) in a parameter range that includes bifurcated solutions within the context of Rayleigh–Bénard problem. We perform this analysis assuming uncertain temperature difference, and tilt angle for the iterative solution algorithm with a unit Prandtl number (Pr = 1). Also, we perform this analysis under uncertain thermophysical properties for both FLiBe molten salt and liquid sodium as working fluid. We deploy two approaches to compute statistical moments for the resulting distributions of selected flow-field variables. The first approach is the blind computation of the mean and the standard deviation without any consideration of solution bifurcation, while the second approach utilizes k-means clustering to cluster each branch’s solutions together and compute separate statistical moments for each branch. The statistical distributions are obtained by perturbing the selected parameters about nominal values that correspond to a solution on one of the valid branches, and that solution is used as initial guess for the iterative solution algorithm. We found that perturbation of any parameter when its nominal value is close to its critical point always leads to branch jumping, i.e., the iterations converge to a solution on a branch different from the branch of the initial guess. This produces a statistical ensemble comprised of fundamentally different solutions leading to wrong mean values and uncertainty estimates, whereas clustering provides an efficient way to deal with this type of computation. This work is important for developing Gen IV nuclear systems because many of these systems rely on natural convection for cooling especially in accident conditions.

97 - MATHEMATICS AND COMPUTING

Analytical and EZmock covariance validation for the DESI 2024 results

The estimation of uncertainties in cosmological parameters is an important challenge in Large-Scale-Structure (LSS) analyses. For standard analyses such as Baryon Acoustic Oscillations (BAO) and Full-Shape two approaches are usually considered. First: analytical estimates of the covariance matrix use Gaussian approximations and (nonlinear) clustering measurements to estimate the matrix, which allows a relatively fast and computationally cheap way to generate matrices that adapt to an arbitrary clustering measurement. On the other hand, sample covariances are an empirical estimate of the matrix based on an ensemble of clustering measurements from fast and approximate simulations. While more computationally expensive due to the large amount of simulations and volume required, these allow us to take into account systematics that are impossible to model analytically. In this work we compare these two approaches in order to enable DESI's key analyses. We find that the configuration space analytical estimate performs satisfactorily in BAO analyses and its flexibility in terms of input clustering makes it the fiducial choice for DESI's 2024 BAO analysis. On the contrary, the analytical computation of the covariance matrix in Fourier space does not reproduce the expected measurements in terms of Full-Shape analyses, which motivates the use of a corrected mock covariance for DESI's 2024 Full Shape analysis.

79 ASTRONOMY AND ASTROPHYSICS

Formation and transformation of iron oxy-hydroxide precursor clusters to ferrihydrite

Iron (Fe) oxy-hydroxide minerals such as ferrihydrite (Fh) are ubiquitous in Earth-surface environments and important in biogeochemical element cycling. Recent research has suggested that their formation is preceded by the precipitation of ultrasmall (~1 nm) Keggin-like Fe oxy-hydroxide clusters. However, relatively little is understood about the structure of the precursor clusters and the impacts of pH and time on their growth and transformation to more stable phases. Here, we used a new method that involves mixed flow reactors (MFR) to synthesize these Fe oxy-hydroxide precursor clusters at pH 1.0, 1.5, 2.5, and 4.5. In situ and ex situ synchrotron scattering measurements and laboratory small-angle X-ray scattering (SAXS) were used to study the structure and size of Fe oxy-hydroxide clusters and their transformation products, respectively. Results show that with increasing pH, the particle size and structural order of samples increase, forming solids that resemble 2-line Fh at pH 4.5. The experimental data were compared with X-ray pair distribution functions (PDF) calculated for a range of Fe(III) oxyhydroxide clusters, including Fe 13 Keggin isomers computed previously using density functional theory (DFT), which yielded at best only partial agreement at short range (<5 Å). Aging of the clusters synthesized at pH 1.5 and 2.5 results in growth and transformation via Ostwald ripening to mixtures of goethite (Gt) and lepidocrocite (Lp). This process was inhibited by immediately reacting the early-formed clusters with phosphate (PO 4 3– ), suggesting that oxyanion surface complexes can stabilize the initial clusters by preventing growth and crystallization to more stable phases.

58 GEOSCIENCES

Redshift evolution and covariances for joint lensing and clustering studies with DESI Y1

ABSTRACT Galaxy–galaxy lensing (GGL) and clustering measurements from the Dark Energy Spectroscopic Instrument Year 1 (DESI Y1) data set promise to yield unprecedented combined-probe tests of cosmology and the galaxy–halo connection. In such analyses, it is essential to identify and characterize all relevant statistical and systematic errors. We forecast the covariances of DESI Y1 GGL + clustering measurements and the systematic bias due to redshift evolution in the lens samples. Focusing on the projected clustering and GGL correlations, we compute a Gaussian analytical covariance, using a suite of N-body and lognormal simulations to characterize the effect of the survey footprint. Using the DESI one percent survey data, we measure the evolution of galaxy bias parameters for the DESI luminous red galaxy (LRG) and bright galaxy survey (BGS) samples. We find mild evolution in the LRGs in $0.4 < z < 0.8$, subdominant to the expected statistical errors. For BGS, we find less evolution for brighter absolute magnitude cuts, at the cost of reduced sample size. We find that for a redshift bin width $\Delta z = 0.1$, evolution effects on DESI Y1 GGL is negligible across all scales, all fiducial selection cuts, all fiducial redshift bins. Galaxy clustering is more sensitive to evolution due to the bias squared scaling. Nevertheless the redshift evolution effect is insignificant for clustering above the 1-halo scale of $0.1h^{-1}$ Mpc. For studies that wish to reliably access smaller scales, additional treatment of redshift evolution is likely needed. This study serves as a reference for GGL and clustering studies using the DESI Y1 sample.

79 ASTRONOMY AND ASTROPHYSICS