default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDRW 2003: Paris, France
- Cyril Banderier, Christian Krattenthaler:
Discrete Random Walks, DRW'03, Paris, France, September 1-5, 2003. DMTCS Proceedings AC, DMTCS 2003 - Cyril Banderier, Christian Krattenthaler:
Introduction. 1-8 - Omer Angel:
Random Infinite Permutations and the Cyclic Time Random Walk. 9-16 - Nathanaël Berestycki, Rick Durrett:
A phase transition in the random transposition random walk. 17-26 - Yao-ban Chan, Anthony J. Guttmann:
Some results for directed lattice walkers in a strip. 27-38 - Dayue Chen, Yuval Peres:
The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview. 39-44 - Endre Csáki, Yueyun Hu:
Lengths and heights of random walk excursions. 45-52 - Ho-Kwok Dai, Hung-Chi Su:
Approximation and Analytical Studies of Inter-clustering Performances of Space-Filling Curves. 53-68 - Moez Draief, Jean Mairesse, Neil O'Connell:
Joint Burke's Theorem and RSK Representation for a Queue and a Store. 69-82 - Michael Drmota:
Discrete Random Walks on One-Sided "Periodic" Graphs. 83-94 - Rick Durrett:
Rigorous Result for the CHKNS Random Graph Model. 95-104 - L. R. G. Fontes, M. Vachkovskaia, Anatoly Yambartsev:
Entropic repulsion on a rarefied wall. 105-112 - David Gamarnik:
Linear Phase Transition in Random Linear Constraint Satisfaction Problems. 113-126 - Michael L. Green, Alan Krinik, Carrie Mortensen, Gerardo Rubino, Randall J. Swift:
Transient Probability Functions: A Sample Path Approach. 127-136 - Anders Karlsson:
Some remarks concerning harmonic functions on homogeneous graphs. 137-144 - Oleksiy Khorunzhiy:
Rooted trees and moments of large sparse random matrices. 145-154 - Guy Louchard:
The number of distinct part sizes of some multiplicity in compositions of an Integer. A probabilistic Analysis. 155-170 - Fabio P. Machado:
Percolation on a non-homogeneous Poisson blob process. 171-172 - Philippe Marchal:
Constructing a sequence of random walks strongly converging to Brownian motion. 181-190 - James B. Martin:
Reconstruction Thresholds on Regular Trees. 191-204 - Massimiliano Mattera:
Annihilating random walks and perfect matchings of planar graphs. 173-180 - Mikhail Menshikov, Dimitri Petritis, Serguei Popov:
Bindweeds or random walks in random environments on multiplexed trees and their asympotics. 205-216 - Donatella Merlini:
Generating functions for the area below some lattice paths. 217-228 - Saibal Mitra, Bernard Nienhuis:
Osculating Random Walks on Cylinders. 229-264 - Michel Nguyên-Thê:
Area of Brownian Motion with Generatingfunctionology. 265-242 - Pierre Nicodème:
q-gram analysis and urn models. 243-258 - Alois Panholzer:
Non-crossing trees revisited: cutting down and spanning subtrees. 265-276 - Serguei Yu. Popov:
Frogs and some other interacting random walks models. 277-288 - Klaus Simon, Beat Trachsler:
A Random Walk Approach for Light Scattering in Material. 289-300 - András Telcs:
The volume and time comparison principle and transition probability estimates for random walks. 301-308 - Leonid Tolmatz:
The Saddle Point Method for the Integral of the Absolute Value of the Brownian Motion. 309-324 - Valentin Topchii, Vladimir Vatutin:
Individuals at the origin in the critical catalytic branching random walk. 325-332 - Alessandro Vezzani, Davide Cassi, Raffaella Burioni:
Average properties of combinatorial problems and thermodynamics of spin models on graphs. 333-344 - Nisheeth K. Vishnoi:
Non Uniform Random Walks. 345-358
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.
last updated on 2025-02-03 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
