• Home
  • Agent Gallery
  • Templates
  • Chat with PDF
  • Literature Review
  • AI Writer
  • Find Topics
  • Paraphraser
  • Citation Generator
  • Extract Data
  • AI Detector
Scispace (Formerly Typeset)
  1. Home
  2. Journals
  3. Electronic Communications in Probability
  4. 2003
  1. Home
  2. Journals
  3. Electronic Communications in Probability
  4. 2003
Showing papers in "Electronic Communications in Probability in 2003"
Journal Article•10.1214/ECP.V8-1072•
Excited Random Walk

[...]

Itai Benjamini1, David B. Wilson2•
Weizmann Institute of Science1, Microsoft2
24 Jun 2003-Electronic Communications in Probability
TL;DR: In this paper, it was shown that an excited random walk on a polygonal grid is transient iff $d > 1, where d is the number of vertices in the grid.
Abstract: A random walk on $\mathbb{Z}^d$ is excited if the first time it visits a vertex there is a bias in one direction, but on subsequent visits to that vertex the walker picks a neighbor uniformly at random. We show that excited random walk on $\mathbb{Z}^d$ is transient iff $d > 1$.

161 citations

Journal Article•10.1214/ECP.V8-1074•
A system of differential equations for the airy process

[...]

Craig A. Tracy1, Harold Widom2•
University of California, Davis1, University of California, Santa Cruz2
24 Jun 2003-Electronic Communications in Probability
TL;DR: In this paper, it was shown that each finite-dimensional distribution function in the Airy process is expressible in terms of a solution to a system of differential equations, which is known as the Painleve II solution.
Abstract: The Airy process is characterized by its $m$-dimensional distribution functions. For $m=1$ it is known that this distribution function is expressible in terms of a solution to Painleve II. We show that each finite-dimensional distribution function is expressible in terms of a solution to a system of differential equations.

33 citations

Journal Article•10.1214/ECP.V8-1071•
Mixing Time of the Rudvalis Shuffle

[...]

David B. Wilson1•
Microsoft1
24 Jun 2003-Electronic Communications in Probability
TL;DR: In this article, a technique for lower bounding the mixing time of card-shuffling Markov chains is presented, which matches (up to constants) previously known upper bounds.
Abstract: We extend a technique for lower-bounding the mixing time of card-shuffling Markov chains, and use it to bound the mixing time of the Rudvalis Markov chain, as well as two variants considered by Diaconis and Saloff-Coste. We show that in each case $\Theta(n^3 \log n)$ shuffles are required for the permutation to randomize, which matches (up to constants) previously known upper bounds. In contrast, for the two variants, the mixing time of an individual card is only $\Theta(n^2)$ shuffles.

32 citations

Journal Article•10.1214/ECP.V8-1089•
Strict Convexity of the Limit Shape in First-Passage Percolation

[...]

Steven P. Lalley1•
University of Chicago1
11 Jul 2003-Electronic Communications in Probability
TL;DR: In this paper, sufficient conditions for the strict convexity of the limit shape in standard first-passage percolation were given, which involve (1) asymptotic straightness of the geodesics, and (2) existence of mean-zero limit distributions for the first passage times.
Abstract: Sufficient conditions are given for the strict convexity of the limit shape in standard first-passage percolation. These conditions involve (1) asymptotic ``straightness'' of the geodesics, and (2) existence of mean-zero limit distributions for the first-passage times.

6 citations

Journal Article•10.1214/ECP.V8-1097•
A note on the richness of convex hulls of VC classes

[...]

Gábor Lugosi1, Shahar Mendelson2, Vladimir Koltchinskii3•
Pompeu Fabra University1, Australian National University2, University of New Mexico3
17 Dec 2003-Electronic Communications in Probability
TL;DR: In this paper, the existence of a class of subsets of sets of VC dimension 1 such that the symmetric convex hull of the class of characteristic functions of sets in sets in $A$ is rich in the following sense.
Abstract: We prove the existence of a class $A$ of subsets of $\mathbb{R}^d$ of VC dimension 1 such that the symmetric convex hull $F$ of the class of characteristic functions of sets in $A$ is rich in the following sense. For any absolutely continuous probability measure $\mu$ on $\mathbb{R}^d$, measurable set $B$ and $\varepsilon > 0$, there exists a function $f$ in $F$ such that the measure of the symmetric difference of $B$ and the set where $f$ is positive is less than $\varepsilon$. The question was motivated by the investigation of the theoretical properties of certain algorithms in machine learning.

