default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 43 matches
- 2024
- Shuxiong Zhang:
Large deviation probabilities for the range of a d-dimensional supercritical branching random walk. Appl. Math. Comput. 462: 128344 (2024) - Rishideep Roy:
A branching random walk in the presence of a hard wall. J. Appl. Probab. 61(1): 1-17 (2024) - Yanyang Wang, Wei Li, Feiyi Liu, Jianmin Shen:
Supervised and unsupervised learning of (1+1) -dimensional even-offspring branching annihilating random walks. Mach. Learn. Sci. Technol. 5(1): 15033 (2024) - 2023
- Alexander Iksanov, Bohdan Rashytov, Igor Samoilenko:
Renewal theory for iterated perturbed random walks on a general branching process tree: Early generations. J. Appl. Probab. 60(1): 45-67 (2023) - Irina A. Shalimova, Karl K. Sabelfeld:
Development and implementation of branching random walk on spheres algorithms for solving the 2D elastostatics Lamé equation. Monte Carlo Methods Appl. 29(1): 79-93 (2023) - 2022
- Jean Bertoin, Hairuo Yang:
Scaling limits of branching random walks and branching-stable processes. J. Appl. Probab. 59(4): 1009-1025 (2022) - Vladyslav Bohun, Alexander Iksanov, Alexander Marynych, Bohdan Rashytov:
Renewal theory for iterated perturbed random walks on a general branching process tree: intermediate generations. J. Appl. Probab. 59(2): 421-446 (2022) - Matthew I. Roberts:
Cover time for branching random walks on regular trees. J. Appl. Probab. 59(1): 256-277 (2022) - Shuxiong Zhang:
On large-deviation probabilities for the empirical distribution of branching random walks with heavy tails. J. Appl. Probab. 59(2): 471-494 (2022) - Hao Xiong, Junchi Yan:
BTWalk: Branching Tree Random Walk for Multi-Order Structured Network Embedding. IEEE Trans. Knowl. Data Eng. 34(8): 3611-3628 (2022) - Louis Golowich, Salil P. Vadhan:
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. CCC 2022: 27:1-27:13 - Michael Conroy, Mariana Olvera-Cravioto:
Efficient Rare Event Estimation for Maxima of Branching Random Walks. WSC 2022: 145-155 - Louis Golowich, Salil P. Vadhan:
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Anastasiia Rytova, Elena Yarovaya:
Survival analysis of particle populations in branching random walks. Commun. Stat. Simul. Comput. 50(10): 3031-3045 (2021) - 2020
- Peter Braunsteins, Sophie Hautphenne:
The probabilities of extinction in a branching random walk on a strip. J. Appl. Probab. 57(3): 811-831 (2020) - Sihong Shao, Yunfeng Xiong:
Branching Random Walk Solutions to the Wigner Equation. SIAM J. Numer. Anal. 58(5): 2589-2608 (2020) - Takuro Mayaguchi, Ryota Sakaguchi, Hiroyuki Ohsaki:
On the Dynamics of Branching Random Walk on Random Regular Graph. ICOIN 2020: 307-311 - 2019
- Colin Cooper, Tomasz Radzik, Nicolas Rivera:
New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. ACM Trans. Parallel Comput. 6(3): 16:1-16:24 (2019) - Ekaterina Vl. Bulinskaya:
Multidimensional Catalytic Branching Random Walk with Regularly Varying Tails. ICoMS 2019: 6-13 - 2018
- Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche:
Better Bounds for Coalescing-Branching Random Walks. ACM Trans. Parallel Comput. 5(1): 2:1-2:23 (2018) - Petra Berenbrink, George Giakkoupis, Peter Kling:
Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. SODA 2018: 1715-1733 - 2017
- Dan Han, Yulia Makarova, Stanislav Molchanov, Elena Yarovaya:
Branching Random Walks with Immigration. ACMPT 2017: 401-408 - Colin Cooper, Tomasz Radzik, Nicolas Rivera:
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. SPAA 2017: 305-312 - 2016
- Alexander Iksanov, Zakhar Kabluchko:
A central limit theorem and a law of the iterated logarithm for the Biggins martingale of the supercritical branching random walk. J. Appl. Probab. 53(4): 1178-1192 (2016) - Colin Cooper, Tomasz Radzik, Nicolas Rivera:
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. PODC 2016: 461-467 - Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche:
Better Bounds for Coalescing-Branching Random Walks. SPAA 2016: 313-323 - Colin Cooper, Tomasz Radzik, Nicolas Rivera:
The coalescing-branching random walk on expanders and the dual epidemic process. CoRR abs/1602.05768 (2016) - Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche:
Better bounds for coalescing-branching random walks. CoRR abs/1603.06109 (2016) - 2015
- Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche:
Coalescing-Branching Random Walks on Graphs. ACM Trans. Parallel Comput. 2(3): 20:1-20:29 (2015) - 2014
- Florian Simatos:
Coupling Limit Order Books and Branching Random Walks. J. Appl. Probab. 51(3): 625-639 (2014)
skipping 13 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-22 05:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint