#MarkovChains

Hacker Newsh4ckernews
2025-05-27

Rock, Paper, Scissors that learns how you play using markov chains

luduxia.com/showdown/

2025-02-24

An idea: stupid #MarkovChains model trained on #Lisp code. Lisp code is structured so well that one can easily derive patterns from it even for an #AI as stupid and deranged as Markov Chains.

Just need to figure out what mental model to build out of Lisp AST.

#theWorkshop

Tero Keski-Valkamatero@rukii.net
2025-02-12

Teaching ChatGPT-4o is a great way to learn.

It's always nice to notice you know something ChatGPT doesn't know, as it typically means you know something most specialists in the field don't know:
chatgpt.com/share/67ac8053-bcf

#LLM #mathematics #MarkovChains #MDPs

2025-02-06

😍#call4reading

✍️Homogeneous open #quantumwalks on the line: criteria for site #recurrence and absorption #by Thomas S. Jacq and Carlos F. Lardizabal

🔗 doi.org/10.26421/QIC21.1-2-3

#quantumwalks #Markovchains

2024-12-06

🙌#call4reading

✍️Quantum #ApproximateCounting for #MarkovChains and Application to #Collision Counting #by Francois Le Gall and Iu-Iong Ng

🔗10.26421/QIC22.15-16-1 (#arXiv:2204.02552v2)

#quantumalgorithm

2024-10-26

Two New Publications at the Open Journal of Astrophysics

It’s Saturday morning again so here’s another report on activity at the  Open Journal of Astrophysics.  Since the last update we have published two more papers, taking  the count in Volume 7 (2024) up to 95 and the total published by OJAp up to 210.  We’ve still got a few in the pipeline waiting for the final versions to appear on arXiv so I expect we’ll reach the 100 mark for 2024 in the next couple of weeks.

The first paper of the most recent pair, published on October 22 2024,  and in the folder marked Astrophysics of Galaxies, is “Cloud Collision Signatures in the Central Molecular Zone”  by Rees A. Barnes and Felix D. Priestley (Cardiff University, UK) .  This paper presents an analysis of combined hydrodynamical, chemical and radiative transfer simulations of cloud collisions in the Galactic disk and Central Molecular Zone (CMZ).

Here is a screen grab of the overlay which includes the abstract:

 

 

You can click on the image of the overlay to make it larger should you wish to do so.  You can find the officially accepted version of this paper on the arXiv here.

The second paper has the title “Partition function approach to non-Gaussian likelihoods: macrocanonical partitions and replicating Markov-chains” and was published October 25th 2024. The authors are Maximilian Philipp Herzog, Heinrich von Campe, Rebecca Maria Kuntz, Lennart Röver and Björn Malte Schäfe (all of Heidelberg University, Germany). This paper, which is in  the folder marked Cosmology and NonGalactic Astrophysics, describes a method of macrocanonical sampling for Bayesian statistical inference, based on the macrocanonical partition function, with applications to cosmology.

Here is a screen grab of the overlay which includes the abstract:

 

You can click on the image of the overlay to make it larger should you wish to do so. You can find the officially accepted version of the paper on the arXiv here.

That concludes this week’s update. More  next week!

#arXiv231116218v3 #arXiv240721575v2 #AstrophysicsOfGalaxies #BayesianInference #CosmologyAndNonGalacticAstrophysics #likelihoods #MarkovChains #MolecularCouds #PartitionFunction #starFormation #thermodynamics

A Terracotta Pot, a Jar, And Plenty of Room (2024/04/19)

see.ellipsenpark.de/videos/wat

2024-04-16

A drunk man will find his way home, but a drunk bird may get lost forever.” What is this sentence about?

In 2D, the random walk is “recurrent”, i.e. you are guaranteed to go back to where you started; but in 3D, the random walk is “transient”, the opposite of “recurrent”. In fact, for the 2D case, that also means that you are guaranteed to go to ALL places in the world (the only constraint is, of course, time). [Think about why.]

Markov chains are also an important tool in modelling the real world, and so I feel like this is a good excuse for bringing it up.

At the end, I also compare this phenomenon to Stein’s paradox – in both cases, there is a cutoff between 2 and 3 dimensions, and they have similar intuitive explanation – is that a coincidence?

Random walks in 2D and 3D are fundamentally different

#MarkovChain #MarkovChains #Math #Mathematics #nowWatching #randomWalk #randomness #StochasticProcess #YouTube

2024-01-30

So the results are fun to browse, but sometimes a bit too nonsensical.

Anyone experienced with #MarkovChains able to share any tips on how to make the output better?

#CreativeCoding #GenerativeText

2023-10-27
2023-04-15

Using #Bing Chat #AI to write an #anthropomorphic #story about #MarkovChains is fun:

Once upon a time, in a land of numbers and probabilities, there was a Markov chain. This Markov chain was like any other, transitioning from one state to another based on the probabilities defined in its transition matrix. But one day, something strange happened. The Markov chain began to behave in a way that seemed almost... human.

2023-01-08

Missives from the Mystical Mundane
Ghost-writer: this is meant to mimic channeled writing on the computer. Still trying to sort out what source it pulls from and method of input for determining what to pick from the source. I could do random numbers, but that feels cheap. I’m thinking of initial word pick then doing markov chains off that word
#aiccult #markovchains #textgeneration

This candle is the occult version of a double negative.
2022-12-14

Data-driven memory-dependent abstractions of dynamical systems

by Adrien Banse, Licio Romao, Alessandro Abate, Raphaël M. Jungers
arXiv:2212.01926. arxiv.org/pdf/2212.01926.pdf

#dynamicalSystems #memory #abstraction #markovChains #sampling #finiteAbstractions #ergodicity #dynamicalModels

Abstract

We propose a sample-based, sequential method to abstract a (potentially black-box) dynamical system with a sequence of memory-dependent Markov chains of increasing size. We show that this approximation allows to alleviating a correlation bias that has been observed in sample-based abstractions. We further propose a methodology to detect on the fly the memory length resulting in an abstraction with sufficient accuracy. We prove that under reasonable assumptions, the method converges to a sound abstraction in some precise sense, and we showcase it on two case studies. Keywords: dynamical models, switched systems, finite abstractions, memory, ergodicity, observability.
2017-06-26

Happy to say I'm going to finally pass my math class... only took 3 attempts. As long as I get 7/30 on my final on Wednesday I'm good! #math #linearalgebra #markovchains #fuckthis

Client Info

Server: https://mastodon.social
Version: 2025.04
Repository: https://github.com/cyevgeniy/lmst