5 citations

Journal Article•10.1214/ECP.V8-1099•
Inequality of Two Critical Probabilities for Percolation

[...]

Jeffry Kahn1•
Rutgers University1
27 Dec 2003-Electronic Communications in Probability
TL;DR: In this article, the critical probability for Bernoulli bond percolation on locally finite, connected graphs was shown to be equal to the first moment method lower bound on this probability.
Abstract: We disprove a conjecture of Russ Lyons---that for every locally finite, connected graph $G$, the critical probability for (Bernoulli bond) percolation on $G$ is equal to the "first moment method" lower bound on this probability---and propose a possible alternative.

3 citations

Journal Article•10.1214/ECP.V8-1098•
Linear Speed Large Deviations for Percolation Clusters

[...]

Yevgeniy Kovchegov1, Scott Sheffield2•
University of California, Los Angeles1, Microsoft2
27 Dec 2003-Electronic Communications in Probability
TL;DR: In this paper, it was shown that if the origin-containing cluster in subcritical percolation on the lattice is viewed as a random variable in the space of compact, connected, origincontaining subsets of the Euclidean space, endowed with the Hausdorff metric, then the probability that the correlation-norm Steiner tree fails to approximate one of these trees tends to zero exponentially in n.
Abstract: Let $C_n$ be the origin-containing cluster in subcritical percolation on the lattice $\frac{1}{n} \mathbb Z^d$, viewed as a random variable in the space $\Omega$ of compact, connected, origin-containing subsets of $\mathbb R^d$, endowed with the Hausdorff metric $\delta$. When $d \geq 2$, and $\Gamma$ is any open subset of $\Omega$, we prove that $$\lim_{n \rightarrow \infty}\frac{1}{n} \log P(C_n \in \Gamma) = -\inf_{S \in \Gamma} \lambda(S)$$ where $\lambda(S)$ is the one-dimensional Hausdorff measure of $S$ defined using the correlation norm : $$||u|| := \lim_{n \rightarrow \infty} - \frac{1}{n} \log P (u_n \in C_n )$$ where $u_n$ is $u$ rounded to the nearest element of $\frac{1}{n}\mathbb Z^d$. Given points $a^1, \ldots, a^k \in \mathbb R^d$, there are finitely many correlation-norm Steiner trees spanning these points and the origin. We show that if the $C_n$ are each conditioned to contain the points $a^1_n, \ldots, a^k_n$, then the probability that $C_n$ fails to approximate one of these trees tends to zero exponentially in $n$.

2 citations

Journal Article•10.1214/ECP.V8-1070•
A Law of the Iterated Logarithm for the Sample Covariance Matrix

[...]

Steven J. Sepanski1•
Saginaw Valley State University1
20 May 2003-Electronic Communications in Probability
TL;DR: For a sequence of independent identically distributed Euclidean random vectors, this paper proved a bounded law of the iterated logarithm for the sample covariance matrix when o(log log n) terms are omitted.
Abstract: For a sequence of independent identically distributed Euclidean random vectors, we prove a law of the iterated logarithm for the sample covariance matrix when o(log log n) terms are omitted. The result is proved under the hypothesis that the random vectors belong to the generalized domain of attraction of the multivariate Gaussian law. As an application, we obtain a bounded law of the iterated logarithm for the multivariate t-statistic.
Journal Article•10.1214/ECP.V8-1068•
Central Limit Theorems for the Products of Random Matrices Sampled by a Random Walk

[...]

