Related papers: A model for random braiding in graph configuration…
The continuous-time random walk is defined as a Poissonization of discrete-time random walk. We study the noncolliding system of continuous-time simple and symmetric random walks on ${\mathbb{Z}}$. We show that the system is determinantal…
In the Ehrenfest wind tree model, a point particle moves on the plane and collides with randomly placed fixed square obstacles under the usual law of geometric optics. The particle represents the wind and the squares are the trees. We…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
We consider a linear transport equation on the edges of a network with time-varying coefficients. Using methods for non-autonomous abstract Cauchy problems, we obtain well-posedness of the problem and describe the asymptotic profile of the…
We develop a statistical mechanics approach for random networks with uncorrelated vertices. We construct equilibrium statistical ensembles of such networks and obtain their partition functions and main characteristics. We find simple…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
In this paper we investigate the asymptotic optimality property of a randomized sampling based motion planner, namely RRT. We prove that a RRT planner is not an asymptotically optimal motion planner. Our result, while being consistent with…
In this paper, we study tree--like tableaux and some of their probabilistic properties. Tree--like tableaux are in bijection with other combinatorial structures, including permutation tableaux, and have a connection to the partially…
We study a system of $N$ noninteracting particles on a line in the presence of a harmonic trap $U(x)=\mu \bigl[x-z(t)\bigr]^2/2$, where the trap center $z(t)$ undergoes a bounded stochastic modulation. We show that this stochastic…
The goal of these lectures is to survey some of the recent progress on the description of large-scale structure of random trees. We use the framework of Markov-Branching sequences of trees and discuss several applications.
The study of random graphs and networks had an explosive development in the last couple of decades. Meanwhile, techniques for the statistical analysis of sequences of networks were less developed. In this paper we focus on networks…
Clustering is well-known to play a prominent role in the description and understanding of complex networks, and a large spectrum of tools and ideas have been introduced to this end. In particular, it has been recognized that the abundance…
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…
We study a directed polymer model in a random environment on infinite binary trees. The model is characterized by a phase transition depending on the inverse temperature. We concentrate on the asymptotics of the partition function in the…
Randomly branching polymers with {\em annealed} connectivity are model systems for ring polymers and chromosomes. In this context, the branched structure represents transient folding induced by topological constraints. Here we present…
We examine the structure of winding toroidal and open cylindrical membranes, especially in cases where they are stretched between boundaries. Non-zero winding or stretching means that there are linear terms in the mode expansion of the…
We study the partition functions associated with non-intersecting polymers in a random environment. By considering paths in series and in parallel, the partition functions carry natural notions of subadditivity, allowing the effective study…
We consider a finite range symmetric exclusion process on the integer lattice in any dimension. We interpret it as a non-elliptic time-dependent random conductance model by setting conductances equal to one over the edges with end points…
We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a…