Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Lambert, Rodrigo"'
We present a complete characterization of the asymptotic behaviour of a correlated Bernoulli sequence { which depends on the parameter $\theta \in [0,1]$. A martingale theory based approach will allow} us to prove versions of the law of large numbers
Externí odkaz:
http://arxiv.org/abs/2404.07370
Based on a martingale theory approach, we present a complete characterization of the asymptotic behaviour of a lazy reinforced random walk (LRRW) which shows three different regimes (diffusive, critical and superdiffusive). This allows us to prove ve
Externí odkaz:
http://arxiv.org/abs/2402.08033
We investigate the longest common substring problem for encoded sequences and its asymptotic behaviour. The main result is a strong law of large numbers for a re-scaled version of this quantity, which presents an explicit relation with the R\'enyi en
Externí odkaz:
http://arxiv.org/abs/1903.09625
We propose a model for diffusion of two opposite opinions. Here, the decision to be taken by each individual is a random variable which depends on the tendency of the population, as well on its own trend characteristic. The influence of the populatio
Externí odkaz:
http://arxiv.org/abs/1811.12070
Autor:
Lambert, Rodrigo
Definimos a função caminho mais curto como sendo a mínima quantidade de passos para que uma realização do processo com condição inicial y atinja um conjunto-alvo x. Para tal função, provamos três resultados principais: um teorema de concent
We study an urn process containing red and blue balls and two different strategies to reinforce the urn. Namely, a generalized P\'olya-type strategy versus an i.i.d. one. At each step, one of the two reinforcement strategies is chosen by flipping a c
Externí odkaz:
http://arxiv.org/abs/1708.06430
Autor:
Abadi, Miguel, Lambert, Rodrigo
We consider two independent and stationary measures over $\chi^\mathbb{N}$, where $\chi$ finite or countable alphabet. For each pair of $n$-strings in the product space we define $T_n^{(2)}$ as the length of the shortest path connecting one string to
Externí odkaz:
http://arxiv.org/abs/1611.01530
We propose an approach to construct Bernoulli trials $\{X_i, i\ge 1\}$ combining dependence and independence periods, and call it Bernoulli sequence with random dependence (BSRD). The structure of dependence, on the past $S_i = X_1 + \ldots + X_i$, {
Externí odkaz:
http://arxiv.org/abs/1607.08299
Publikováno v:
AlephRepositório Institucional da UNESPUniversidade Estadual PaulistaUNESP.
Made available in DSpace on 2014-06-11T19:28:04Z (GMT). No. of bitstreams: 0 Previous issue date: 2010-04-16Bitstream added on 2014-06-13T19:36:35Z : No. of bitstreams: 1 lambert_ro_me_mar.pdf: 1329338 bytes, checksum: 8d0e461c554b4c9fc8b32543f83d9d3
Externí odkaz:
http://hdl.handle.net/11449/96287
Autor:
Lambert, Rodrigo Obici.
Orientador: Sebastião Carlos Velasco e Cruz
Banca: Ricardo Ubiraci Sennes
Banca: Flávia de Campos Mello
O Programa de Pós-Graduação em Relações Internacionais é instituido em parceria com Unesp/Unicamp/PUC-SP, intitulado "Progr
Banca: Ricardo Ubiraci Sennes
Banca: Flávia de Campos Mello
O Programa de Pós-Graduação em Relações Internacionais é instituido em parceria com Unesp/Unicamp/PUC-SP, intitulado "Progr
Externí odkaz:
http://hdl.handle.net/11449/96287