Tootfinder

"By Turning Themselves to Stone, These Remarkable Fig Trees Sequester CO2 Far Longer Than Normal"
#Trees #Environment #CarbonDioxide

By Turning Themselves to Stone, These Remarkable Fig Trees Sequester CO2 Far Longer Than Normal
The inorganic carbon in calcium carbonate typically has a much longer lifetime in the soil than organic carbon

This #photo is pretty soon after the first photo that I posted. I was on the way up and turned around to see the nice little meadow that I just crossed.
The #trail winding through the meadow with the trees around and the

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification
Mingzhe Li, Hamish Carr, Oliver R\"ubel, Bei Wang, Gunther H. Weber
https://arxiv.org/abs/2508.08433

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification
Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks -- such as …

Geometry of the space of phylogenetic trees with non-identical leaves
Maria Alejandra Valdez Cabrera, Amy D Willis
https://arxiv.org/abs/2508.06747 https://

Geometry of the space of phylogenetic trees with non-identical leaves
Phylogenetic trees summarize evolutionary relationships. The Billera-Holmes-Vogtmann (BHV) space for comparing phylogenetic trees has many elegant mathematical properties, but it does not encompass trees with differing leaf sets. To overcome this, we introduce Towering space: a complete metric space that extends BHV space to trees with non-identical leaf sets. Towering space is a structured collection of BHV spaces connected via pruning and regrafting operations. We study the geometry of paths …

This grassy field has always been a beautiful buffer between the river and the train tracks that service the local waste management company that owns it. This time of year, wildflowers and butterflies are everywhere and it’s one of the highlights on this part of the greenway.
This week, I’ve noticed it’s suddenly begun to accumulate vintage fire and rescue vehicles. I don’t know what to make of it, but I hope it’s temporary.

🌴 Commentary: Prepare to say a frond farewell to Los Angeles' palm trees
https://www.latimes.com/california/story/2025-08-10/prepare-to-say-farewell-to-los-angeles-palm-trees
🆓

Commentary: Prepare to say a frond farewell to Los Angeles’ palm trees
Palms are freeloader trees: They suck down water like camels, but give back barely enough leafiness to shade a Hula-Hoop.

On The Road - To Xi’An/Urban Tomb 🪦
在路上 - 去西安/城市坟茔 🪦
📷 Pentax MX
🎞️Lucky SHD 400
#filmphotography #Photography #blackandwhite

Recursions, Trains, Trees, and Combinatorial Rod Set Algebra
Ethan D. Bolker, Debra K. Borkovitz, Katelyn Lee
https://arxiv.org/abs/2508.08392 https://arxi…

Recursions, Trains, Trees, and Combinatorial Rod Set Algebra
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the subtrees define algebraic operations on sets of rods. We use this algebra to prove classic identities for recursively defined sequences, to show that Lucas sequences are divisibility sequences, to characterize two-term linear Fibonacci identities, and to find the c…

“We are definitely concerned about them and have taken efforts to protect those trees.”
Smoke jumpers have been requested to help put out the fires burning high in the trees.
Firefighters, meanwhile, placed sprinklers in key areas within the McKinley Grove to at least minimize damage to any of the ancient Sequoia trees.
The duff layer also was removed to reduce possibility of the forest floor near the Sequoias of burning with high intensity.
As of Tuesday evening, the Ga…

Trace Repair for Temporal Behavior Trees
Sebastian Schirmer, Philipp Schitz, Johann C. Dauer, Bernd Finkbeiner, Sriram Sankaranarayanan
https://arxiv.org/abs/2509.08610 https://…

Trace Repair for Temporal Behavior Trees
We present methods for repairing traces against specifications given as temporal behavior trees (TBT). TBT are a specification formalism for action sequences in robotics and cyber-physical systems, where specifications of sub-behaviors, given in signal temporal logic, are composed using operators for sequential and parallel composition, fallbacks, and repetition. Trace repairs are useful to explain failures and as training examples that avoid the observed problems. In principle, repairs can be …

@… Oh my! https://www.cbc.ca/news/canada/ottawa/8-ottawa-neighbourhoods-urgently-need-more-tre…

8 Ottawa neighbourhoods urgently need more trees. Here's where they are | CBC News
As part of the inaugural 'tree equity' analysis, city staff have identified eight priority areas across the city where more trees are badly needed.

Just a quick snap from today's bike and hike.
I'm a bit done now. Photos and video will come later.
#photography #naturephotography #landscapephotography

In some UK woodlands, every young tree has died. What’s going wrong? https://www.theguardian.com/environment/2025/jul/10/britain-ancient-woodlands-failing-regenerate-forests-climate-drought-heat-dis…

