Related papers: The contact process on scale-free geometric random…
We study the extreme value statistics of the zero-average Gaussian free field (GFF) on random $r$-regular graphs and the Gaussian free field on $r$-regular trees. For random $r$-regular graphs of diverging size, for every fixed $r\ge3$, we…
In this paper, we study some important statistics of the random graph in the directed preferential attachment model introduced by B. Bollob\'as, C. Borgs, J. Chayes and O. Riordan. First, we find a new asymptotic formula for the expectation…
We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…
This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…
The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
Let $X_1,X_2,...$ be an infinite sequence of i.i.d. random vectors distributed exponentially with parameter $\lam .$ For each $y$ and $n\geq 1,$ form a graph $G_n(y)$ with vertex set $V_n = \{X_1,...,X_n\},$ two vertices are connected if…
Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…
Motivated by the physics of graphene, we consider a model of N species of 2+1 dimensional four-component massless Dirac fermions interacting through a 3D instantaneous Coulomb interaction. We show that in the limit of infinitely strong…
We generalize the poissonian evolving random graph model of Bauer and Bernard to deal with arbitrary degree distributions. The motivation comes from biological networks, which are well-known to exhibit non poissonian degree distribution. A…
We suggest a new hardcore Poisson-type distribution for Young diagrams with the row lengths from some finite list. A discrete variant of the time-ordered Mat\'{e}rn II process in 1D is employed. This approach is related to that based on the…
The asymptotic shape theorem for the contact process in random environment gives the existence of a norm $\mu$ on $\Rd$ such that the hitting time $t(x)$ is asymptotically equivalent to $\mu(x)$ when the contact process survives. We provide…
In this paper we are concerned with contact processes with random edge weights on rooted regular trees. We assign i.i.d weights on each edge on the tree and assume that an infected vertex infects its healthy neighbor at rate proportional to…
This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…
We consider continuous time random interlacements on $\mathbb{Z}^d$, $d \ge 3$, and characterize the distribution of the corresponding stationary random field of occupation times. When d = 3, we relate this random field to the…
Disease spread in most biological populations requires the proximity of agents. In populations where the individuals have spatial mobility, the contact graph is generated by the "collision dynamics" of the agents, and thus the evolution of…
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…
In this paper, we introduce a novel model for random hypergraphs based on weighted random connection models. In accordance with the standard theory for hypergraphs, this model is constructed from a bipartite graph. In our stochastic model,…
We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As…
We study a new kind of proximity graphs called proportional-edge proximity catch digraphs (PCDs)in a randomized setting. PCDs are a special kind of random catch digraphs that have been developed recently and have applications in statistical…