Related papers: Steady-State Spread Bounds for Graph Diffusion via…
Point process is the dominant paradigm for modeling event sequences occurring at irregular intervals. In this paper we aim at modeling latent dynamics of event propagation in graph, where the event sequence propagates in a directed weighted…
We show that for any connected graph $G$ with maximum degree $d\ge3$, the spectral gap from $0$ with respect to the adjacency matrix is at most $\sqrt{d-1}$, with equality if and only if $G$ is the incidence graph of a finite projective…
Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…
Graph diffusion, which iteratively propagates real-valued substances among the graph, is used in numerous graph/network-involved applications. However, releasing diffusion vectors may reveal sensitive linking information in the data such as…
Consider a graph where the sites are distributed in space according to a Poisson point process on $\mathbb R^n$. We study a population evolving on this network, with individuals jumping between sites with a rate which decreases…
In this paper we study the spectrum of the random geometric graph $G(n,r)$, in a regime where the graph is dense and highly connected. In the \erdren $G(n,p)$ random graph it is well known that upon connectivity the spectrum of the…
Mobility causes network structures to change. In PSNs where underlying network structure is changing rapidly, we are interested in studying how information dissemination can be enhanced in a sparse disconnected network where nodes lack the…
In this paper, we consider a network of agents with Laplacian dynamics, and study the problem of improving network robustness by adding a maximum number of edges within the network while preserving a lower bound on its strong structural…
Given a network of fixed size $n$ and an initial distribution of data, we derive sufficient connectivity conditions on a sequence of time-varying digraphs for (a) data collection and (b) data dissemination, within at most $(n-1)$…
Motivated by systems in which droplets grow and shrink in a turbulence-driven supersaturation field, we investigate the problem of turbulent condensation in a general manner. Using direct numerical simulations we show that the turbulent…
We consider the statistics of density number of filaments for the propagation of a laser beam subjected to multiple filamentation in a closed area with reflecting boundaries. Dissipation arrests the catastrophic collapse of filaments,…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
This work aims to numerically investigate the linear global instability of long separation bubbles origin from the changes in the adverse pressure gradient inside a laminar flat plate boundary layer disturbed by placing a bluff body with…
In this paper we consider a model for the diffusion of a population in a strip-shaped field, where the growth of the species is governed by a Fisher-KPP equation and which is bounded on one side by a road where the species can have a…
We study the boundary stabilization of one-dimensional cross-diffusion systems in a moving domain. We show first exponential stabilization and then finite-time stabilization in arbitrary small-time of the linearized system around uniform…
The spread of a graph $G$ is the difference $\lambda_1 - \lambda_n$ between the largest and smallest eigenvalues of its adjacency matrix. Breen, Riasanovsky, Tait and Urschel recently determined the graph on $n$ vertices with maximum spread…
Front propagation in two dimensional steady and unsteady cellular flows is investigated in the limit of very fast reaction and sharp front, i.e., in the geometrical optics limit. In the steady case, by means of a simplified model, we…
Diffusion over networks has recently been used to define spatiotemporal scales and extend Kadanoff block spins of Euclidean space to supernodes of networks in the Laplacian renormalization group (LRG). Yet, its ad hoc coarse-graining…
This paper formulates a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. The smoothness condition…