Driving in the rain

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
Salwa Faour, Fabian Kuhn
https://arxiv.org/abs/2506.10845 htt…

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
The maximum independent set problem is a classic optimization problem that has also been studied quite intensively in the distributed setting. While the problem is hard to approximate in general, there are good approximation algorithms known for several sparse graph families. In this paper, we consider deterministic distributed CONGEST algorithms for the weighted version of the problem in trees and graphs of bounded arboricity. For trees, we prove that the task of deterministically computing …

Sometimes I lose followers, sometimes I gain new ones, that’s just part of staying true to my beliefs in anarcho-syndicalism, Linux, Free Software, Bandcamp, and the other things that matter to me.
I’m the happiest when I connect with like minded people who share these values and engage with today’s struggles in ways that resonate with what I believe in.
https:…

I love that planting little patches full of flowers - also in public parks - has become a thing. #flowers

🇺🇦 #NowPlaying on KEXP's #MorningShow
Screaming Trees:
🎵 Troubled Times
#ScreamingTrees
https://open.spotify.com/track/1WwDFD23XjqAAtRTky5UwK

LLM-based Agents for Automated Confounder Discovery and Subgroup Analysis in Causal Inference
Po-Han Lee, Yu-Cheng Lin, Chan-Tung Ku, Chan Hsu, Pei-Cing Huang, Ping-Hsun Wu, Yihuang Kang
https://arxiv.org/abs/2508.07221

LLM-based Agents for Automated Confounder Discovery and Subgroup Analysis in Causal Inference
Estimating individualized treatment effects from observational data presents a persistent challenge due to unmeasured confounding and structural bias. Causal Machine Learning (causal ML) methods, such as causal trees and doubly robust estimators, provide tools for estimating conditional average treatment effects. These methods have limited effectiveness in complex real-world environments due to the presence of latent confounders or those described in unstructured formats. Moreover, reliance on …

I took this #photo when I thought that I'd be almost there. - Because I had mostly looked about the elevation. But as you might see on the photo, the way flattens a bit towards the summit.
Well, it was a great trail - it just took longer then I assumed.
Some more context and a video are on my blog:

OTESGN:Optimal Transport Enhanced Syntactic-Semantic Graph Networks for Aspect-Based Sentiment Analysis
Xinfeng Liao, Xuanqi Chen, Lianxi Wang, Jiahuan Yang, Zhuowei Chen, Ziying Rong
https://arxiv.org/abs/2509.08612

OTESGN:Optimal Transport Enhanced Syntactic-Semantic Graph Networks for Aspect-Based Sentiment Analysis
Aspect-based sentiment analysis (ABSA) aims to identify aspect terms and determine their sentiment polarity. While dependency trees combined with contextual semantics effectively identify aspect sentiment, existing methods relying on syntax trees and aspect-aware attention struggle to model complex semantic relationships. Their dependence on linear dot-product features fails to capture nonlinear associations, allowing noisy similarity from irrelevant words to obscure key opinion terms. Motivate…

Hazel Deriver: A Live Editor for Constructing Rule-Based Derivations
Zhiyao Zhong, Cyrus Omar
https://arxiv.org/abs/2506.10781 https://

Hazel Deriver: A Live Editor for Constructing Rule-Based Derivations
Students in programming languages and formal logic courses often struggle with constructing rule-based derivation trees due to the complexity of applying inference rules, the lack of immediate feedback, and the manual effort required for handwritten proofs. We present Hazel Deriver, a live, web-based editor designed to scaffold derivation construction through multiple layers of support. Built on the Hazel live programming environment, it provides a structured, interactive experience that encour…

Wrote a quick explainer of our new paper, led by Karolina Heyduk, showing that Joshua trees can use water-saving CAM photosynthesis, which should be mighty handy for a desert plant facing hotter summers and more stressful droughts
https://lab.jbyoder.org/2025/09/03…

Graph-based method for constructing consensus trees
Elio Torquet, Jesper Jansson, Nadia Tahiri
https://arxiv.org/abs/2508.08569 https://arxiv.org/pdf/2508.…

Graph-based method for constructing consensus trees
A consensus tree is a phylogenetic tree that synthesizes a given collection of phylogenetic trees, all of which share the same leaf labels but may have different topologies, typically obtained through bootstrapping. Our research focuses on creating a consensus tree from a collection of phylogenetic trees, each detailed with branch-length data. We integrate branch lengths into the consensus to encapsulate the progression rate of genetic mutations. However, traditional consensus trees, such as th…

Day 7 - an eye for an eye.
I changed course a bit. Seventy-five percent of the way to HillerŸd was through Nationalpark Kongernes Nordsjælland. Autumn colors, the smell of wet leaves and moss. Again, there was no soul on the path. I would say that I’m pretty much alone on the Danish roads, but in the forest, I was not. I saw something on my right side in the distance that didn’t make sense to me, but once I came to a stop, I found myself eye to eye with a small deer. It stood so still…

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
Kord Eickmeyer, Georg Schindling
https://arxiv.org/abs/2507.03465 https://

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
We study the notion of sparseness for regular languages over finite trees and infinite words. A language of trees is called sparse if the relative number of $n$-node trees in the language tends to zero, and a language of infinite words is called sparse if it has measure zero in the Bernoulli probability space. We show that sparseness is decidable for regular tree languages and for regular languages of infinite words. For trees, we provide characterisations in terms of forbidden subtrees and tre…

