NSTL国家科技图书文献中心

1. Efficient Random Walks on Riemannian Manifolds NSTL国家科技图书文献中心

Schwarz, Simon | Herrmann, Michael ... - 《Foundations of computational mathematics》 - 2025,25(1) - 145～161 - 共17页

摘要：, geodesic random* walks on Riemannian manifolds converge to* | random walks based on the concept of retractions. We | show that these approximate walks* converge in* | According to a version of Donsker's theorem | the respective Brownian motion. From a computational

关键词： Brownian motion | Riemannian manifolds | Retractions | Geodesic random walks

2. Branching random walks and Minkowski sum of random walks NSTL国家科技图书文献中心

Asselah, Amine | Okada, Izumi ... - 《Probability Theory and Related Fields》 - 2025,191(3/4) - 1289～1322 - 共34页

摘要： random walk conditioned to survive forever and the | Minkowski sum of two independent simple random* walk ranges* | independent simple random* walk ranges in Zddocumentclass* | We show that the range of a critical branching | are intersection-equivalent in any dimension d

关键词： Capacity | Range of random walk | Branching random walk | Branching capacity | Intersection probability

3. A Strong Large Deviation Principle for the Empirical Measure of Random Walks NSTL国家科技图书文献中心

Erhard, Dirk | Franco, Tertuliano ... - 《Journal of Statistical Physics》 - 2025,192(6) - 共22页

摘要： measure of certain continuous time random walks | simple random* walk and complements the results obtained* | In this article we show that the empirical | satisfies a strong large deviation principle with respect | to a topology introduced in [15] by Mukherjee and

关键词： Large deviations | Empirical measures | Random walks

4. Sylvester's problem for random walks and bridges NSTL国家科技图书文献中心

Panzo, Hugo - 《Statistics & Probability Letters》 - 2025,219 - 共5页

摘要： problem for these random* walks by showing that the* | Consider a random* walk in Rdthat starts at the* | analogous result also holds for random* bridges of length* | origin and whose increment distribution assigns zero | probability to any affine hyperplane. We solve Sylvester's

关键词： Convex hull | Random bridge | Random walk | Sylvester's problem

5. Adaptive Temporal Random Walks for Graph Representation NSTL国家科技图书文献中心

Monachary Kammari | S. Durga Bhavani - 《Big Data and Artificial Intelligence》 - International Conference on Big Data and Artificial Intelligence - 2025, - 75～91 - 共17页

摘要： defining an adaptive temporal random* walk that extracts* | In recent times, Graph Representation Learning | (GRL) has become popular due to the advancements in | Deep Learning (DL) and Machine Learning (ML | ) algorithms. Most real-world networks are dynamic in nature

关键词： Random walks | Node2Vec | Temporal aspects | Graph representation learning | Link prediction | Citation recommendation

6. Cramér type moderate deviation for random walks conditioned to stay positive NSTL国家科技图书文献中心

Sun, Mingyang - 《Statistics & Probability Letters》 - 2025,216 - 共8页

摘要： deviation for random* walks conditioned to stay positive* | random walks and Brownian motion in the same vein as | We establish a Cram & eacute;r type moderate | , which gives the relative error for the central limit | theorem proved by Iglehart (1974). Unlike the

关键词： Random walks | Cram & eacute;r moderate deviation | Strong approximation

7. Transience of continuous-time conservative random walks NSTL国家科技图书文献中心

Bhattacharya, Satyak... | Volkov, Stanislav - 《Journal of Applied Probability》 - 2025,62(1) - 153～171 - 共19页

摘要： generalizations of conservative random* walks introduced in* | as random* flights. For both models, we show the* | transience of the walks* when d >= 2 and that the rate of* | We consider two continuous-time | Englander and Volkov (2022), an orthogonal and a

关键词： Random flight | non-time-homogeneous Markov chain | conservative random walk | transience | recurrence

