Related papers: A model for random braiding in graph configuration…
We study long time dynamical properties of a chain of harmonically bound Brownian particles. This chain is allowed to wander everywhere in the plane. We show that the scaling variables for the occupation times T_j, areas A_j and winding…
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
The model of Brownian Percolation has been introduced as an approximation of discrete last-passage percolation models close to the axis. It allowed to compute some explicit limits and prove fluctuation theorems for these, based on the…
We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…
We introduce and study the writhe of a permutation, a circular variant of the well-known inversion number. This simple permutation statistics has several interpretations, which lead to some interesting properties. For a permutation sampled…
A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
We study random compositions of transformations having certain uniform fiberwise properties and prove bounds which in combination with other results yield a quenched central limit theorem equipped with a convergence rate, also in the…
A theory for kinetic arrest in isotropic systems of repulsive, radially-interacting particles is presented that predicts exponents for the scaling of various macroscopic quantities near the rigidity transition that are in agreement with…
We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…
A remarkable property of quantum mechanics in two-dimensional (2D) space is its ability to support "anyons," particles that are neither fermions nor bosons. Theory predicts that these exotic excitations can be realized as bound states…
The Ising model on an infinite generic tree is defined as a thermodynamic limit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application we study the…
We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and pulling them uniformly from among sets of a given number of vertices $n$, as first established in recent work with…
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…
The natural habitat of most Bayesian methods is data represented by exchangeable sequences of observations, for which de Finetti's theorem provides the theoretical foundation. Dirichlet process clustering, Gaussian process regression, and…
We study the asymmetric exclusion process on a regular Cayley tree with arbitrary co-ordination number. In this model particles can enter the system only at the parent site and exit from one of the sites at the last level. In the bulk they…