On The Road - To Xi’An/Human Intervention 🚶
在路上 - 去西安/人类遗迹 🚶
📷 Pentax MX
🎞️Lucky SHD 400
#filmphotography #Photography #blackandwhite

Cocompact unfolding trees
Roman Gorazd
https://arxiv.org/abs/2507.07503 https://arxiv.org/pdf/2507.07503

Cocompact unfolding trees
This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are almost isomorphic to cocompact trees. We will provide an algorithm that will determine this, thus mostly answering question (1) from arXiv:2212.07205.

Machines Learn Number Fields, But How? The Case of Galois Groups
Kyu-Hwan Lee, Seewoo Lee
https://arxiv.org/abs/2508.06670 https://arxiv.org/pdf/2508.06670…

Machines Learn Number Fields, But How? The Case of Galois Groups
By applying interpretable machine learning methods such as decision trees, we study how simple models can classify the Galois groups of Galois extensions over $\mathbb{Q}$ of degrees 4, 6, 8, 9, and 10, using Dedekind zeta coefficients. Our interpretation of the machine learning results allows us to understand how the distribution of zeta coefficients depends on the Galois group, and to prove new criteria for classifying the Galois groups of these extensions. Combined with previous results, thi…

"Young secondary forests may be the planet’s most overlooked carbon sink"
#Trees #Environment

Young secondary forests may be the planet’s most overlooked carbon sink
Founder’s Briefs: An occasional series where Mongabay founder Rhett Ayers Butler shares analysis, perspectives and story summaries. As governments and corporations scramble to meet climate pledges, the search for reliable and scalable carbon removal strategies has turned increasingly toward forests. But while tree planting captures the public imagination, a new study suggests a simpler, less […]

GS-BART: Bayesian Additive Regression Trees with Graph-split Decision Rules
Shuren He, Huiyan Sang, Quan Zhou
https://arxiv.org/abs/2509.07166 https://arxi…

GS-BART: Bayesian Additive Regression Trees with Graph-split Decision Rules
Ensemble decision tree methods such as XGBoost, Random Forest, and Bayesian Additive Regression Trees (BART) have gained enormous popularity in data science for their superior performance in machine learning regression and classification tasks. In this paper, we introduce a new Bayesian graph-split additive decision tree method, GS-BART, designed to enhance the performance of axis-parallel split-based BART for dependent data with graph structures. The proposed approach encodes input feature inf…

📉 Ancient trees are dying faster than expected in Eastern Oregon
#trees

Ancient trees are dying faster than expected in Eastern Oregon
Eastern Oregon's Malheur National Forest boasts some of the state's oldest trees, including pine and larch that live more than 500 years. But many of those ancient trees are dying at an alarming rate, a new analysis shows.

Multi-timescale Stochastic Programming with Applications in Power Systems
Yihang Zhang, Suvrajeet Sen
https://arxiv.org/abs/2508.08520 https://arxiv.org/pd…

Multi-timescale Stochastic Programming with Applications in Power Systems
This paper introduces a multi-timescale stochastic programming framework designed to address decision-making challenges in power systems, particularly those with high renewable energy penetration. The framework models interactions across different timescales using aggregated state variables to coordinate decisions. In addition to Multi-timescale uncertainty modeled via multihorizon trees, we also introduce a "synchronized state approximation," which periodically aligns states across timescales …

Just a taste of "Ritual Escape" - #Listen and #Watch -
or play the full playlist 👉🏼

Visual metrics on boundaries of hyperbolic spaces
Emily Stark
https://arxiv.org/abs/2506.10108 https://arxiv.org/pdf/2506.10108

Visual metrics on boundaries of hyperbolic spaces
This is an expository article on visual metrics on boundaries of hyperbolic metric spaces. We discuss the construction of visual metrics, quasisymmetries and their invariants, Hausdorff and conformal dimension, and constructions and applications of Gromov's round trees. There is a focus on providing examples throughout. These notes are based on the material of a minicourse given by the author at the 2024 Riverside Workshop in Geometric Group Theory.

Guided Reasoning in LLM-Driven Penetration Testing Using Structured Attack Trees
Katsuaki Nakano, Reza Feyyazi, Shanchieh Jay Yang, Michael Zuzak
https://arxiv.org/abs/2509.07939

