On the public citation graph

Max-Linear Models on Infinite Graphs Generated by Bernoulli Bond Percolation

0 signed · 11 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.1002/rsa.3240050407openalex-snapshot
Improved upper bounds for the critical probability of oriented percolation in two dimensions
inferredcites →https://doi.org/10.1007/0-387-34471-3openalex-snapshot
Extreme Value Theory
inferredcites →https://doi.org/10.1007/978-0-387-45024-7openalex-snapshot
Heavy-Tail Phenomena: Probabilistic and Statistical Modeling
inferredcites →https://doi.org/10.1007/978-0-387-75953-1openalex-snapshot
Extreme Values, Regular Variation and Point Processes
inferredcites →https://doi.org/10.1007/bf01440733openalex-snapshot
Modelling of extremal events in insurance and finance
inferredcites →https://doi.org/10.1016/j.dam.2008.09.012openalex-snapshot
Irreversible k -threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
inferredcites →https://doi.org/10.1017/9781316795552openalex-snapshot
Random Graphs and Complex Networks: Volume 1
inferredcites →https://doi.org/10.1201/9781315373140-16openalex-snapshot
Interacting Particle Systems
inferredcites →https://doi.org/10.1214/aop/1176993140openalex-snapshot
Oriented Percolation in Two Dimensions
inferredcites →https://doi.org/10.3150/17-bej941openalex-snapshot
Max-linear models on directed acyclic graphs

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4640753openalex-extracted
Convergence Rate of Tail Dependence Function in Recursive Max-Linear Models on Directed Acyclic Graphs
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.