EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 401 – 420 of 589

Random walks on the affine group of local fields and of homogeneous trees

Donald I. Cartwright, Vadim A. Kaimanovich, Wolfgang Woess (1994)

Annales de l'institut Fourier

The affine group of a local field acts on the tree $𝕋 (𝔉)$ (the Bruhat-Tits building of $GL (2, 𝔉)$ ) with a fixed point in the space of ends $\partial 𝕋 (F)$ . More generally, we define the affine group $Aff (𝔉)$ of any homogeneous tree $𝕋$ as the group of all automorphisms of $𝕋$ with a common fixed point in $\partial 𝕋$ , and establish main asymptotic properties of random products in $Aff (𝔉)$ : (1) law of large numbers and central limit theorem; (2) convergence to $\partial 𝕋$ and solvability of the Dirichlet problem at infinity; (3) identification of the Poisson boundary...

Random walks that avoid their past convex hull.

Angel, Omer, Benjamini, Itai, Virág, Bálint (2003)

Electronic Communications in Probability [electronic only]

Random walks with $k$ -wise independent increments.

Benjamini, Itai, Kozma, Gady, Romik, Dan (2006)

Electronic Communications in Probability [electronic only]

Randomly Weighted Series of Contractions in Hilbert Spaces.

G. Peskir, D. Schneider, M. Weber (1996)

Mathematica Scandinavica

Réarrangements convexes des marches aléatoires

Yu. Davydov, A. M. Vershik (1998)

Annales de l'I.H.P. Probabilités et statistiques

Recorridos aleatorios simples en tiempo continuo.

Ricardo Vélez Ibarrola (1983)

Trabajos de Estadística e Investigación Operativa

The properties of a certain generalization of simple random walk to continuous time are analyzed in this paper. After the definition, its transition probabilities, and the differential equations satisfied by those, are obtained. Under some conditions, the convergence of this random walk to a Wiener process is then established. Finally, absorption probabilities and mean times until absorption are calculated, giving some insight into the behaviour of the process.

Recurrence and transience of excited random walks on $ℤ^{d}$ and strips.

Zerner, Martin P.W. (2006)

Electronic Communications in Probability [electronic only]

Recurrence and transience of the edge graph of a tiling of the euclidean plane.

P.M. Soardi (1990)

Mathematische Annalen

Récurrence des librairies sur un arbre

G. Letac (1976)

Annales scientifiques de l'Université de Clermont. Mathématiques

Récurrence des marches aléatoires et ergodicité du flot géodésique sur les graphes réguliers.

M. Coornaert, A. Papadoppoulos (1996)

Mathematica Scandinavica

Recurrence of reinforced random walk on a ladder.

Sellke, Thomas (2006)

Electronic Journal of Probability [electronic only]

Recurrent graphs where two independent random walks collide finitely often.

Krishnapur, Manjunath, Peres, Yuval (2004)

Electronic Communications in Probability [electronic only]

Recurrent Random Walks and Invariant Measures on Semigroups of n x n Matrices.

Arunava Mukherjea, Göran Högnäs (1980)

Mathematische Zeitschrift

Refinement type equations: sources and results

Rafał Kapica, Janusz Morawiec (2013)

Banach Center Publications

It has been proved recently that the two-direction refinement equation of the form $f (x) = \sum_{n \in} c_{n, 1} f (k x - n) + \sum_{n \in ℤ} c_{n, - 1} f (- k x - n)$ can be used in wavelet theory for constructing two-direction wavelets, biorthogonal wavelets, wavelet packages, wavelet frames and others. The two-direction refinement equation generalizes the classical refinement equation $f (x) = \sum_{n \in ℤ} c ₙ f (k x - n)$ , which has been used in many areas of mathematics with important applications. The following continuous extension of the classical refinement equation $f (x) = \int_{ℝ} c (y) f (k x - y) d y$ has also various interesting applications....

Régularité du plus grand exposant caractéristique des produits de matrices aléatoires indépendantes et applications

Émile le Page (1989)

Annales de l'I.H.P. Probabilités et statistiques

Reinforced walk on graphs and neural networks

Józef Myjak, Ryszard Rudnicki (2008)

Studia Mathematica

A directed-edge-reinforced random walk on graphs is considered. Criteria for the walk to end up in a limit cycle are given. Asymptotic stability of some neural networks is shown.

Currently displaying 401 – 420 of 589

Previous Page 21 Next

Displaying 401 – 420 of 589

Random walks on the affine group of local fields and of homogeneous trees

Random walks that avoid their past convex hull.

Random walks with $k$ -wise independent increments.

Randomly Weighted Series of Contractions in Hilbert Spaces.

Réarrangements convexes des marches aléatoires

Recorridos aleatorios simples en tiempo continuo.

Recurrence and transience of excited random walks on $ℤ^{d}$ and strips.

Recurrence and transience of the edge graph of a tiling of the euclidean plane.

Récurrence des librairies sur un arbre

Récurrence des marches aléatoires et ergodicité du flot géodésique sur les graphes réguliers.

Recurrence of reinforced random walk on a ladder.

Recurrent graphs where two independent random walks collide finitely often.

Recurrent Random Walks and Invariant Measures on Semigroups of n x n Matrices.

Refinement type equations: sources and results

Régularité du plus grand exposant caractéristique des produits de matrices aléatoires indépendantes et applications

Reinforced walk on graphs and neural networks

Remarks on intersection-equivalence and capacity-equivalence

Remarks on random walks on semi simple Lie groups

Remarque sur l'uniforme sommabilité des suites de variables aléatoires à valeurs vectorielles normées

Remarques sur les marches aléatoires dans un demi-groupe avec un idéal compact ayant une probabilité positive

Currently displaying 401 – 420 of 589