Guided Reasoning in LLM-Driven Penetration Testing Using Structured Attack Trees
Recent advances in Large Language Models (LLMs) have driven interest in automating cybersecurity penetration testing workflows, offering the promise of faster and more consistent vulnerability assessment for enterprise systems. Existing LLM agents for penetration testing primarily rely on self-guided reasoning, which can produce inaccurate or hallucinated procedural steps. As a result, the LLM agent may undertake unproductive actions, such as exploiting unused software libraries or generating c…

Propagation Tree Is Not Deep: Adaptive Graph Contrastive Learning Approach for Rumor Detection
Chaoqun Cui, Caiyan Jia
https://arxiv.org/abs/2508.07201 https://

Propagation Tree Is Not Deep: Adaptive Graph Contrastive Learning Approach for Rumor Detection
Rumor detection on social media has become increasingly important. Most existing graph-based models presume rumor propagation trees (RPTs) have deep structures and learn sequential stance features along branches. However, through statistical analysis on real-world datasets, we find RPTs exhibit wide structures, with most nodes being shallow 1-level replies. To focus learning on intensive substructures, we propose Rumor Adaptive Graph Contrastive Learning (RAGCL) method with adaptive view augmen…

Observables of random spanning trees in random environment
Luca Makowiec
https://arxiv.org/abs/2507.07702 https://arxiv.org/pdf/2507.…

Observables of random spanning trees in random environment
In this thesis, we study a new disordered system called random spanning tree in random environment (RSTRE) across different families of graphs with varying disorder distributions. We examine several observables as functions of the disorder strength (inverse temperature) $β\geq 0$, and compare their values to the extreme cases $β= 0$ and $β\rightarrow \infty$, which correspond to the uniform spanning tree (UST) and the minimum spanning tree (MST), respectively. The results concerning the diam…

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- A Random Walk Approach to Broadcasting on Random Recursive Trees
Ernst Althaus, Lisa Hartung, Rebecca Steiner

🇺🇦 #NowPlaying on KEXP's #MorningShow
Screaming Trees:
🎵 Shadow of the Season
#ScreamingTrees
https://open.spotify.com/track/0donjzZGsCA2PfPUA4EdMN

Some runs are trials of endurance. Tonight was less about physical or mental factors and more about overcoming environmental ones. Not really hot tonight (75°F/23.9°C) but the relative humidity was 93.5%. My point is I’m a sweaty mess and cooler seasons cannot get here soon enough.
Adding to my suffering, some animal died near one end of the track. Didn’t notice until I was underway. Every lap was an agony of decomposition. I reckon 1/3 of this run was with held breath. 🤢

Trees as Gaussians: Large-Scale Individual Tree Mapping
Dimitri Gominski, Martin Brandt, Xiaoye Tong, Siyu Liu, Maurice Mugabowindekwe, Sizhuo Li, Florian Reiner, Andrew Davies, Rasmus Fensholt
https://arxiv.org/abs/2508.21437

Trees as Gaussians: Large-Scale Individual Tree Mapping
Trees are key components of the terrestrial biosphere, playing vital roles in ecosystem function, climate regulation, and the bioeconomy. However, large-scale monitoring of individual trees remains limited by inadequate modelling. Available global products have focused on binary tree cover or canopy height, which do not explicitely identify trees at individual level. In this study, we present a deep learning approach for detecting large individual trees in 3-m resolution PlanetScope imagery at …

escape to a frothing seaside of the mind with last night's frow show on @…. https://wfmu.org/playlists/JJ/250708

Formulas and asymptotics of hypergraph Catalan numbers
Eva-Maria Hainzl
https://arxiv.org/abs/2508.08865 https://arxiv.org/pdf/2508.08865

Formulas and asymptotics of hypergraph Catalan numbers
Tree walks are a class of closed walks on a complete graph constrained to span trees. In this work, we focus on a special subclass called $k$-tours, which were recently introduced by Gunnells and are enumerated by the hypergraph Catalan numbers $ c_n^{(k)}$. Gunnells conjectured an asymptotic formula for $c_n^{(k)}$ which we confirm through an alternative approach to their enumeration. As it turns out, the asymptotic growth is governed by the number of $k$-tours on star-like trees.

Intrinsic Bottleneck Distance for Merge Trees
David Beers, Gillian Grindstaff
https://arxiv.org/abs/2509.02755 https://arxiv.org/pdf/2509.02755

Intrinsic Bottleneck Distance for Merge Trees
Merge trees are a topological descriptor of a filtered space that enriches the degree zero barcode with its merge structure. The space of merge trees comes equipped with an interleaving distance $d_I$, which prompts a naive question: is the interleaving distance between two merge trees equal to the bottleneck distance between their corresponding barcodes? As the map from merge trees to barcodes is not injective, the answer as posed is no, but (as conjectured in Gasparovic et al.) we prove that …

Interior of distance trees over thin Cantor sets
Yeonwook Jung, Krystal Taylor
https://arxiv.org/abs/2507.07385 https://arxiv.org/pdf…

