Related papers: Macroscopic loops in the random loop model on spar…
We study the existence of densities for distributions of piecewise deterministic Markov processes. We also obtain relationships between invariant densities of the continuous time process and that of the process observed at jump times. In…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \emph{patchworks} to describe the possible…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
Determining the crossing numbers of Cartesian products of small graphs with arbitrarily large paths has been an ongoing topic of research since the 1970s. Doing so requires the establishment of coincident upper and lower bounds; the former…
Networks observed in the real world often have many short loops. This violates the tree-like assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible…
Let $V$ be a set of $n$ vertices, ${\cal M}$ a set of $m$ labels, and let $\mathbf{R}$ be an $m \times n$ matrix of independent Bernoulli random variables with success probability $p$. A random instance $G(V,E,\mathbf{R}^T\mathbf{R})$ of…
For any graph consisting of $k$ vertices and $m$ edges we construct an ensemble of random pure quantum states which describe a system composed of $2m$ subsystems. Each edge of the graph represents a bi-partite, maximally entangled state.…
Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years,…
We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…
We are going to analyze local algorithms over sparse random graphs. These algorithms are based on local information where local regards to a decision made by the exploration of a small neighbourhood of a certain vertex plus a believe of the…
We consider a general interacting particle system with interactions on a random graph, and study the large population limit of this system. When the sequence of underlying graphs converges to a graphon, we show convergence of the…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
In this paper, we study "robust" dominating sets of random graphs that retain the domination property even if a small \emph{deterministic} set of edges are removed. We motivate our study by illustrating with examples from wireless networks…
We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…
Recent work has introduced sparse exchangeable graphs and the associated graphex framework, as a generalization of dense exchangeable graphs and the associated graphon framework. The development of this subject involves the interplay…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…