相关论文: Phase transition for the frog model

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…

The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…

We propose a stochastic model for evolution. Births and deaths of species occur with constant probabilities. Each new species is associated with a fitness sampled from the uniform distribution on [0,1]. Every time there is a death event…

In this work we employ a simple pairing interaction model in order to study and classify an eventual pairing phase transition in finite fermionic systems. We show that systems with as few as 10-16 fermions can exhibit clear features…

We study an interacting random walk system on Z where at time 0 there is an active particle at 0 and one inactive particle on each site $n \ge 1$. Particles become active when hit by another active particle. Once activated, the particle…

We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly…

We consider random walks on several classes of graphs and explore the likely structure of the vacant set, i.e. the set of unvisited vertices. Let \Gamma(t) be the subgraph induced by the vacant set of the walk at step t. We show that for…

This paper is a step towards a systematic theory of the transitivity (clustering) phenomenon in random networks. A static framework is used, with adjacency matrix playing the role of the dynamical variable. Hence, our model is a matrix…

Phase transitions generically occur in random matrix models as the parameters in the joint probability distribution of the random variables are varied. They affect all main features of the theory and the interpretation of statistical models…

Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…

We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1…

We study circle maps with a flat interval where the critical exponents at the two boundary points of the flat spot might be different. The space of such systems is partitioned in two connected parts whose common boundary only depends on the…

We explore the cooperative behaviour and phase transitions of interacting networks by studying a simplified model consisting of Ising spins placed on the nodes of two coupled Erd\"os-R\'enyi random graphs. We derive analytical expressions…

We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of returns to original states are analyzed in resulting model.

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

We introduce and study a class of random walks on lamplighter groups $H\wr G$, where $H$ is a nontrivial finitely generated group and $G$ is an infinite finitely generated group, called \textbf{stationary random walks}. At each step, the…

We consider an interacting particle system on the one dimensional lattice $\bf Z$ modeling combustion. The process depends on two integer parameters $2\le a<M<\infty$. Particles move independently as continuous time simple symmetric random…

It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time…

Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire…

Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…