Interior of distance trees over thin Cantor sets
It is known that if a compact set $E$ in $\mathbb{R}^d$ has Hausdorff dimension greater than $(d+1)/2$, then its $n$-chain distance set $$Δ^n(E) = \left\{\left(\left|x^1-x^2\right|,\cdots, \left|x^{n}- x^{n+1}\right|\right)\in \mathbb{R}^n: x^i \in E, x^i\neq x^j \text{ for } i\neq j \right\}$$ has nonempty interior for any $n\in \mathbb{N}$. In this paper, we prove that for every Cantor set $K\subset \mathbb{R}^d$ and for every $n\in\mathbb{N}$, there exists $\widetilde{K}…

here’s what look to be newish sidewalk trees, 2 of them, on Capp in front of Alioto Park.
I have mixed feelings. Capp’s sidewalks are a miserly 9’ while the roadway is much too wide. Now when SF widens the sidewalk, these trees will be obstructions in the middle of it. We need to legalize planting trees in the parking lane

Bayesian Additive Regression Trees for functional ANOVA model
Seokhun Park, Insung Kong, Yongdai Kim
https://arxiv.org/abs/2509.03317 https://arxiv.org/pdf…

Bayesian Additive Regression Trees for functional ANOVA model
Bayesian Additive Regression Trees (BART) is a powerful statistical model that leverages the strengths of Bayesian inference and regression trees. It has received significant attention for capturing complex non-linear relationships and interactions among predictors. However, the accuracy of BART often comes at the cost of interpretability. To address this limitation, we propose ANOVA Bayesian Additive Regression Trees (ANOVA-BART), a novel extension of BART based on the functional ANOVA decompo…

Careful out there folks. It's wimdy!
via @…
https://mastodon.social/@Ighostrider/115169747100218045…

Ighostrider (@Ighostrider@mastodon.social)
Attached: 1 image @XLCChelt@mastodonapp.uk a bit like when we had a wee light breeze tickling the trees ...

A Generic Complete Anytime Beam Search for Optimal Decision Tree
Harold Silv\`ere Kiossou, Siegfried Nijssen, Pierre Schaus
https://arxiv.org/abs/2508.06064 https://

A Generic Complete Anytime Beam Search for Optimal Decision Tree
Finding an optimal decision tree that minimizes classification error is known to be NP-hard. While exact algorithms based on MILP, CP, SAT, or dynamic programming guarantee optimality, they often suffer from poor anytime behavior -- meaning they struggle to find high-quality decision trees quickly when the search is stopped before completion -- due to unbalanced search space exploration. To address this, several anytime extensions of exact methods have been proposed, such as LDS-DL8.5, Top-k-DL…

Forest before trees? It depends on not only what you see, but also what you hear https://www.sciencedirect.com/science/article/abs/pii/S0010028525000520

Seit 1985 sind im #Amazonas #Wälder in der Größe Spaniens verschwunden.
Laut einer Studie verstärkt die #Abholzung

Some tropical trees cool their leaves to survive the heat — but not all species have ways to cope
In full sun, tropical leaves can become much hotter than the surrounding air. Their ability to cope can be a matter of life or death.

7AM, out and about on a stunning rainy morning walk between layers of fog and clouds... absolute silence...
#MorningWalk #LandscapePhotography #NaturePhotography

🌳 Novel research reveals thriving microbial life in trees
#trees

Novel research reveals thriving microbial life in trees
There's a thriving community of diverse microbes living in tree wood, a new study led by a Yale School of the Environment team of scientists has found. A single tree hosts about one trillion bacteria in its woody tissue.

"This Home Siding Made from Rice Husks Saves Thousands of Trees and Diverts Crop Waste from Landfills"
#Houses
https://www.goodnewsne…

This Home Siding Made from Rice Husks Saves Thousands of Trees, Diverts Ag Waste from Landfills
One pallet of ACRE material saves a whole acre of tropical rainforest hardwoods, and in 2022 alone, 44,000 of those pallets were sold.

Urban Solitude V 🈳
城市孤独 V 🈳
📷 Pentax MX
🎞️Fujifilm Neopan SS, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Iwasawa theory for branched $\mathbb{Z}_{p}$-towers of finite graphs and Ihara zeta and $L$-functions
Rusiru Gambheera, Daniel Valli\`eres
https://arxiv.org/abs/2508.07373 https…

Iwasawa theory for branched $\mathbb{Z}_{p}$-towers of finite graphs and Ihara zeta and $L$-functions
We revisit the theory of Ihara $L$-functions in the context initially studied by Bass and Hashimoto and more recently by Zakharov. In particular, we study if the Artin formalism is satisfied by these $L$-functions. As an application, we give a proof of the analogue of Iwasawa's asymptotic class number formula for the $p$-part of the number of spanning trees in branched $\mathbb{Z}_{p}$-towers of finite connected graphs using Ihara zeta and $L$-functions. Moreover, we relate a generator for the …

Treemble: A Graphical Tool to Generate Newick Strings from Phylogenetic Tree Images
John B. Allard, Sudhir Kumar
https://arxiv.org/abs/2508.07081 https://a…

Treemble: A Graphical Tool to Generate Newick Strings from Phylogenetic Tree Images
Phylogenetic trees are ubiquitous and central to biology, but most published trees are available only as visual diagrams and not in the machine-readable newick format. There are thus thousands of published trees in the scientific literature that are unavailable for follow-up analyses, comparisons, supertree construction, etc. Experts can easily read such diagrams, but the manual construction of a newick string is prohibitively laborious. Previous attempts to semi-automate the reading of tree im…

I got in a nice 7km run tonight, feeling better after having had a cold. Did the first 30 min or so in HR zone 2, then got irritated with the pace and decided to go a little faster for the last half hour. That might be the plan going forward. I believe in the expanded fitness levels that zone 2 builds, but it suuuucks!
Dedicating this run to my friend @…, wishing hi…

For the Ithaca 5 and 10 this Sunday I staked out E Fall Street near Ithaca Falls and where the Cinemapolis movie theater used to be
#photo #photography #running

Anatomy of a Machine Learning Ecosystem: 2 Million Models on Hugging Face
Benjamin Laufer, Hamidah Oderinwale, Jon Kleinberg
https://arxiv.org/abs/2508.06811 https://

Anatomy of a Machine Learning Ecosystem: 2 Million Models on Hugging Face
Many have observed that the development and deployment of generative machine learning (ML) and artificial intelligence (AI) models follow a distinctive pattern in which pre-trained models are adapted and fine-tuned for specific downstream tasks. However, there is limited empirical work that examines the structure of these interactions. This paper analyzes 1.86 million models on Hugging Face, a leading peer production platform for model development. Our study of model family trees -- networks th…

Ramsey numbers of trees
Richard Montgomery, Mat\'ias Pavez-Sign\'e, Jun Yan
https://arxiv.org/abs/2509.07934 https://arxiv.org/pdf/2509.07934

Ramsey numbers of trees
We show that there exists a constant $c>0$ such that every $n$-vertex tree $T$ with $Δ(T)\le cn$ has Ramsey number $R(T)=\max\{t_1+2t_2,2t_1\}-1$, where $t_1\ge t_2$ are the sizes of the bipartition classes of $T$. This improves an asymptotic result of Haxell, Łuczak, and Tingley from 2002, and shows that, though Burr's 1974 conjecture on the Ramsey numbers of trees has long been known to be false for certain `double stars', it is true for trees with up to small linear maximum degree.

