Related papers: A limit theorem for diffusions on graphs with vari…
We consider graphs with vertices of degree 1 or 2 and prove that the numbers of components of sizes 2 to q have a limit normal distribution for any q > 1. The result is also extended to multigraphs.
We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…
Building on the limit theory for set functions, we prove that the limit of convergent sequence of bounded-degree graphs' cycle matroids can be represented as the cycle matroid of a graphing, analogous to the completeness result for…
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…
In a multiplex network, a set of nodes is connected by different types of interactions, each represented as a separate layer within the network. Multiplexes have emerged as a key instrument for modeling large-scale complex systems, due to…
A multi-type branching process is defined as a random tree with labeled vertices, where each vertex produces offspring independently according to the same multivariate probability distribution. We demonstrate that in realizations of the…
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes…
In this paper we establish a diffusion limit for a multivariate continuous time Markov chain whose components are indexed by vertices of a finite graph. The components take values in a common finite set of non-negative integers and evolve…
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
We provide an asymptotic analysis of linear transport problems in the diffusion limit under minimal regularity assumptions on the domain, the coefficients, and the data. The weak form of the limit equation is derived and the convergence of…
Using techniques of the theory of semigroups of linear operators we study the question of approximating solutions to equations governing diffusion in thin layers separated by a semi-permeable membrane. We show that as thickness of the…
A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. A function is a pebbling threshold for a sequence of graphs if a randomly chosen…
We consider the dynamics on a quantum graph as the limit of the dynamics generated by a one-particle Hamiltonian in R^2 with a potential having a deep strict minimum on the graph, when the width of the well shrinks to zero. For a generic…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
We study how far a diffusion process on a graph can deviate from a designed starting pattern when the pattern is generated via Laplacian regularisation. Under standard stability conditions for undirected, entrywise nonnegative graphs, we…
We introduce a class of partial differential equations on metric graphs associated with mixed evolution: on some edges we consider diffusion processes, on other ones transport phenomena. This yields a system of equations with possibly…
In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…
A finite-time fluctuation theorem is proved for the diffusion-influenced surface reaction A<->B in a domain with any geometry where the species A and B undergo diffusive transport between the reservoir and the catalytic surface. A…
We study a variant of the chip-firing game called \emph{diffusion}. In diffusion on a graph, each vertex of the graph is initially labelled with an integer interpreted as the number of chips at that vertex, and at each subsequent step, each…
We prove an averaging principle which asserts convergence of diffusion processes on domains separated by semi-permeable membranes, when diffusion coefficients tend to infinity while the flux through the membranes remains constant. In the…