相关论文: Interacting Particle Systems in Complex Networks

Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously…

In this paper we show that a variety of interacting particle systems with multiple species can be viewed as random walks on Hecke algebras. This class of systems includes the asymmetric simple exclusion process (ASEP), M-exclusion TASEP,…

Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…

We study stochastic particle systems made up of heterogeneous units. We introduce a general framework suitable to analytically study this kind of systems and apply it to two particular models of interest in economy and epidemiology. We show…

Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…

Nanochains of atoms, molecules and polymers have gained recent interest in the experimental sciences. This article contributes to an advanced mathematical modeling of the mechanical properties of nanochains that allow for heterogenities,…

We study expanding circle maps interacting in a heterogeneous random network. Heterogeneity means that some nodes in the network are massively connected, while the remaining nodes are only poorly connected. We provide a probabilistic…

In this paper we study the dynamics of nonlinear random walks. While typical random walks on networks consist of standard Markov chains whose static transition probabilities dictate the flow of random walkers through the network, nonlinear…

Random walks on networks are widely used to model stochastic processes such as search strategies, transportation problems or disease propagation. A prominent example of such process is the guiding of naive T cells by the lymph node conduits…

We introduce a model of interacting Random Walk, whose hopping amplitude depends on the number of walkers/particles on the link. The mesoscopic counterpart of such a microscopic dynamics is a diffusing system whose diffusivity depends on…

Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…

On infinite homogeneous structures, two random walkers meet with certainty if and only if the structure is recurrent, i.e., a single random walker returns to its starting point with probability 1. However, on general inhomogeneous…

In the study of dynamical processes on networks, there has been intense focus on network structure -- i.e., the arrangement of edges and their associated weights -- but the effects of the temporal patterns of edges remains poorly…

We consider a non-homogeneous random walks system on $\bbZ$ in which each active particle performs a nearest neighbor random walk and activates all inactive particles it encounters up to a total amount of $L$ jumps. We present necessary and…

We study N interacting random walks on the positive integers. Each particle has drift {\delta} towards infinity, a reflection at the origin, and a drift towards particles with lower positions. This inhomogeneous mean field system is shown…

In the last twenty years network science has proven its strength in modelling many real-world interacting systems as generic agents, the nodes, connected by pairwise edges. Yet, in many relevant cases, interactions are not pairwise but…

In complex systems, the interplay between nonlinear and stochastic dynamics, e.g., J. Monod's necessity and chance, gives rise to an evolutionary process in Darwinian sense, in terms of discrete jumps among attractors, with punctuated…

We consider weakly interacting diffusions on time varying random graphs. The system consists of a large number of nodes in which the state of each node is governed by a diffusion process that is influenced by the neighboring nodes. The…

Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based…

The horizontal dynamics of a bouncing ball interacting with an irregular surface is investigated and is found to demonstrate behavior analogous to a random walk. Its stochastic character is substantiated by the calculation of a permutation…