Related papers: Asymptotic behaviour of fast diffusions on graphs
Determining the asymptotic independence ratio of random regular graphs is a key challenge in the area of sparse random graphs. Due to the interpolation method, we have very good upper bounds at our disposal, which are actually known to be…
In this note we study the behaviour as $s\to 0^+$ of some semigroup based Besov seminorms associated with a non-symmetric and hypoelliptic diffusion with a drift. Our results generalise a previous one of Maz'ya and Shaposhnikova for the…
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…
The present paper is concerned with diffusion processes running on tubular domains with conditions on nonreaching the boundary, respectively, reflecting at the boundary, and corresponding processes in the limit where the thin tubular…
We give asymptotics for the cumulative distribution function (CDF) for degrees of large dense random graphs sampled from a graphon. The proof is based on precise asymptotics for binomial random variables. Replacing the indicator function in…
We study the long-time asymptotics of a certain class of nonlinear diffusion equations with time-dependent diffusion coefficients which arise, for instance, in the study of transport by randomly fluctuating velocity fields. Our primary goal…
The speed of a class of graphs counts the number of graphs on the vertex set $\lbrace 1,\dots, n\rbrace$ inside the class as a function of $n$. In this paper, we investigate this function for many classes of graphs that naturally arise in…
Constraints can affect dramatically the behavior of diffusion processes. Recently, we analyzed a natural and a technological system and reported that they perform diffusion-like discrete steps displaying a peculiar constraint, whereby the…
We study concentration properties of vertex degrees of $n$-dimensional Erdos-R\'enyi random graphs with the edge probability $\rho/n$ by means of high moments of these random variables in the limit when $n$ and $\rho$ tend to infinity.…
We study the problem of distributed hypothesis testing with a network of agents where some agents repeatedly gain access to information about the correct hypothesis. The group objective is to globally agree on a joint hypothesis that best…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
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…
The long-time behavior of a reaction-diffusion front between one static (e.g. porous solid) reactant A and one initially separated diffusing reactant B is analyzed for the mean-field reaction-rate density R(\rho_A,\rho_B) =…
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are small. The resulting asymptotic behaviour is seen to…
Our main result is an extension of Pansu's theorem to random metrics, where the edges of the Cayley are i.i.d. random variable with some finite exponential moment. Based on a previous work by the second author, the proof relies on…
We are interested in evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a…
In this paper we consider a representative a priori unstable Hamiltonian system with 2+1/2 degrees of freedom, to which we apply the geometric mechanism for diffusion introduced in the paper Delshams et al., Mem. Amer. Math. Soc. 2006, and…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
We introduce a novel technique to find the asymptotic time behaviour of deterministic systems exhibiting anomalous diffusion. The procedure is tested for various classes of simple but physically relevant 1-D maps and possible relevance of…
We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…