8. Mixing Cutoff for Simple Random Walks on the Chung-Lu Digraph NSTL国家科技图书文献中心

Bianchi, Alessandra | Passuello, Giacomo - 《Random structures & algorithms》 - 2025,66(1) - n/a～n/a - 共20页

摘要： mixing behavior of simple random* walks on inhomogeneous* | In this article, we are interested in the | directed graphs. We focus our study on Chung-Lu digraphs | , which are inhomogeneous networks that generalize Erd | & ouml;s-R & eacute;nyi digraphs, and where edges are

关键词： Chung–Lu model random walks | cutoff | mixing time | random directed graphs | Chung-Lu model random walks

9. Random walks on groups and superlinear-divergent geodesics NSTL国家科技图书文献中心

Chawla, Kunal | Choi, Inhyeok ... - 《Ergodic Theory and Dynamical Systems》 - 2025,45(Pt.5) - 1403～1443 - 共41页

摘要：In this paper, we study random* walks on groups* | for random* walks on these groups.* | that contain superlinear-divergentgeodesics, in the | line of thoughts of Goldsborough and Sisto. The | existence of asuperlinear-divergent geodesic is a quasi

关键词： random walk | quasi-isometries | divergence | central limit theorem

10. On Decoupled Standard Random Walks NSTL国家科技图书文献中心

Alsmeyer, Gerold | Iksanov, Alexander ... - 《Journal of theoretical probability》 - 2025,38(1) - 共34页