Frédérique Duheille-Bienvenue1, Nadine Guillotin-Plantard1•
Claude Bernard University Lyon 11
04 Dec 2003-Electronic Communications in Probability
TL;DR: In this paper, the authors studied the asymptotic behavior of the products of random matrices indexed by a random walk following the results obtained by Furstenberg and Kesten (MR53:14670) and by Ishitani (MR 53: 14670).
Abstract: The purpose of the present paper is to study the asymptotic behaviour of the products of random matrices indexed by a random walk following the results obtained by Furstenberg and Kesten (MR53:14670) and by Ishitani (MR 53:14670).
Journal Article•10.1214/ECP.V8-1078•
Positive correlation for increasing events with disjoint dependencies does not imply positive correlation for all increasing events

[...]

Nicholas Weininger1•
Rutgers University1
18 Jul 2003-Electronic Communications in Probability
TL;DR: In this article, it was shown that it might be sufficient to show positive correlation only for pairs of functions which depend on disjoint subsets of the ground set, but not for general pairs of increasing functions.
Abstract: A probability measure $\mu$ on the lattice $2^{[n]}$ is said to be positively associated if any two increasing functions on the lattice are positively correlated with respect to $\mu$. Pemantle asked whether, in order to establish positive association for a given mu, it might be sufficient to show positive correlation only for pairs of functions which depend on disjoint subsets of the ground set $[n]$. We answer Pemantle's question in the negative, by exhibiting a measure which gives positive correlation for pairs satisfying Pemantle's condition but not for general pairs of increasing functions.
Journal Article•10.1214/ECP.V8-1080•
Microscopic structure of a decreasing shock for the asymmetric $k$-step exclusion process

[...]

Hervé Guiol1, Krishnamurthi Ravishankar2, Ellen Saada3•
École Polytechnique Fédérale de Lausanne1, State University of New York at Purchase2, Centre national de la recherche scientifique3
22 Dec 2003-Electronic Communications in Probability
TL;DR: The asymmetric $k$-step exclusion process as mentioned in this paper is the simplest interacting particle system whose hydrodynamic equation may exhibit both increasing and decreasing entropic shocks under Euler scaling.
Abstract: The asymmetric $k$-step exclusion processes are the simplest interacting particle systems whose hydrodynamic equation may exhibit both increasing and decreasing entropic shocks under Euler scaling. We prove that, under Riemann initial condition with right density zero and adequate left density, the rightmost particle identifies microscopically the decreasing shock.
Journal Article•10.1214/ECP.V8-1066•
Trees and Matchings from Point Processes

[...]

Alexander E. Holroyd1, Yuval Peres1•
University of California, Berkeley1
03 Mar 2003-Electronic Communications in Probability
TL;DR: In this article it was shown that the d-dimensional Poisson process has a one-ended tree as a factor graph, which implies that the Poisson points can be given an ordering isomorphic to the usual ordering of the integers in a deterministic isometry-invariant way.
Abstract: A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d -dimensional Poisson process has a one-ended tree as a factor graph. This implies that the Poisson points can be given an ordering isomorphic to the usual ordering of the integers in a deterministic isometry-invariant way. For d greater than or equal to 4 our result answers a question posed by Ferrari, Landim and Thorisson [7]. We prove also that any isometry-invariant ergodic point process of finite intensity in Euclidean or hyperbolic space has a perfect matching as a factor graph provided all the inter-point distances are distinct.
Journal Article•10.1214/ECP.V8-1084•
On a sde driven by a fractional brownian motion and with monotone drift

[...]

Brahim Boufoussi1, Youssef Ouknine•
Cadi Ayyad University1
10 Jul 2003-Electronic Communications in Probability
TL;DR: In this article, the existence of a weak solution for a stochastic differential equation of the form (X =x + B =x+B =H + √ √ 0,T ) was proved for a fractional Brownian motion with Hurst parameters.
Abstract: Let ${B_{t}^{H},t\in \lbrack 0,T]}$ be a fractional Brownian motion with Hurst parameter $H > \frac{1}{2}$. We prove the existence of a weak solution for a stochastic differential equation of the form $X_{t}=x+B_{t}^{H}+ \int_{0}^{t}\left( b_{1}(s,X_{s})+b_{2}(s,X_{s})\right) ds$, where $ b_{1}(s,x)$ is a Holder continuous function of order strictly larger than $1-\frac{1}{2H}$ in $x$ and than $H-\frac{1}{2}$ in time and $b_{2}$ is a real bounded nondecreasing and left (or right) continuous function.
Journal Article•10.1214/ECP.V8-1067•
SLE and Triangles