Replaced article(s) found for math.PR. https://arxiv.org/list/math.PR/new
[1/1]:
- A Random Walk Approach to Broadcasting on Random Recursive Trees
Ernst Althaus, Lisa Hartung, Rebecca Steiner

Too little sleep, too hot, stagnant air with no breeze, and definitely rudely humid. When it became clear what a struggle this would be, I opted to run for HR zones instead. This included several walking breaks to bring my HR back down. My fitness needs the work.
#Running

Woman runner makes a heart sign with her hands as she passes me in Ithaca's Fall Creek neighborhoods
#photo #photography #running

✅ Mini hike & hike to our local hill.
Now on the couch, reading.
#isartal #lenggries #bayern #badtoelz

Lazy B-Trees
Casper Moldrup Rysgaard, Sebastian Wild
https://arxiv.org/abs/2507.00277 https://arxiv.org/pdf/2507.00277

Lazy B-Trees
Lazy search trees (Sandlund & Wild FOCS 2020, Sandlund & Zhang SODA 2022) are sorted dictionaries whose update and query performance smoothly interpolates between that of efficient priority queues and binary search trees - automatically, depending on actual use; no adjustments are necessary to the data structure to realize the cost savings. In this paper, we design lazy B-trees, a variant of lazy search trees suitable for external memory that generalizes the speedup of B-trees over binary searc…

"Trees alone won’t save us: new study says forestation has less potential to fix the climate than hoped"
#Trees #Environment #Climate

Trees alone won’t save us: new study says forestation has less potential to fix the climate than hoped
Governments have pledged vast areas for new forests, but much of this land may be unsuitable.

On The Road - To Xi’An/ Urban Setting 🤳
在路上 - 去西安/ 城市设置 🤳
📷 Pentax MX
🎞️Lucky SHD 400
#filmphotography #Photography #blackandwhite

I went to Stewart Park this Sunday after the Ithaca 5 and 10 to make a 3-d scan of the lighthouse on the jetty which didn't work out but I did see these kayakers goings under this bridge.
#photo #photography #ithaca

