Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking 6Z1DDCYCQ8

URI	`m2://res/6Z1DDCYCQ8`
Kind	preprint
Creators	Julian Voits
Date	2026-10-09
Subjects	arxiv cond-mat.stat-mech, arxiv math.PR
Scope	out

Expressions

Date	2026-10-09
Ids	arXiv 2610.13505

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
1C4ZHFH9M4	statement	lemma 14	arxiv
1W745G61QT	definition	definition A.1	arxiv
1Z1BNP6N1E	definition	definition 18	arxiv
Karamata	statement	theorem A.4	arxiv
3T3S0T1PK8	example	example Example	arxiv
42QT303SQS	statement	proposition 3	arxiv
4HCXCBMP2C	statement	lemma A.2	arxiv
53H7PZVCS7	definition	definition 1	arxiv
5P5F54S8AA	statement	proposition 22	arxiv
63TWYWBABH	statement	lemma 23	arxiv
7V6GG0J7HB	statement	theorem 10	arxiv
AQX2G99J8T	definition	definition 12	arxiv
CM658DH8YY	statement	theorem 6	arxiv
CMZTXV2S9P	statement	proposition 7	arxiv
CXVG89Z4CG	definition	definition 21	arxiv
D2QDDE6QRC	statement	theorem 8	arxiv
F6H1JK3M5W	definition	definition 5	arxiv
G4T6FNW4BT	statement	lemma 2	arxiv
GXJXX1VEQG	statement	lemma A.3	arxiv
PKZ0NJ3YY3	statement	theorem 24	arxiv
QDB31VWZZQ	statement	proposition 19	arxiv
R2RW1H7G9X	statement	theorem 17	arxiv
RHVMER8PHP	statement	proposition 13	arxiv
TJFETKRKD7	statement	theorem 15	arxiv
X4M6N7CNN8	statement	proposition 20	arxiv
YJXFPQ1P6Z	statement	corollary 11	arxiv
YM2A0BF2YS	definition	definition 4	arxiv
Kemeny's constant for semi-Markov networks	statement	proposition 16	arxiv