Related papers: Average transmission probability of a random stack
Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…
We calculate crossing probabilities and one-sided last exit time densities for a class of moving barriers on an interval $[0,T]$ via Schwartz distributions. We derive crossing probabilities and first hitting time densities for another class…
How big is the risk that a few initial failures of networked nodes amplify to large cascades that endanger the functioning of the system? Common answers refer to the average final cascade size. Two analytic approaches allow its computation:…
Combs are a simple caricature of various types of natural branched structures, which belong to the category of loopless graphs and consist of a backbone and branches. We study continuous time random walks on combs and present a generic…
The phenomenology of turbulent relative dispersion is revisited. A heuristic scenario is proposed, in which pairs of tracers undergo a succession of independent ballistic separations during time intervals whose lengths fluctuate. This…
We present the analytical and numerical results of a random walk on the family of small-world graphs. The average access time shows a crossover from the regular to random behavior with increasing distance from the starting point of the…
The problem of link prediction has attracted considerable recent attention from various domains such as sociology, anthropology, information science, and computer sciences. A link prediction algorithm is proposed based on link similarity…
In applied probability, the normal approximation is often used for the distribution of data with assumed additive structure. This tradition is based on the central limit theorem for sums of (independent) random variables. However, it is…
To model a complex system intrinsically separated by a barrier, we use two random Hamiltonians, coupled to each other either by a tunneling matrix element or by an intermediate transition state. We study that model in the universal limit of…
We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol…
A model for diffusion on a cubic lattice with a random distribution of traps is developed. The traps are redistributed at certain time intervals. Such models are useful for describing systems showing dynamic disorder, such as ion-conducting…
We consider the average number B_m(t) of bonds traversed exactly m times by a t step simple random walk. We determine B_m(t) explicitly in the scaling limit t -> oo with m/sqrt(t) fixed in dimension d=1 and m/log(t) fixed in dimension d=2.…
We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…
We develop an advanced mean field method for approximating averages in probabilistic data models that is based on the TAP approach of disorder physics. In contrast to conventional TAP, where the knowledge of the distribution of couplings…
We study the transmission of random walkers through a finite-size inhomogeneous material with a quenched, long-range correlated distribution of scatterers. We focus on a finite one-dimensional structure where walkers undergo random…
We study spreading on networks where the contact dynamics between the nodes is governed by a random process and where the inter-contact time distribution may differ from the exponential. We consider a process of imperfect spreading, where…
Scattering from a compound barrier, one composed of a number of distinct non-overlapping sub-barriers, has a number of interesting and subtle mathematical features. If one is scattering classical particles, where the wave aspects of the…
The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…