On the public citation graph
An O(n2) bound for the relaxation time of a Markov chain on cladograms
0 signed · 31 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199707)10:4<487::aid-rsa4>3.0.co;2-qopenalex-snapshot
Sampling contingency tables
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199712)11:4<299::aid-rsa2>3.0.co;2-uopenalex-snapshot
A semidefinite bound for mixing rates of Markov chains
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199910/12)15:3/4<229::aid-rsa3>3.0.co;2-xopenalex-snapshot
Fast convergence of the Glauber dynamics for sampling independent sets
inferredcites →https://doi.org/10.1006/jagm.1999.1071openalex-snapshot
On Markov Chains for Independent Sets
inferredcites →https://doi.org/10.1017/s0963548300000390openalex-snapshot
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
inferredcites →https://doi.org/10.1017/s096354830000417xopenalex-snapshot
Mixing Time for a Markov Chain on Cladograms
inferredcites →https://doi.org/10.1063/1.533199openalex-snapshot
Analyzing Glauber dynamics by comparison of Markov chains
inferredcites →https://doi.org/10.1214/aoap/1029962594openalex-snapshot
Comparing eigenvalue bounds for Markov chains: when does Poincaré beat Cheeger?
inferredcites →https://doi.org/10.1214/aoap/1177005980openalex-snapshot
Geometric Bounds for Eigenvalues of Markov Chains
inferredcites →https://doi.org/10.1214/ejp.v4-52openalex-snapshot
The Law of the Maximum of a Bessel Bridge
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20155openalex-snapshot
Sampling binary contingency tables with a greedy start
inferred← citeshttps://doi.org/10.1002/rsa.20930openalex-snapshot
Projections of the Aldous chain on binary trees: Intertwining and consistency
inferred← citeshttps://doi.org/10.1002/rsa.21185openalex-snapshot
A down‐up chain with persistent labels on multifurcating trees
inferred← citeshttps://doi.org/10.1007/s00440-019-00913-5openalex-snapshot
Polynomial mixing time of edge flips on quadrangulations
inferred← citeshttps://doi.org/10.1007/s10955-016-1572-2openalex-snapshot
The Worm Process for the Ising Model is Rapidly Mixing
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.10.050openalex-snapshot
A general steady state distribution based stopping criteria for finite length genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.spa.2017.02.002openalex-snapshot
Elementary bounds on mixing times for decomposable Markov chains
inferred← citeshttps://doi.org/10.1016/j.spl.2013.09.017openalex-snapshot
A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114491openalex-snapshot
Beyond windability: Approximability of the four-vertex model
inferred← citeshttps://doi.org/10.1017/jpr.2022.15openalex-snapshot
An adjacent-swap Markov chain on coalescent trees
inferred← citeshttps://doi.org/10.1109/tnse.2019.2926887openalex-snapshot
Rapid Mixing of Dynamic Graphs With Local Evolution Rules
inferred← citeshttps://doi.org/10.1214/009117906000000034openalex-snapshot
Subtree prune and regraft: A reversible real tree-valued Markov process
inferred← citeshttps://doi.org/10.1214/11-aop704openalex-snapshot
Wright–Fisher diffusion with negative mutation rates
inferred← citeshttps://doi.org/10.1214/20-aop1431openalex-snapshot
The Aldous chain on cladograms in the diffusion limit
inferred← citeshttps://doi.org/10.1214/ejp.v7-105openalex-snapshot
Random Walks on Trees and Matchings
inferred← citeshttps://doi.org/10.3390/mca25040067openalex-snapshot
Markov Chain-Based Sampling for Exploring RNA Secondary Structure under the Nearest Neighbor Thermodynamic Model and Extended Applications
inferred← citeshttps://doi.org/10.70675/d502d8c1z4a33z4c5czbe3fz911a307b27dbopenalex-snapshot
Algebraic and nested tree-valued processes
inferred← citeshttps://doi.org/10.70675/dba8dfd5z6bc9z4943zb90ezb89854c52204openalex-snapshot
Dynamic network formation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.