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

We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…

In latent-position random graph models (LPMs), latent vertex positions $U_{1},\ldots,U_{n}$ are sampled from some distribution on a latent space $\Omega$, then edges of an observed graph $G = ([n],E)$ are sampled with some probability…

We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an online situation. The central aspect of our model is the…

Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We…

To mimic the complex transport-like collective phenomena in a man-made or natural system, we study an open network junction model of totally asymmetric simple exclusion process with bulk particle attachment and detachment. The stationary…

For the asymmetric simple exclusion process on the integer lattice with two-sided Bernoulli initial condition, we derive exact formulas for the following quantities: (1) the probability that site x is occupied at time t; (2) a correlation…

We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space,…

The congestion formation on a urban road network is one of the key issue for the development of a sustainable mobility in the future smart cities. In this work we propose a reductionist approach studying the stationary states of a simple…

We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…

Two-particle annihilation reaction, A+A -> inert, for immobile reactants on the Bethe lattice is solved exactly for the initially random distribution. The process reaches an absorbing state in which no nearest-neighbor reactants are left.…

Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…

Finding equitable partitions is closely related to the extraction of graph symmetries and of interest in a variety of applications context such as node role detection, cluster synchronization, consensus dynamics, and network control…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

We introduce and study a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. Start with an oriented graph $G_0$ of initially occupied edges on $n$…

We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…

We consider random-access networks where nodes represent servers with a queue and can be either active or inactive. A node deactivates at unit rate, while it activates at a rate that depends on its queue length, provided none of its…

We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability $p_{F}$ for the existence of Maker's strategy to claim a member of $F$ in the unbiased game played on…

We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We…

We consider the asymptotic normalcy of families of random variables $X$ which count the number of occupied sites in some large set. We write $Prob(X=m)=p_mz_0^m/P(z_0)$, where $P(z)$ is the generating function $P(z)=\sum_{j=0}^{N}p_jz^j$…

We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution…