Related papers: Steady-State Spread Bounds for Graph Diffusion via…
We study directed, weighted graphs $G=(V,E)$ and consider the (not necessarily symmetric) averaging operator $$ (\mathcal{L}u)(i) = -\sum_{j \sim_{} i}{p_{ij} (u(j) - u(i))},$$ where $p_{ij}$ are normalized edge weights. Given a vertex $i…
The $p$-spectral radius of a graph $G=(V,E)$ with adjacency matrix $A$ is defined as $\lambda^{(p)}(G)=\max \{x^TAx : \|x\|_p=1 \}$. This parameter shows remarkable connections with graph invariants, and has been used to generalize some…
We describe the first algorithms that satisfy the standard notion of node-differential privacy in the continual release setting (i.e., without an assumed promise on input streams). Previous work addresses node-private continual release by…
Using a steady state process of node duplication and deletion we produce networks with 1/k scale-free degree distributions in the limit of vanishing connectance. This occurs even though there is no growth involved and inherent preferential…
A stochastic reaction-diffusion model is studied on a networked support. In each patch of the network two species are assumed to interact following a non-normal reaction scheme. When the interaction unit is replicated on a directed linear…
We consider an explicitly solvable model (formulated in the Riemannian geometry terms) for a stationary wave process in a specific thin domain with the Dirichlet boundary conditions on the boundary of the domain. The transition from the…
Inspired by river networks and other structures formed by Laplacian growth, we use the Loewner equation to investigate the growth of a network of thin fingers in a diffusion field. We first review previous contributions to illustrate how…
We present classes of models in which particles are dropped on an arbitrary fixed finite connected graph, obeying adhesion rules with screening. We prove that there is an invariant distribution for the resulting height profile, and Gaussian…
We study the properties of the ``Rigid Laplacian'' operator, that is we consider solutions of the Laplacian equation in the presence of fixed truncation errors. The dynamics of convergence to the correct analytical solution displays the…
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 the propagation of uniformly translating fronts into a linearly unstable state, both analytically and numerically. We introduce a perturbative renormalization group (RG) approach to compute the change in the propagation speed when…
This paper presents an angle-based approach for distributed formation shape stabilization of multi-agent systems in the plane. We develop an angle rigidity theory to study whether a planar framework can be determined by angles between…
In this note, we study Laplacians on graphs for which connectivity within certain subgraphs tends to infinity. Our main focus are graphs sharing a common node set on which edge weights within certain clusters grow to infinity. As…
We study modulational instability in a fiber system resembling a dispersion-managed link where the sign of the group-velocity dispersion varies randomly according to a telegraph process. We find that the instability gain of stochastic…
Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently extended to hypergraphs. We introduce a variant of…
An asymptotic analysis for a system with equation and dynamic boundary condition of Cahn-Hilliard type is carried out as the coefficient of the surface diffusion acting on the phase variable tends to 0, thus obtaining a forward-backward…
The way in which different types of dynamics unfold in complex networks is intrinsically related to the propagation of activation along nodes, which is strongly affected by the network connectivity. In this work we investigate to which…
We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent…
This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree…
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large…