Do you #Crochet by chance? Have you ever tried #MosaicCrochet ? #BuildMeABear .Biz LLC has some wonderful #Handmade #Digital #Instant #Download #PDF #Patterns available! They come with both large and small #Graphs as well as the full Standard US #WrittenPattern included! All BuildMeABear.LLC products are 100% #MadeInTheUSA by a #Navy #Veteran !

Stop in and see what’s in the shoppers !

#Shop my #Etsy store for these patterns and more here!

https://buildmeabearbizllc.etsy.com/

First plague, then war.

“Regardless of which measure you consult, the past year has seen a sharp increase in global #spending on #defence. Budgets totalled $2.7trn in 2024—up by 9.4% from 2023, the biggest jump since at least 1988.

#Military outlays now account for 2.5% of countries’ gdp on average, and 7.1% of government budgets. But the increase is even steeper when adjusted for purchasing power (see chart 1). With help from #PeterRobertson of the #UniversityofWesternAustralia, we estimate that global #defence #spending rose by 10% in real terms.”

What got me to read the article? The notation, “$bn, log scale” graph. #Graphs shown in log #scale.

Meaning the economist pitch to readership is high in statistical education OR it’s from an Academic source.

<https://archive.md/I8SBL> / <https://www.economist.com/graphic-detail/2025/05/16/how-do-countries-rank-by-military-spending> (paywall)

About a month ago, I was nerdsniped by @joachim, and I set foot on an adventure inside of Wikidata, data processing, visualization, and more. Read on https://anisse.astier.eu/wikidata-communes-viewer.html

Came up at work but definitely a question of general interest:

I feel like when looking at a line-by-line diff of an XML file, it's just... really not super clear, even with highlighting and such. Is there any sort of graph-aware diff tool that might generate a visual graph and show the difference that way? So that rather than reviewing line by line, you can say "ah, a node has moved from being a child of this node to another", or "these two nodes have been merged into one".

I feel like it would be possible to gin something up in like, networkX or something, but if there's prior art...

#techPosting #XML #computerScienceTrees #graphs #diffs

Is there a way to graph trending hashtags on mastodon/the Fediverse?

What I'm interested in is to graph say my local city of #Adelaide and use that as a bit of an indicator of if #Mastodon usage and engagemement is growing locally in my town

And yes im interested in data across the fediverse or at least across a few selected servers, as I want data beyond just a single instance.

I can see this on my desktop web interface right now.. so Im guessing there *should* be a way.

See if you can work out the number of mistakes in this graph and let us know. Anyone that gets it right will be awarded special internet points. #DataVis #Data #Graphs

Is there a term for a graph that changes shape as it is traversed? (You could say that an edge is or isn't enabled depending on which edge was used to enter the node)

These Maps are Lying
vlogbrothers

"Vote Swing maps"

The 2020 to 2024 percentage difference between the spread between Republicans and Democrats, for every county in America.

https://www.youtube.com/watch?v=kC9u7NZbGlQ

A short story about my decomposition into weight × level + jump. It's a new fundamental theorem of arithmetic and academia is 11 years late.

Perhaps the only way in which I'm average.

A new focus on tidygraph https://www.data-imaginist.com/2023/a-new-focus-on-tidygraph/ #rstats #netsci #graphs #dataviz #bioinformatics

#decompwlj It's a decomposition of positive integers. The weight is the smallest such that in the Euclidean division of a number by its weight, the remainder is the jump (first difference, gap). The quotient will be the level. So to decompose a(n), we need a(n+1) with a(n+1)>a(n) (strictly increasing sequence), the decomposition is possible if a(n+1)<3/2×a(n) and we have the unique decomposition a(n) = weight × level + jump.

We see the fundamental theorem of arithmetic and the sieve of Eratosthenes in the decomposition into weight × level + jump of natural numbers. For natural numbers, the weight is the smallest prime factor of (n-1) and the level is the largest proper divisor of (n-1). Natural numbers classified by level are the (primes + 1) and natural numbers classified by weight are the (composites +1).

For prime numbers, this decomposition led to a new classification of primes. Primes classified by weight follow Legendre conjecture and i conjecture that primes classified by level rarefy. I think this conjecture is very important for the distribution of primes.

It's easy to see and prove that lesser of twin primes (>3) have a weight of 3. So the twin primes conjecture can be rewritten: there are infinitely many primes that have a weight of 3.

I am not mathematician so i decompose sequences to promote my vision of numbers. By doing these decompositions, i apply a kind of sieve on each sequences.

https://oeis.org/wiki/Decomposition_into_weight_*_level_%2B_jump

Just launched: a new diamond open access journal in graph theory!

https://igt.centre-mersenne.org/

published by @Centre_Mersenne

poster: https://staff.fnwi.uva.nl/j.r.kang/posterIGT.pdf

A few complete graphs #generative #geometry #graphs #mastoart #MathsArt