Related papers: Random interlacements and amenability
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
We consider the random interlacements process with intensity $u$ on ${\mathbb Z}^d$, $d\ge 5$ (call it $I^u$), built from a Poisson point process on the space of doubly infinite nearest neighbor trajectories on ${\mathbb Z}^d$. For $k\ge 3$…
Benjamini, Shinkar, and Tsur stated the following conjecture on the acquaintance time: asymptotically almost surely $AC(G) \le p^{-1} \log^{O(1)} n$ for a random graph $G \in G(n,p)$, provided that $G$ is connected. Recently, Kinnersley,…
We consider the model of Branching Interlacements, introduced by Zhu, which is a natural analogue of Sznitman's Random Interlacements model, where the random walk trajectories are replaced by ranges of some suitable tree-indexed random…
Modularity was introduced by Newman and Girvan in 2004 and is used as a measure of community structure of networks represented by graphs. In our work we study modularity of the random intersection graph model first considered by Karo\'nski,…
In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
In 1999, Benjamini, Lyons, Peres, and Schramm introduced a notion of weighted-amenability for transitive graphs that is equivalent to the amenability of its automorphism group. For unimodular graphs this notion coincides with classical…
The (maximum receiver-centric) interference of a geometric graph (von Rickenbach etal (2005)) is studied. It is shown that, with high probability, the following results hold for a set, V, of n points independently and uniformly distributed…
We give necessary and sufficient conditions for lobe-transitivity of locally finite and locally countable graphs whose connectivity equals 1. We show further that, given any biconnected graph $\Lambda$ and a "code" assigned to each orbit of…
Bilateral agreement based random undirected graphs were introduced and analyzed by La and Kabkab in 2015. The construction of the graph with $n$ vertices in this model uses a (random) preference order on other $n-1$ vertices and each vertex…
We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
In this article we investigate the percolative properties of Brownian interlacements, a model introduced by Alain-Sol Sznitman in arXiv:1209.4531, and show that: the interlacement set is "well-connected", i.e., any two "sausages" in…
We give a sufficient condition for the existence of the harmonic measure from infinity of transient random walks on weighted graphs. In particular, this condition is verified by the random conductance model on $\Z^d$, $d\geq 3$, when the…
A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…
We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…