Related papers: Scaling limit for a drainage network model
The Gaussian parallel relay network, in which two parallel relays assist a source to convey information to a destination, was introduced by Schein and Gallager. An upper bound on the capacity can be obtained by considering broadcast cut…
We study a scaling limit associated to a model of planar aggregation. The model is obtained by composing certain independent random conformal maps. The evolution of harmonic measure on the boundary of the cluster is shown to converge to the…
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In large networks where exact probabilistic inference is…
We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…
We consider the Renyi entropies S_n in one-dimensional massive integrable models diagonalizable by means of corner transfer matrices (as Heisenberg and Ising spin chains). By means of explicit examples and using the relation of corner…
Network rearrangement operations like SNPR (SubNet Prune and Regraft), a recent generalisation of rSPR (rooted Subtree Prune and Regraft), induce a metric on phylogenetic networks. To search the space of these networks one important…
We prove that, after suitable rescaling, the simple random walk on the trace of a large critical branching random walk converges to the Brownian motion on the integrated super-Brownian excursion.
In this paper we study coordinated multipath routing at the flow-level in networks with routes of length one. As a first step the static case is considered, in which the number of flows is fixed. A clustering pattern in the rate allocation…
Here we give further evidences to support our scaling relation described in our previous paper [cond-mat/0006459, Phys. Rev. Lett. Vol.85, pp.1238 (2000)].
We present a detailed analysis of the Connecting Nearest Neighbors (CNN) model by V\'azquez. We show that the degree distribution follows a power law, but the scaling exponent can vary with the parameter setting. Moreover, the…
Film flow through networks of corners and capillary bridges can establish connections between seemingly isolated clusters during drainage in porous media. Coupled with drainage through the bulk of pores and throats, the flow through these…
We establish the scaling limit of a class of boundary random walks to the full spectrum of Brownian-type processes on the half-line. By solving the associated martingale problem and employing weak convergence techniques, we prove that under…
The degree distributions of many real world networks follow power-laws whose exponents tend to fall between two and three. Within the framework of the Barabasi-Albert model (BA model), we explain this empirical observation by a simple fact.…
A new diffuse interface model for a two-phase flow of two incompressible fluids with different densities is introduced using methods from rational continuum mechanics. The model fulfills local and global dissipation inequalities and is also…
In this paper we consider the idea of I - convergence of nets of partial function from a metric space (X; d) to a metric space (Y; ?) and derive several basic characterization. This idea extends the concept of convergence of nets of partial…
Capturing the dynamics of granular flows at intermediate length scales can often be difficult. We propose studying the dynamics of contact networks as a new tool to study fracture at intermediate scales. Using experimental three-dimensional…
The Brownian web (BW), which developed from the work of Arratia and then T\'{o}th and Werner, is a random collection of paths (with specified starting points) in one plus one dimensional space-time that arises as the scaling limit of the…
We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…
In this brief report, we present a disordered version of recursive networks. Depending on the structural parameters $u$ and $v$, the networks are either fractals with a finite fractal dimension $d_{f}$ or transfinite fractals (transfractal)…
Many real-world complex networks simultaneously exhibit topological features of scale-free behaviour and hierarchical organization. In this regard, deterministic scale-free [A.-L. Barab\'asi \etal, Physica A, 299, 3 (2001)] and…