Ranking graphs through hitting times of Markov chains

DOI10.1002/rsa.20998zbMath1523.60125OpenAlexW3127463243MaRDI QIDQ6074655

Emilio De Santis

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11573/1604482

zbMATH Keywords

ordering1-dependent Markov chainparadoxes in probability theory

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Construction of voting situations concordant with ranking patterns ⋮ Construction of aggregation paradoxes through load-sharing models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• First occurrence of a word among the elements of a finite dictionary in random sequences of letters
• String overlaps, pattern matching, and nontransitive games
• On the structure of 1-dependent Markov chains
• On fair coin-tossing games
• An algebraic construction of a class of one-dependent processes
• On the asymptotic distribution theory of a class of consistent estimators of a distribution satisfying a uniform stochastic ordering constraint.
• Voting paradoxes and digraphs realizations
• Exact results on the first hitting via conditional strong quasi-stationary times and applications to metastability
• Dominating sets in \(k\)-majority tournaments.
• The Voting Problem
• How many random digits are required until given sequences are obtained?
• The Paradox of Nontransitive Dice
• Usual and stochastic tail orders between hitting times for two Markov chains
• A chaotic Exploration of Aggregation Paradoxes
• RELATIONS BETWEEN STOCHASTIC ORDERINGS AND GENERALIZED STOCHASTIC PRECEDENCE
• Some Probability Paradoxes in Choice from Among Random Alternatives
• On a Problem in Graph Theory

This page was built for publication: Ranking graphs through hitting times of Markov chains