On the public citation graph

Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method

0 signed · 70 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/(sici)1098-2418(199803)12:2<111::aid-rsa1>3.0.co;2-#openalex-snapshot
Maximum matchings in sparse random graphs: Karp–Sipser revisited
inferredcites →https://doi.org/10.1002/9781118032718openalex-snapshot
Random Graphs
inferredcites →https://doi.org/10.1002/rsa.1015openalex-snapshot
The ζ(2) limit in the random assignment problem
inferredcites →https://doi.org/10.1002/rsa.3240050504openalex-snapshot
On the independence number of random cubic graphs
inferredcites →https://doi.org/10.1007/978-3-0348-8211-8_14openalex-snapshot
Minimal Spanning Trees for Graphs with Random Edge Lengths
inferredcites →https://doi.org/10.1007/978-3-662-09444-0_1openalex-snapshot
The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence
inferredcites →https://doi.org/10.1007/bf01192719openalex-snapshot
Asymptotics in the random assignment problem
inferredcites →https://doi.org/10.1007/s00440-004-0345-zopenalex-snapshot
Linear phase transition in random linear constraint satisfaction problems
inferredcites →https://doi.org/10.1016/s0195-6698(80)80030-8openalex-snapshot
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
inferredcites →https://doi.org/10.1016/s0304-3975(01)00163-3openalex-snapshot
Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
inferredcites →https://doi.org/10.1023/b:ques.0000021149.43343.05openalex-snapshot
A Hard-Core Model on a Cayley Tree: An Example of a Loss Network
inferredcites →https://doi.org/10.1090/dimacs/063/12openalex-snapshot
Survey: Information flow on trees
inferredcites →https://doi.org/10.1109/sfcs.1981.21openalex-snapshot
Maximum matching in sparse random graphs
inferredcites →https://doi.org/10.1111/j.2517-6161.1985.tb01367.xopenalex-snapshot
Stochastic Models of Computer Communication Systems
inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot
Ten Lectures on the Probabilistic Method
inferredcites →https://doi.org/10.1214/105051605000000142openalex-snapshot
A survey of max-type recursive distributional equations
inferredcites →https://doi.org/10.1214/aoap/1177004612openalex-snapshot
Differential Equations for Random Processes and Random Graphs
inferredcites →https://doi.org/10.1214/aop/1048516537openalex-snapshot
An assignment problem at high temperature
inferredcites →https://doi.org/10.2307/2043545openalex-snapshot
The Independence Ratio of Regular Graphs
inferredcites →https://doi.org/10.2307/2532227openalex-snapshot
Probability: Theory and Examples.
inferredcites →https://doi.org/10.4153/cmb-1982-024-9openalex-snapshot
Girth and Independence Ratio
inferredcites →https://doi.org/10.46298/dmtcs.3325openalex-snapshot
Reconstruction Thresholds on Regular Trees

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.4785920openalex-extracted
Two-Sided Flexibility in Platforms
inferred← citeshttps://doi.org/10.1002/jgt.23225openalex-snapshot
Independent Sets of Random Trees and Sparse Random Graphs
inferred← citeshttps://doi.org/10.1002/rsa.20236openalex-snapshot
Counting without sampling: Asymptotics of the log‐partition function for certain statistical physics models
inferred← citeshttps://doi.org/10.1002/rsa.20328openalex-snapshot
First‐passage percolation on a ladder graph, and the path cost in a VCG auction
inferred← citeshttps://doi.org/10.1002/rsa.20334openalex-snapshot
Sparse graphs: Metrics and random models
inferred← citeshttps://doi.org/10.1002/rsa.20436openalex-snapshot
Weighted enumeration of spanning subgraphs in locally tree‐like graphs
inferred← citeshttps://doi.org/10.1002/rsa.20550openalex-snapshot
On independent sets in random graphs
inferred← citeshttps://doi.org/10.1002/rsa.21064openalex-snapshot
Large deviations of the greedy independent set algorithm on sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.21256openalex-snapshot
Central limit theorem in disordered Monomer‐Dimer model
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_32openalex-snapshot
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_43openalex-snapshot
Greedy Local Search and Vertex Cover in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/s00440-025-01429-xopenalex-snapshot
Optimal unimodular matchings
inferred← citeshttps://doi.org/10.1007/s10955-017-1943-3openalex-snapshot
On Maximal Hard-Core Thinnings of Stationary Particle Processes
inferred← citeshttps://doi.org/10.1007/s10959-025-01462-5openalex-snapshot
Maximum Weight of Stable Sets in Non-Sparse and Inhomogeneous Random Graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.06.012openalex-snapshot
Limits of discrete distributions and Gibbs measures on random graphs
inferred← citeshttps://doi.org/10.1016/j.sorms.2011.03.002openalex-snapshot
Message-passing in stochastic processing networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.010openalex-snapshot
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
inferred← citeshttps://doi.org/10.1017/s0269964815000339openalex-snapshot
SERVER WAITING TIMES IN INFINITE SUPPLY POLLING SYSTEMS WITH PREPARATION TIMES
inferred← citeshttps://doi.org/10.1017/s0963548307008802openalex-snapshot
Dismantling Sparse Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548309990186openalex-snapshot
Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections
inferred← citeshttps://doi.org/10.1063/1.3122255openalex-snapshot
Gamma-Ray Spectroscopy at TRIUMF-ISAC: the New Frontier of Radioactive Ion Beam Research
inferred← citeshttps://doi.org/10.1088/1742-5468/2006/05/p05003openalex-snapshot
The number of matchings in random graphs
inferred← citeshttps://doi.org/10.1088/1742-5468/2008/06/l06001openalex-snapshot
On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs
inferred← citeshttps://doi.org/10.1098/rspa.2004.1388openalex-snapshot
Percolation–like scaling exponents for minimal paths and trees in the stochastic mean field model
inferred← citeshttps://doi.org/10.1103/physreve.102.022304openalex-snapshot
Recovery thresholds in the sparse planted matching problem
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797660openalex-snapshot
Convergence of optimal values past critical threshold
inferred← citeshttps://doi.org/10.1111/j.1467-9574.2010.00454.xopenalex-snapshot
A survey on performance analysis of warehouse carousel systems
inferred← citeshttps://doi.org/10.1112/jlms.70101openalex-snapshot
A central limit theorem for the matching number of a sparse random graph
inferred← citeshttps://doi.org/10.1137/090753115openalex-snapshot
Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
inferred← citeshttps://doi.org/10.1137/090755771openalex-snapshot
Maximum Weight Partial Colorings on Sparse Random Graphs
inferred← citeshttps://doi.org/10.1155/2014/136829openalex-snapshot
The Statistical Mechanics of Random Set Packing and a Generalization of the Karp-Sipser Algorithm
inferred← citeshttps://doi.org/10.1214/105051605000000142openalex-snapshot
A survey of max-type recursive distributional equations
inferred← citeshttps://doi.org/10.1214/12-aop816openalex-snapshot
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
inferred← citeshttps://doi.org/10.1214/14-aap1091openalex-snapshot
The densest subgraph problem in sparse random graphs
inferred← citeshttps://doi.org/10.1214/20-aap1630openalex-snapshot
Central limit theorems for combinatorial optimization problems on sparse Erdős–Rényi graphs
inferred← citeshttps://doi.org/10.1214/20-aap1660openalex-snapshot
The planted matching problem: Phase transitions and exact results
inferred← citeshttps://doi.org/10.1214/25-ejp1471openalex-snapshot
Local Limit of the Random Degree Constrained Process
inferred← citeshttps://doi.org/10.1287/ijoc.1100.0395openalex-snapshot
Resource Allocation via Message Passing
inferred← citeshttps://doi.org/10.1287/moor.1080.0327openalex-snapshot
Cost–Volume Relationship for Flows Through a Disordered Network
inferred← citeshttps://doi.org/10.1287/moor.2013.0609openalex-snapshot
Correlation Decay in Random Decision Networks
inferred← citeshttps://doi.org/10.4007/annals.2012.175.3.2openalex-snapshot
Replica symmetry of the minimum matching
inferred← citeshttps://doi.org/10.4064/fm206-0-14openalex-snapshot
On the rate of convergence to the neutral attractor of a family of one-dimensional maps
inferred← citeshttps://doi.org/10.4171/zaa/1433openalex-snapshot
Endogeny for the Logistic Recursive Distributional Equation
inferred← citeshttps://doi.org/10.48550/arxiv.cond-mat/0502346openalex-snapshot
Cost-volume relationships for flows through a disordered network
inferred← citeshttps://doi.org/10.48550/arxiv.cond-mat/0607290openalex-snapshot
A rigorous proof of the cavity method for counting matchings
inferred← citeshttps://doi.org/10.48550/arxiv.math/0402343openalex-snapshot
Dynamics of exponential linear map in functional space
inferred← citeshttps://doi.org/10.48550/arxiv.math/0511203openalex-snapshot
A Necessary and Sufficient Condition for the Tail-Triviality of a Recursive Tree Process
inferred← citeshttps://doi.org/10.53846/goediss-10004openalex-snapshot
A Central Limit Theorem for Functions on Weighted Sparse Inhomogeneous Random 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.