Related papers: Connection Coefficients for Higher-order Bernoulli…

Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends on not only geometric features of the…

We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

We discuss chains of interacting Brownian motions. Their time reversal invariance is broken because of asymmetry in the interaction strength between left and right neighbor. In the limit of a very steep and short range potential one arrives…

Quantum random walks use interference to obtain faster state space exploration, which can be used for algorithmic purposes. Photonic technologies provide a natural platform for many recent experimental demonstrations. Here we analyze…

In this paper we give some relation involving values of q-Bernoulli, q-Euler and Bernstein polynomials. From these relations, we obtain some interesting identities on the q-Bernoulli, q-Euler and Bernstein polynomials.

Quantum Bernoulli noises are annihilation and creation operators acting on Bernoulli functionals, which satisfy the canonical anti-commutation relations (CAR) in equal-time. In this paper, we use quantum Bernoulli noises to introduce a…

Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains…

We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…

We derive several symmetric identities for Bernoulli and Euler polynomials which imply some known identities. Our proofs depend on the new technique developed in part I and some identities obtained in [European J. Combin. 24(2003),…

We consider the path approximation of Bessel processes and develop a new and efficient algorithm. This study is based on a recent work by the authors, on the path approximation of the Brownian motion, and on the construction of specific own…

New convolution identities of hypergeometric Bernoulli polynomials are presented. Two different approaches to proving these identities are discussed, corresponding to the two equivalent definitions of hypergeometric Bernoulli polynomials as…

Motivated by [G. Cannizzaro, M. Hairer, Comm. Pure Applied Math., '22], we provide a construction of the Brownian Web (see [T\'oth B., Werner W., Probab. Theory Related Fields, '98] and [L. R. G. Fontes, M. Isopi, C. M. Newman, and K.…

Preferential attachment probabilities scheme appear in the context of scale free random graphs [1],[2]. In this work we present preferential attachment probabilities scheme as a sequence of dependent Bernoulli random variables and we give…

Various new identities, recurrence relations, integral representations, connection and explicit formulas are established for the Bernoulli, Euler numbers and the values of Riemann's zeta function. To do this, we explore properties of some…

We provide a decomposition of the trace of the Brownian motion into a simple path and an independent Brownian soup of loops that intersect the simple path. More precisely, we prove that any subsequential scaling limit of the loop erased…

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…

In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…

We introduce new generalizations of the Bernoulli, Euler, and Genocchi polynomials and numbers based on the Carlitz-Tsallis degenerate exponential function and concepts of the Umbral Calculus associated with it. Also, we present…

Random walks are fundamental tools for analyzing complex networked systems, including social networks, biological systems, and communication infrastructures. While classical random walks focus on pairwise interactions, many real-world…