Results 41 to 47 of about 241 (47)
Adjusted Kolmogorov Complexity of Binary Words with Empirical Entropy Normalization. [PDF]
Vidakovic B.
europepmc +1 more source
Para-Markov chains and related non-local equations. [PDF]
Facciaroni L +3 more
europepmc +1 more source
Exchangeable coalescents beyond the Cannings class. [PDF]
Siri-Jégousse A, Wences AH.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
, 2012
We show that linearly reinforced random walk has a recurrent phase in every graph. The proof does not use the magic formula. 2010 Mathematics Subject Classification. Primary 60K35; Secondary 60K37, 60G09, 60J10.
G. Kozma
semanticscholar +1 more source
We show that linearly reinforced random walk has a recurrent phase in every graph. The proof does not use the magic formula. 2010 Mathematics Subject Classification. Primary 60K35; Secondary 60K37, 60G09, 60J10.
G. Kozma
semanticscholar +1 more source