🇺🇦 #NowPlaying on KEXP's #MorningShow
Screaming Trees:
🎵 Butterfly
#ScreamingTrees
https://open.spotify.com/track/6LWRZQ6FiVdjWP04jDQL42

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
Jiancheng Wu, Sizhong Zhou
https://arxiv.org/abs/2507.07301 https://

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
The binding number of a graph $G$, written as $\mbox{bind}(G)$, is defined by $$ \mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}. $$ A graph $G$ is called $r$-binding if $\mbox{bind}(G)\geq r$. An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $F$ with $d_F(v)\in\{1,3,\ldots,b\}$ for all $v\in V(G)$, where $b\geq1$ is an odd integer. A spanning $k$-tree of a connected graph $G$ is a spanning tree $T$ with $d_T(v)…

"‘New hope’: ash trees rapidly evolving resistance to dieback, study reveals"
#UK #UnitedKingdom #Trees

The space of multifurcating ranked tree shapes: enumeration, lattice structure, and Markov chains
Julie Zhang, Noah A. Rosenberg, Julia A. Palacios
https://arxiv.org/abs/2506.10856

The space of multifurcating ranked tree shapes: enumeration, lattice structure, and Markov chains
Coalescent models of bifurcating genealogies are used to infer evolutionary parameters from molecular data. However, there are many situations where bifurcating genealogies do not accurately reflect the true underlying ancestral history of samples, and a multifurcating genealogy is required. The space of multifurcating genealogical trees, where nodes can have more than two descendants, is largely underexplored in the setting of coalescent inference. In this paper, we examine the space of rooted…

City Features 🌆
城市特征 🌆
📷 Pentax MX
🎞️Ilford FP4 Plus, expired 1994
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Something organic for #AbstractAug -- tree bark spotted on last week's walkabout in Collegetown
#photo #photography

A generalization of an ear decomposition and k-trees in highly connected star-free graphs
Shun-ichi Maezawa, Kenta Ozeki, Masaki Yamamoto, Takamasa Yashima
https://arxiv.org/abs/2508.05962

A generalization of an ear decomposition and k-trees in highly connected star-free graphs
In this paper, we introduce a generalized version of an ear decomposition, called a $j$-spider decomposition, for $j$-connected star-free graphs with $j \geq 2$. Its application enables us to improve a previousely known sufficient condition for the existence of a $k$-tree in highly connected star-free graphs, where a $k$-tree is a spanning tree in which every vertex is of degree at most $k$. More precisely, we show that every $j$-connected $K_{1,j(k-2)+2}$-free graph has a $k$-tree for $k\ge j$…

Evasive sets, twisted varieties, and container-clique trees
Jeck Lim, Jiaxi Nie, Ji Zeng
https://arxiv.org/abs/2507.07594 https://arx…

Evasive sets, twisted varieties, and container-clique trees
In the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than $r$. As $q$ tends to infinity, the size of a $(d,k,r)$-evasive set in $\mathbb{F}_q^n$ is at most $O\left(q^{n-k}\right)$ by a simple averaging argument. We exhibit the existence of such evasive sets of sizes at least $Ω\left(q^{n-k}\right)$ for much smaller va…

"Bangladesh to save critically endangered orchids and trees"
#Bangladesh #Trees #Plants #Environment

Bangladesh to save critically endangered orchids and trees
Bangladesh has initiated efforts to revive five species of plants currently listed as critically endangered on the country’s red list, as well as bring back two species declared locally extinct, reports Mongabay’s Abu Siddique. The critically endangered plants include two species of orchids: bulborox or the Sikkim bulb-leaf orchid (Bulbophyllum roxburghii), and the small-bulb orchid […]

City Snaps - Chengdu / A Rain in Park ☔️
城市抓拍 - 成都 / 雨中的公园 ☔️
📷 Nikon FE
🎞️Ilford Pan 400
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Commuting day today. Walking to the train station.
#goodmorning #tgif

"City Lights Extend Growing Season for Urban Trees"
#Trees #LightPollution
https://e360…

City Lights Extend Growing Season for Urban Trees

Unbounded degree spanning hypertrees in Dirac hypergraphs
Yaobin Chen, Seonghyuk Im, Junchi Zhang
https://arxiv.org/abs/2508.06843 https://arxiv.org/pdf/25…

Unbounded degree spanning hypertrees in Dirac hypergraphs
In 2001, Komlós, Sárközy, and Szemerédi proved that every sufficiently large $n$-vertex graph with minimum degree at least $\left(1/2+γ\right)n$ contains all spanning trees with maximum degree at most $cn/\log n$. We extend this result to hypergraphs by considering loose hypertrees, which are linear hypergraphs obtained by successively adding edges that share exactly one vertex with a previous edge. For all $k > \ell \geq 2$, we determine asymptotically optimal $\ell$-degree conditions t…

🌲 A Sequoia Forest Grows in Detroit
#detroit

A Sequoia Forest Grows in Detroit
Using the DNA of the world’s mightiest trees, a tree grower in Michigan aims to replenish old-growth forests, one sapling at a time.

