{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/determinantal-thinning-of-point-processes","title":"Determinantal thinning of point processes with network learning applications","arxiv_id":"1810.08672","date":"2018-10-09","proceeding":null,"authors":["Bartłomiej Błaszczyszyn","Paul Keeler"],"abstract":"A new type of dependent thinning for point processes in continuous space is\nproposed, which leverages the advantages of determinantal point processes\ndefined on finite spaces and, as such, is particularly amenable to statistical,\nnumerical, and simulation techniques. It gives a new point process that can\nserve as a network model exhibiting repulsion. The properties and functions of\nthe new point process, such as moment measures, the Laplace functional, the\nvoid probabilities, as well as conditional (Palm) characteristics can be\nestimated accurately by simulating the underlying (non-thinned) point process,\nwhich can be taken, for example, to be Poisson. This is in contrast (and\npreference to) finite Gibbs point processes, which, instead of thinning,\nrequire weighting the Poisson realizations, involving usually intractable\nnormalizing constants. Models based on determinantal point processes are also\nwell suited for statistical (supervised) learning techniques, allowing the\nmodels to be fitted to observed network patterns with some particular geometric\nproperties. We illustrate this approach by imitating with determinantal\nthinning the well-known Mat{\\'e}rn~II hard-core thinning, as well as a\nsoft-core thinning depending on nearest-neighbour triangles. These two examples\ndemonstrate how the proposed approach can lead to new, statistically optimized,\nprobabilistic transmission scheduling schemes.","url_abs":"http://arxiv.org/abs/1810.08672v2","url_pdf":"http://arxiv.org/pdf/1810.08672v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"determinantal-thinning-of-point-processes","repo_url":"https://github.com/hpaulkeeler/DetPoisson_MATLAB","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"point-processes","task_name":"Point Processes"},{"task_slug":"scheduling","task_name":"Scheduling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"hpaulkeeler/DetPoisson_MATLAB","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1d91a01e9b1af0ceef1a76900ae528cdbd62ef89b413dc47faa52ff3a831bd0b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}