相关论文: Exact and approximate results for deposition and a…

We consider the discrete-time threshold-$\theta \ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least \theta occupied neighbors at time t will be occupied at time t+1 with probability p,…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

We say that a graph $G=(V,E)$ on $n$ vertices is a $\beta$-expander for some constant $\beta>0$ if every $U\subseteq V$ of cardinality $|U|\leq \frac{n}{2}$ satisfies $|N_G(U)|\geq \beta|U|$ where $N_G(U)$ denotes the neighborhood of $U$.…

We couple projective limits of probability measures to direct limits of their symmetry groups. We show that the direct limit group is the group of symmetries of the projective limit probability measure. If projective systems of probability…

We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…

The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then…

We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…

We consider a particle diffusing along the links of a general graph possessing some absorbing vertices. The particle, with a spatially-dependent diffusion constant D(x) is subjected to a drift U(x) that is defined in every point of each…

Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…

In this work we provide a new technique to design fast approximation algorithms for graph problems where the points of the graph lie in a metric space. Specifically, we present a sampling approach for such metric graphs that, using a…

We model the kinetics of ligand-receptor systems, where multiple ligands may bind and unbind to the receptor, either randomly or in a specific order. Equilibrium occupation and first occurrence of complete filling of the receptor are…

We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…

We investigate Random Sequential Adsorption (RSA) on a random graph via the following greedy algorithm: Order the $n$ vertices at random, and sequentially declare each vertex either active or frozen, depending on some local rule in terms of…

Random graph models are playing an increasingly important role in various fields ranging from social networks, telecommunication systems, to physiologic and biological networks. Within this landscape, the random Kronecker graph model,…

We present linear time {\it in-place} algorithms for several basic and fundamental graph problems including the well-known graph search methods (like depth-first search, breadth-first search, maximum cardinality search), connectivity…

Local complement is a graph operation formalized by Bouchet which replaces the neighborhood of a chosen vertex with its edge-complement. This operation induces an equivalence relation on graphs; determining the size of the resulting…

We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…

There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…

We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs (or graphlets) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolation process with a carefully chosen rejection filter and…

We extend the latent position random graph model to the line graph of a random graph, which is formed by creating a vertex for each edge in the original random graph, and connecting each pair of edges incident to a common vertex in the…