Ranking graphs through hitting times of Markov chains

DOI10.1002/RSA.20998MaRDI QIDQ6074655zbMATH OpenOpenAlexFDO

Authors 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

1-dependent Markov chainorderingparadoxes in probability theory

Mathematics Subject Classification ID

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

Recommendations

• The expected hitting times for finite Markov chains
• Nontransitive random variables and nontransitive dice
• A note on expected hitting times for birth and death chains
• The Paradox of Nontransitive Dice
• Hitting Time and Inverse Problems for Markov Chains

Cites work

• A chaotic Exploration of Aggregation Paradoxes
• An algebraic construction of a class of one-dependent processes
• Dominating sets in \(k\)-majority tournaments.
• Exact results on the first hitting via conditional strong quasi-stationary times and applications to metastability
• First occurrence of a word among the elements of a finite dictionary in random sequences of letters
• How many random digits are required until given sequences are obtained?
• scientific article; zbMATH DE number 3221981 (Why is no real title available?)
• scientific article; zbMATH DE number 3373125 (Why is no real title available?)
• On a Problem in Graph Theory
• On fair coin-tossing games
• On the asymptotic distribution theory of a class of consistent estimators of a distribution satisfying a uniform stochastic ordering constraint.
• On the structure of 1-dependent Markov chains
• Relations between stochastic orderings and generalized stochastic precedence
• Some Probability Paradoxes in Choice from Among Random Alternatives
• String overlaps, pattern matching, and nontransitive games
• The Paradox of Nontransitive Dice
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The Voting Problem
• Usual and stochastic tail orders between hitting times for two Markov chains
• Voting paradoxes and digraphs realizations

Cited in

(5)

• Ranking nodes in general networks: a Markov multi-chain approach
• scientific article; zbMATH DE number 6683512 (Why is no real title available?)
• Construction of voting situations concordant with ranking patterns
• Construction of aggregation paradoxes through load-sharing models
• Voting profiles admitting all candidates as knockout winners

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074655)