On the public citation graph

Finite Factors of Bernoulli Schemes and Distinguishing Labelings of Directed Graphs

https://doi.org/10.37236/6
0 signed · 34 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-387-79711-3openalex-snapshot
Combinatorics and Graph Theory
inferredcites →https://doi.org/10.1007/978-1-4899-6696-4_1openalex-snapshot
A Characterization of Those Processes Finitarily Isomorphic to a Bernoulli Shift
inferredcites →https://doi.org/10.1007/b11601500openalex-snapshot
Combinatorial Stochastic Processes
inferredcites →https://doi.org/10.1007/bf00535166openalex-snapshot
Finitary codes between Markov processes
inferredcites →https://doi.org/10.1007/bf02760609openalex-snapshot
Finitary isomorphisms of irreducible Markov shifts
inferredcites →https://doi.org/10.1007/bf03007652openalex-snapshot
A class of finitary codes
inferredcites →https://doi.org/10.1016/0001-8708(70)90009-5openalex-snapshot
Factors of Bernoulli shifts are Bernoulli shifts
inferredcites →https://doi.org/10.1016/0304-4149(91)90091-popenalex-snapshot
A finite characterization of weak lumpable Markov processes. Part I: The discrete time case
inferredcites →https://doi.org/10.1016/j.anihpb.2005.11.001openalex-snapshot
On estimating the memory for finitarily Markovian processes
inferredcites →https://doi.org/10.1016/s0019-3577(09)80019-0openalex-snapshot
Finitary isomorphism of some renewal processes to Bernoulli schemes
inferredcites →https://doi.org/10.1017/cbo9781316669846openalex-snapshot
Topics in Graph Automorphisms and Reconstruction
inferredcites →https://doi.org/10.1017/s0143385700009597openalex-snapshot
A mixing Markov chain with exponentially decaying return times is finitarily Bernoulli
inferredcites →https://doi.org/10.1090/s0002-9904-1963-10924-6openalex-snapshot
On the isomorphism problem for Bernoulli schemes
inferredcites →https://doi.org/10.1109/tit.1983.1056741openalex-snapshot
A universal data compression system
inferredcites →https://doi.org/10.1214/074921706000000284openalex-snapshot
Finitary Codes, a short survey
inferredcites →https://doi.org/10.1214/09-bjps106openalex-snapshot
A note on r-processes
inferredcites →https://doi.org/10.1214/aoms/1177699147openalex-snapshot
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
inferredcites →https://doi.org/10.1214/lnms/1196285827openalex-snapshot
Finitary Codes, a short survey
inferredcites →https://doi.org/10.1216/rmj-2012-42-1-293openalex-snapshot
On the marker method for constructing finitary isomorphisms
inferredcites →https://doi.org/10.2307/1971117openalex-snapshot
Bernoulli Schemes of the Same Entropy are Finitarily Isomorphic
inferredcites →https://doi.org/10.37236/1242openalex-snapshot
Symmetry Breaking in Graphs
inferredcites →https://doi.org/10.37236/292openalex-snapshot
Distinguishing Number of Countable Homogeneous Relational Structures
inferredcites →https://doi.org/10.5860/choice.41-2860openalex-snapshot
Topics in graph automorphisms and reconstruction

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00373-020-02182-9openalex-snapshot
Burning the Plane
inferred← citeshttps://doi.org/10.1007/s00373-020-02202-8openalex-snapshot
Optimal Domination Polynomials
inferred← citeshttps://doi.org/10.1007/s40009-014-0256-1openalex-snapshot
Harmonious Coloring on Corona Product of Complete Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.017openalex-snapshot
Harmonious colourings of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.021openalex-snapshot
On the distinguishing number of cyclic tournaments: Towards the Albertson–Collins Conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.007openalex-snapshot
Distinguishing numbers and distinguishing indices of oriented graphs
inferred← citeshttps://doi.org/10.1080/10236198.2014.917635openalex-snapshot
Beyond Zudilin's conjecturedq-analogue of Schmidt's problem
inferred← citeshttps://doi.org/10.1088/1742-6596/1008/1/012027openalex-snapshot
On the Total Edge Irregularity Strength of Generalized Butterfly Graph
inferred← citeshttps://doi.org/10.1090/tran/8776openalex-snapshot
On the failure of Ornstein theory in the finitary category
inferred← citeshttps://doi.org/10.37236/2213openalex-snapshot
Graph Labelings and Continuous Factors of Dynamical Systems
inferred← citeshttps://doi.org/10.3934/amc.2013.7.253openalex-snapshot
On codes over rings invariant under affine groups
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.