Related papers: Phase transition for tree-rooted maps
Our goal is to visualize an additional data dimension of a tree with multifaceted data through superimposition on vertical strips, which we call columns. Specifically, we extend upward drawings of unordered rooted trees where vertices have…
We study the long-time, large scale transport in a three-parameter family of isotropic, incompressible velocity fields with power-law spectra. Scaling law for transport is characterized by the scaling exponent $q$ and the Hurst exponent…
The $\lambda$-biased random walk on a binary tree of depth $n$ is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to…
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
The "critical brain hypothesis" posits that neural circuitry may be tuned close to a "critical point" or "phase transition" -- a boundary between different operating regimes of the circuit. The renormalization group and theory of critical…
We introduce a self-organized model of graph evolution associated with preferential network random walkers. The idea is developed by using two different types of walkers, the interactions of which lead to a dynamic graph. The walkers of the…
The finite-size scaling theory for continuous phase transition plays an important role in determining critical point and critical exponents from the size-dependent behaviors of quantities in the thermodynamic limit. For percolation phase…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…
The size of the largest common subtree (maximum agreement subtree) of two independent uniform random binary trees on $n$ leaves is known to be between orders $n^{1/8}$ and $n^{1/2}$. By a construction based on recursive splitting and…
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…
We consider a family of growth models defined using conformal maps in which the local growth rate is determined by $|\Phi_n'|^{-\eta}$, where $\Phi_n$ is the aggregate map for $n$ particles. We establish a scaling limit result in which…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
To understand mesoscopic scaling in networks, we study the hierarchical configuration model (HCM), a random graph model with community structure. The connections between the communities are formed as in a configuration model. We study the…
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…
Let $\left\{ Z_{n},n=0,1,2,...\right\} $ be a critical branching process in i.i.d. random environment, $Z_{r,n}$ be the number of particles in the process at moment $0\leq r\leq n-1$ that have a positive number of descendants in generation…
We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\Theta(\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition…
First order quantum phase transitions (1QPTs) are signaled, in the thermodynamic limit, by discontinuous changes in the ground state properties. These discontinuities affect expectation values of observables, including spatial correlations.…
We present an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n^{1.5} log n) time for trees with unbounded degrees, matching the best known time complexity for the rooted case. Our…