Open Advanced Search

Log in
Enterprise Plans
Free Trial

Log in
Free Trial
Enterprise Plans
Browse
Features
Pricing

DeepDyve

Advanced Search

show/hide query preview

With all of the words or DOIs:

DeepDyve's default query mode: search by keyword or DOI.

With the exact phrase:

Require these words, in this exact order. Do not surround your terms in double-quotes ("") in this field.

With at least one of the words:

Find any of these words, separated by spaces

Without the words:

Exclude each of these words, separated by spaces

With words in the article title:

Search for these terms only in the title of an article

Published between the years:

With the following authors:

Most effective as: LastName, First Name or Lastname, FN

With words in the journal name:

Search for articles published in journals where these words are in the journal name

Reset filters

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

In and Out of Equilibrium 3: Celebrating Vladas Sidoravicius

Part of the Progress in Probability Book Series (volume 77)

Editors: Vares, Maria Eulália; Fernández, Roberto; Fontes, Luiz Renato; Newman, Charles M.

DOI: 10.1007/978-3-030-60754-8

ISBN: 978-3-030-60753-1

Publisher: Springer International Publishing - Springer Journals

Nov 4, 2020

31 - 33 of 33 Chapters

LitStream

Chapter 31On One-Dimensional Multi-Particle Diffusion Limited Aggregation

Sly, Allan

Pages: 755 –774

[We prove that the one dimensional Multi-Particle Diffusion Limited Aggregation model has linear growth whenever the particle density exceeds 1 answering a question of Kesten and Sidoravicius. As a corollary we prove linear growth in all dimensions d when the particle density is at least 1.]
LitStream

Chapter 32On the C1-Property of the Percolation Function of Random Interlacements and a Related Variational Problem

Sznitman, Alain-Sol

Pages: 775 –796

[We consider random interlacements on ℤd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt}...
LitStream

Chapter 33On Clusters of Brownian Loops in d Dimensions

Werner, Wendelin

Pages: 797 –817

[We discuss random geometric structures obtained by percolation of Brownian loops, in relation to the Gaussian Free Field, and how their existence and properties depend on the dimension of the ambient space. We formulate a number of conjectures for the cases d = 3, 4, 5 and prove some results...

results per page

Browse All eBooks

Features

Search and discover articles on DeepDyve, PubMed, and Google Scholar
Read the full-text of open access and premium content
Organize articles with folders and bookmarks
Collaborate on and share articles and folders

Info

Pricing
Enterprise Plans
Browse Journals & Topics
About DeepDyve

Help

Help
Publishers
Contact Us

Sign up for your 14-Day Free Trial Now!

Read and print from thousands of top scholarly journals.

System error. Please try again!

Continue with Facebook

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Save Article to Bookmarks

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.

Subscribe to Journal Email Alerts

To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Follow a Journal

To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Our policy towards the use of cookies

All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.

cookie policy