Related papers: The Random Transposition Dynamics on Random Regula…
Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with…
We introduce a model of a randomly growing interface in multidimensional Euclidean space. The growth model incorporates a random order model as an ingredient of its graphical construction, in a way that replicates the connection between the…
We study here a standard next-nearest-neighbor (NNN) model of ballistic growth on one- and two-dimensional substrates focusing our analysis on the probability distribution function $P(M,L)$ of the number $M$ of maximal points (i.e., local…
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 gradient flow is the evolution of fields and physical quantities along a dimensionful parameter~$t$, the flow time. We give a simple argument that relates this gradient flow and the Wilsonian renormalization group (RG) flow. We then…
We consider a set of one-dimensional transformations of Gaussian random functions. Under natural assumptions we obtain a connection between $L_2$-small ball asymptotics of the transformed function and of the original one. Also the explicit…
This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected…
The dimension of random simplicial complexes (defined as the maximal dimension among all faces) is a natural extreme value associated with the complex, and is closely related to other functionals defined by a maximum, such as the clique…
We study the length of cycles of random permutations drawn from the Mallows distribution. Under this distribution, the probability of a permutation $\pi \in \mathbb{S}_n$ is proportional to $q^{\textrm{inv}(\pi)}$ where $0<q\le 1$ and…
For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…
We consider the hyperuniform model of d-dimensional integer lattice perturbed by independent random variables and we investigate the large scale asymptotic fluctuations of smoothed versions of the usual counting statistics, specifically of…
Given a symmetric $n\times n$ matrix $P$ with $0 \le P(u, v)\le 1$, we define a random graph $G_{n, P}$ on $[n]$ by independently including any edge $\{u, v\}$ with probability $P(u, v)$. For $k\ge 1$ let $\mathcal{A}_k$ be the property of…
We study the weighted version of the interchange process where a permutation receives weight $\theta^{\#\mathrm{cycles}}$. For $\theta=2$ this is T\'oth's representation of the quantum Heisenberg ferromagnet on the complete graph. We prove,…
We consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…
The Assouad dimension of a metric space determines its extremal scaling properties. The derived notion of the Assouad spectrum fixes relative scales by a scaling function to obtain interpolation behaviour between the quasi-Assouad and…
In the study of complex networks (systems), the scaling phenomenon of flow fluctuations refers to a certain power-law between the mean flux (activity) $<F_i>$ of the $i$th node and its variance $\sigma_i$ as $\sigma_i \propto < F_{i} >…
We find in measurements of microwave transmission through quasi-1D dielectric samples for both diffusive and localized waves that the field normalized by the square root of the spatially averaged flux in a given sample configuration is a…
We define a Markov process on the set of countable graphs with spins. Transitions are local substitutions in the graph. It is proved that the scaling macrodimension is an invariant of such dynamics.