English
Related papers

Related papers: Superdiffusion on complex networks: the role of sh…

200 papers

The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…

Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…

Disordered Systems and Neural Networks · Physics 2009-10-28 Tomaso Aste

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

Probability · Mathematics 2018-11-20 Julien Brémont

We investigate the problem of disseminating broadcast messages in wireless networks with time-varying links from a percolation-based perspective. Using a model of wireless networks based on random geometric graphs with dynamic on-off links,…

Information Theory · Computer Science 2009-02-26 Zhenning Kong , Edmund M. Yeh

The irreducible decomposition of successive restriction and induction of irreducible representations of a symmetric group gives rise to a Markov chain on Young diagrams keeping the Plancherel measure invariant. Starting from this Res-Ind…

Probability · Mathematics 2019-06-25 Akihito Hora

Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…

Quantum Physics · Physics 2023-06-07 Rostislav Duda , Moein N. Ivaki , Isac Sahlberg , Kim Pöyhönen , Teemu Ojanen

We consider a class of discrete-time random walks with directed unit steps on the integer line. The direction of the steps is reversed at the time instants of events in a discrete-time renewal process and is maintained at uneventful time…

Probability · Mathematics 2023-01-04 Thomas M. Michelitsch , Federico Polito , Alejandro P. Riascos

Although higher-order interactions are known to affect the typical state of dynamical processes giving rise to new collective behavior, how they drive the emergence of rare events and fluctuations is still an open problem. We investigate…

Disordered Systems and Neural Networks · Physics 2024-09-09 Leonardo Di Gaetano , Giorgio Carugno , Federico Battiston , Francesco Coghi

Synchronization across long neural distances is a functionally important phenomenon. In order to access the mechanistic basis of long-range synchrony, we constructed an experimental model that enables monitoring of spiking activities over…

Neurons and Cognition · Quantitative Biology 2018-02-23 Hanna Keren , Shimon Marom

Random network models play a prominent role in modeling, analyzing and understanding complex phenomena on real-life networks. However, a key property of networks is often neglected: many real-world networks exhibit spatial structure, the…

Quantitative Methods · Quantitative Biology 2017-02-07 John Lang , Hans De Sterck , Jamieson L. Kaiser , Joel C. Miller

Transport of rodlike particles in confinement environments of macromolecular networks plays crucial roles in many important biological processes and technological applications. The relevant understanding has been limited to thin rods with…

Transport of tracer particles through mesh-like environments such as biological hydrogels and polymer matrices is ubiquitous in nature. These tracers could be passive, such as colloids or active (self-propelled), such as synthetic…

Soft Condensed Matter · Physics 2022-12-08 Praveen Kumar , Rajarshi Chakrabarti

In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We…

Probability · Mathematics 2016-11-08 Christoph Reisinger

We focus on the problem of performing random walks efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain a random walk sample. We first present a fast sublinear…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-03-03 Atish Das Sarma , Danupon Nanongkai , Gopal Pandurangan , Prasad Tetali

Subdiffusive motion of tracer particles in complex crowded environments, such as biological cells, has been shown to be widepsread. This deviation from brownian motion is usually characterized by a sublinear time dependence of the mean…

Statistical Mechanics · Physics 2009-11-13 S. Condamin , V. Tejedor , R. Voituriez , O. Benichou , J. Klafter

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

Probability · Mathematics 2020-06-19 Leran Cai , Thomas Sauerwald , Luca Zanetti

The way in which different types of dynamics unfold in complex networks is intrinsically related to the propagation of activation along nodes, which is strongly affected by the network connectivity. In this work we investigate to which…

Physics and Society · Physics 2008-11-25 Luciano da Fontoura Costa

Anomalous diffusion processes, in particular superdiffusive ones, are known to be efficient strategies for searching and navigation by animals and also in human mobility. One way to create such regimes are L\'evy flights, where the walkers…

Physics and Society · Physics 2017-02-22 Sarah de Nigris , Timoteo Carletti , Renaud Lambiotte

Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we focus on the problem of sampling random walks efficiently in a…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-02-20 Atish Das Sarma , Danupon Nanongkai , Gopal Pandurangan , Prasad Tetali

This paper considers the optimal scaling problem for high-dimensional random walk Metropolis algorithms for densities which are differentiable in Lp mean but which may be irregular at some points (like the Laplace density for example)…

Probability · Mathematics 2016-04-25 Alain Durmus , Sylvain Le Corff , Eric Moulines , Gareth O. Roberts
‹ Prev 1 3 4 5 6 7 10 Next ›