The wild number of an edge-colored graph
Katie Anders, Briana Foster-Greenwood, Rebecca Garcia, Naomi Krawzik
https://arxiv.org/abs/2508.06711 https://arxi…

The wild number of an edge-colored graph
We introduce the wild number of an edge-colored graph as a measure of how close an edge-colored graph is to having a spanning tree in every color. This combinatorial concept originates in the algebraic theory of generalized graph splines. After showing that determining the wild number of a graph is an NP-complete problem, we provide bounds on the wild number and find the exact wild number for trees, cycles, and families of graphs with restrictions on the edge-colorings. This article serves as a…

This was one of the WOW moments during my hike recently. Until then i was walking through the woods. But this meadow greeted me with sunshine, flowers and the trail leading through it.
I took off my rucksack and tried to capture my first some photos.
The blog with more potos and a video: https://www.

"The climate case for planting trees has been overhyped — but it’s not too late to fix it"
#Trees #Climate #ClimateChange

The climate case for planting trees has been overhyped — but it’s not too late to fix it
Reforestation can contribute significantly to tackling climate change, but research found its global potential is only a fraction of what’s been claimed.

I think I've almost got #fireflies figured out -- here's a #workinprogress; I gotta go back with my $2 tripod since my Manofrotto is still in pieces since that time I was using it with the ring flash in the studio and it exploded in a fit of paranoia; I think Lenny just cut the ha…

Just sharing this reminder of a really glorious day in the #mountains .
I spent quite a bit of time to find exactly THIS spot so that fore and midground blended so well together.
And currently I'm having this as a background image in teams. Sometimes I wonder if this might look unprofessional - and then I think "maybe I don't care".

"The beauty industry loves argan oil but Morocco’s trees are under pressure from drought and demand"
#Morocco #Trees #Environment

The world loves argan oil but Morocco’s trees are paying the price
The hidden cost of argan oil's beauty boom is drought, deforestation and disappearing traditions.

On The Road - To Xi’An ⛑️
在路上 - 去西安 ⛑️
📷 Pentax MX
🎞️Lucky SHD 400
#filmphotography #Photography #blackandwhite

😶‍🌫️ Generating real-time detailed ground visualisations from sparse aerial point clouds
#3d #xr

Generating real-time detailed ground visualisations from sparse aerial point clouds
Building realistic wide scale outdoor 3D content with sufficient visual quality to observe at walking eye level or from driven vehicles is often carried out by large teams of artists skilled in modelling, texturing, material shading and lighting, which typically leads to both prohibitive costs and reduced accuracy honoring the variety of real world ground truth landscapes. In our proposed method, we define a process to automatically amplify real-world scanned data and render real-time in animat…

While I'm copying yesterday's photos to my computer, I'll just share some more photos from my recent blog post.
I tried to put the bushes at the lake as framing elements into the #photos. I think it worked out quite okay. -- And while we were on this walk I imagined all the time where and how this could look at sunset or with fog.
Maybe I should go there a again a couple o…

"Nepal sees positive outcome from reforestation project using local knowledge"
#Nepal #Trees #nature #Environment

Nepal sees positive outcome from reforestation project using local knowledge
KATHMANDU — A decade ago, people from Salija village in western Nepal traveled several hours into the uphill forests to gather firewood and feed for their livestock, Shakhamani Khorja recalls. “[Now], we have a forest growing on about 13 hectares [32 acres] of land less than a kilometer [0.6 miles] away that helps meet our […]

On The Road - To Xi’An 🌫️
在路上 - 去西安 🌫️
📷 Pentax MX
🎞️Lucky SHD 400
#filmphotography #Photography #blackandwhite

When Many Trees Go to War
Mathias Weller, Norbert Zeh
https://arxiv.org/abs/2508.21749 https://arxiv.org/pdf/2508.21749

When Many Trees Go to War
It is known that any two trees on the same $n$ leaves can be displayed by a network with $n-2$ reticulations, and there are two trees that cannot be displayed by a network with fewer reticulations. But how many reticulations are needed to display multiple trees? For any set of $t$ trees on $n$ leaves, there is a trivial network with $(t - 1)n$ reticulations that displays them. To do better, we have to exploit common structure of the trees to embed non-trivial subtrees of different trees into th…

About 400 runners off the start at Ithaca High school this Sunday for the Ithaca 5 & 10 -- a rare photo I didn't color grade because I'm paying close attention to how the trees have gotten darker in the past two weeks because they're already starting to turn
#photo #photography

A 15 second exposure of my field around sunset with the camera resting on a bucket trying to capture the fireflies. I'm going to try again when its darker; I guess it counts as #sliceoflife
#photo #photography

A view of the crowd after the Ithaca 5 and 10 in front of Ithaca High School... more photos that Kilian Weinberger, myself and maybe some others took here: #photo