[...]

Julien Dubédat1•
University of Paris-Sud1
03 Oct 2003-Electronic Communications in Probability
TL;DR: In this paper, Carleson's observation on Cardy's formula describing crossing probabilities for the scaling limit of critical percolation was extended to Stochastic Loewner Evolutions with various parameters, for which certain hitting distributions are uniformly distributed.
Abstract: By analogy with Carleson's observation on Cardy's formula describing crossing probabilities for the scaling limit of critical percolation, we exhibit ``privileged geometries'' for Stochastic Loewner Evolutions with various parameters, for which certain hitting distributions are uniformly distributed. We then examine consequences for limiting probabilities of events concerning various critical plane discrete models.
Journal Article•10.1214/ECP.V8-1079•
Smoothness of the law of the supremum of the fractional Brownian motion

[...]

Noureddine Lanjri Zaïdi1, David Nualart2•
Ibn Tofail University1, University of Barcelona2
15 Sep 2003-Electronic Communications in Probability
TL;DR: The Malliavin calculus was used in this article to prove that the supremum of a fractional Brownian motion with Hurst parameter has an infinitely differentiable density on the plane.
Abstract: This note is devoted to prove that the supremum of a fractional Brownian motion with Hurst parameter $H\in \left( 0,1\right)$ has an infinitely differentiable density on $\left( 0,\infty \right)$. The proof of this result is based on the techniques of the Malliavin calculus.
Journal Article•10.1214/ECP.V8-1064•
The Mean of a Maximum Likelihood Estimator Associated with the Brownian Bridge

[...]

Fuchang Gao1•
University of Idaho1
02 Mar 2003-Electronic Communications in Probability
TL;DR: In this article, a closed formula for the mean of a maximum likelihood estimator associated with the Brownian bridge is obtained, and the exact relation with that of the motion is established.
Abstract: A closed formula for the mean of a maximum likelihood estimator associated with the Brownian bridge is obtained; the exact relation with that of the Brownian motion is established.
Journal Article•10.1214/ECP.V8-1076•
Noncolliding Brownian motions and Harish-Chandra formula

[...]

Makoto Katori1, Hideki Tanemura2•
Chuo University1, Chiba University2
23 Sep 2003-Electronic Communications in Probability
TL;DR: In this paper, the Harish-Chandra formula for an integral over the unitary group has been derived for a noncolliding Brownian motion, whose eigenvalues are identically distributed with the particle positions of a temporally inhomogeneous diffusion process.
Abstract: We consider a system of noncolliding Brownian motions introduced in our previous paper, in which the noncolliding condition is imposed in a finite time interval $(0,T]$. This is a temporally inhomogeneous diffusion process whose transition probability density depends on a value of $T$, and in the limit $T \to \infty$ it converges to a temporally homogeneous diffusion process called Dyson's model of Brownian motions. It is known that the distribution of particle positions in Dyson's model coincides with that of eigenvalues of a Hermitian matrix-valued process, whose entries are independent Brownian motions. In the present paper we construct such a Hermitian matrix-valued process, whose entries are sums of Brownian motions and Brownian bridges given independently of each other, that its eigenvalues are identically distributed with the particle positions of our temporally inhomogeneous system of noncolliding Brownian motions. As a corollary of this identification we derive the Harish-Chandra formula for an integral over the unitary group.
Journal Article•10.1214/ECP.V8-1092•
Heat Kernel Asymptotics on the Lamplighter Group

[...]