摘要： of N, be a standard random* walk with i.i.d* | sequence (sic)S-1, (sic)S-2, ... of independent random | Let S-n = Sigma(n)(k=1) xi(k), n is an element | . nonnegative increments xi(1), xi(2), ... and associated | renewal counting process N(t) = Sigma(n >= 1) 1({Sn <= t

关键词： Decoupled renewal process | Functional limit theorem | Large deviation | Renewal theory | Stationary Gaussian process | Strong law of large numbers | Tail behavior

摘要：, geodesic random walks on Riemannian manifolds converge to | random walks based on the concept of retractions. We | show that these approximate walks converge in | According to a version of Donsker's theorem | the respective Brownian motion. From a computational

关键词： Brownian motion | Riemannian manifolds | Retractions | Geodesic random walks

摘要： random walk conditioned to survive forever and the | Minkowski sum of two independent simple random walk ranges | independent simple random walk ranges in Zddocumentclass | We show that the range of a critical branching | are intersection-equivalent in any dimension d

关键词： Capacity | Range of random walk | Branching random walk | Branching capacity | Intersection probability

摘要： measure of certain continuous time random walks | simple random walk and complements the results obtained | In this article we show that the empirical | satisfies a strong large deviation principle with respect | to a topology introduced in [15] by Mukherjee and

关键词： Large deviations | Empirical measures | Random walks

摘要： problem for these random walks by showing that the | Consider a random walk in Rdthat starts at the | analogous result also holds for random bridges of length | origin and whose increment distribution assigns zero | probability to any affine hyperplane. We solve Sylvester's

关键词： Convex hull | Random bridge | Random walk | Sylvester's problem

摘要： defining an adaptive temporal random walk that extracts | In recent times, Graph Representation Learning | (GRL) has become popular due to the advancements in | Deep Learning (DL) and Machine Learning (ML | ) algorithms. Most real-world networks are dynamic in nature

关键词： Random walks | Node2Vec | Temporal aspects | Graph representation learning | Link prediction | Citation recommendation

摘要： deviation for random walks conditioned to stay positive | random walks and Brownian motion in the same vein as | We establish a Cram & eacute;r type moderate | , which gives the relative error for the central limit | theorem proved by Iglehart (1974). Unlike the

关键词： Random walks | Cram & eacute;r moderate deviation | Strong approximation

摘要： generalizations of conservative random walks introduced in | as random flights. For both models, we show the | transience of the walks when d >= 2 and that the rate of | We consider two continuous-time | Englander and Volkov (2022), an orthogonal and a

关键词： Random flight | non-time-homogeneous Markov chain | conservative random walk | transience | recurrence

摘要： mixing behavior of simple random walks on inhomogeneous | In this article, we are interested in the | directed graphs. We focus our study on Chung-Lu digraphs | , which are inhomogeneous networks that generalize Erd | & ouml;s-R & eacute;nyi digraphs, and where edges are

关键词： Chung–Lu model random walks | cutoff | mixing time | random directed graphs | Chung-Lu model random walks

摘要：In this paper, we study random walks on groups | for random walks on these groups. | that contain superlinear-divergentgeodesics, in the | line of thoughts of Goldsborough and Sisto. The | existence of asuperlinear-divergent geodesic is a quasi

关键词： random walk | quasi-isometries | divergence | central limit theorem

摘要： of N, be a standard random walk with i.i.d | sequence (sic)S-1, (sic)S-2, ... of independent random | Let S-n = Sigma(n)(k=1) xi(k), n is an element | . nonnegative increments xi(1), xi(2), ... and associated | renewal counting process N(t) = Sigma(n >= 1) 1({Sn <= t

关键词： Decoupled renewal process | Functional limit theorem | Large deviation | Renewal theory | Stationary Gaussian process | Strong law of large numbers | Tail behavior

4008-161-200 800-990-8900

国家科技图书文献中心

摘要：, geodesic random* walks on Riemannian manifolds converge to* | random walks based on the concept of retractions. We | show that these approximate walks* converge in* | According to a version of Donsker's theorem | the respective Brownian motion. From a computational

摘要： random walk conditioned to survive forever and the | Minkowski sum of two independent simple random* walk ranges* | independent simple random* walk ranges in Zddocumentclass* | We show that the range of a critical branching | are intersection-equivalent in any dimension d

摘要： measure of certain continuous time random walks | simple random* walk and complements the results obtained* | In this article we show that the empirical | satisfies a strong large deviation principle with respect | to a topology introduced in [15] by Mukherjee and

摘要： problem for these random* walks by showing that the* | Consider a random* walk in Rdthat starts at the* | analogous result also holds for random* bridges of length* | origin and whose increment distribution assigns zero | probability to any affine hyperplane. We solve Sylvester's

摘要： defining an adaptive temporal random* walk that extracts* | In recent times, Graph Representation Learning | (GRL) has become popular due to the advancements in | Deep Learning (DL) and Machine Learning (ML | ) algorithms. Most real-world networks are dynamic in nature

摘要： deviation for random* walks conditioned to stay positive* | random walks and Brownian motion in the same vein as | We establish a Cram & eacute;r type moderate | , which gives the relative error for the central limit | theorem proved by Iglehart (1974). Unlike the

摘要： generalizations of conservative random* walks introduced in* | as random* flights. For both models, we show the* | transience of the walks* when d >= 2 and that the rate of* | We consider two continuous-time | Englander and Volkov (2022), an orthogonal and a

摘要： mixing behavior of simple random* walks on inhomogeneous* | In this article, we are interested in the | directed graphs. We focus our study on Chung-Lu digraphs | , which are inhomogeneous networks that generalize Erd | & ouml;s-R & eacute;nyi digraphs, and where edges are

摘要：In this paper, we study random* walks on groups* | for random* walks on these groups.* | that contain superlinear-divergentgeodesics, in the | line of thoughts of Goldsborough and Sisto. The | existence of asuperlinear-divergent geodesic is a quasi

摘要： of N, be a standard random* walk with i.i.d* | sequence (sic)S-1, (sic)S-2, ... of independent random | Let S-n = Sigma(n)(k=1) xi(k), n is an element | . nonnegative increments xi(1), xi(2), ... and associated | renewal counting process N(t) = Sigma(n >= 1) 1({Sn <= t