David Revelle1•
University of California, Berkeley1
11 Oct 2003-Electronic Communications in Probability
TL;DR: In this article, it was shown that for one generating set, the on-diagonal decay of the heat kernel on the lamplighter group is asymptotic to $c_1 n^{1/6}\exp[-c_2 n^{ 1/3}].
Abstract: We show that, for one generating set, the on-diagonal decay of the heat kernel on the lamplighter group is asymptotic to $c_1 n^{1/6}\exp[-c_2 n^{1/3}]$. We also make off-diagonal estimates which show that there is a sharp threshold for which elements have transition probabilities that are comparable to the return probability. The off-diagonal estimates also give an upper bound for the heat kernel that is uniformly summable in time. The methods used also apply to a one dimensional trapping problem, and we compute the distribution of the walk conditioned on survival as well as a corrected asymptotic for the survival probability. Conditioned on survival, the position of the walker is shown to be concentrated within $\alpha n^{1/3}$ of the origin for a suitable $\alpha$.
Journal Article•10.1214/ECP.V8-1096•
Path transformations of first passage bridges

[...]

Jean Bertoin1, Loïc Chaumont1, Jim Pitman2•
Pierre-and-Marie-Curie University1, University of California, Berkeley2
17 Dec 2003-Electronic Communications in Probability
TL;DR: In this article, the authors define the first passage bridge from 0 to λ as the Brownian motion on the time interval $[0,1]$ conditioned to first hit λ at time 1.
Abstract: We define the first passage bridge from 0 to $\lambda$ as the Brownian motion on the time interval $[0,1]$ conditioned to first hit $\lambda$ at time 1. We show that this process may be related to the Brownian bridge, the Bessel bridge or the Brownian excursion via some path transformations, the main one being an extension of Vervaat's transformation. We also propose an extension of these results to certain bridges with cyclically exchangeable increments.
Journal Article•10.1214/ECP.V8-1065•
Random Walks that Avoid Their Past Convex Hull

[...]

Omer Angel1, Itai Benjamini1, Bálint Virág2•
Weizmann Institute of Science1, Massachusetts Institute of Technology2
16 Feb 2003-Electronic Communications in Probability
TL;DR: In this paper, the authors explore planar random walk conditioned to avoid its past convex hull and prove that it escapes at a positive lim sup speed, where fluctuations from a limiting direction are on the order of $n 3/4
Abstract: We explore planar random walk conditioned to avoid its past convex hull. We prove that it escapes at a positive lim sup speed. Experimental results show that fluctuations from a limiting direction are on the order of $n^{3/4}$. This behavior is also observed for the extremal investor, a natural financial model related to the planar walk.
Journal Article•10.1214/ECP.V8-1069•
Computation of Greeks for Barrier and Lookback Options Using Malliavin Calculus

[...]

Emmanuel Gobet, Arturo Kohatsu-Higa1•
Pompeu Fabra University1
05 Dec 2003-Electronic Communications in Probability
TL;DR: In this article, the numerical computations associated to the Greeks of barrier and lookback options, using Malliavin calculus, were considered and some integration by parts formulae involving the maximum and minimum of a one dimensional diffusion were derived.
Abstract: In this article, we consider the numerical computations associated to the Greeks of barrier and lookback options, using Malliavin calculus. For this, we derive some integration by parts formulae involving the maximum and minimum of a one dimensional diffusion. Numerical tests illustrate the gain of accuracy compared to classical methods.

Tools

SciSpace AgentBiomedical AgentSciSpace RecruitSciSpace for EnterpriseAgent GalleryChat with PDFLiterature ReviewAI WriterFind TopicsParaphraserCitation GeneratorExtract DataAI Detector

Learn

ResourcesCompareLive Workshops

SciSpace

CareersSupportBrowse PapersPricingSciSpace Affiliate ProgramCancellation & Refund PolicyTermsPrivacyData Sources

Directories

PapersTopicsJournalsAuthorsConferencesInstitutionsPublishersCitation StylesWriting templates

Extension & Apps

SciSpace Chrome ExtensionSciSpace Mobile App

Contact

[email protected]
SciSpace

© 2026 | PubGenius Inc. | Suite # 217 691 S Milpitas Blvd Milpitas CA 95035, USA

soc2