Abstract: For a multiagent system with a directed graph as its interaction topology, the consensus convergence rate is determined by the algebraic connectivity (the smallest real part of nonzero ...

The art of finding patterns or communities plays a central role in the analysis of structured data such as networks. Community detection in graphs has become a field on its own. Real-world networks, ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.

Can a blockchain scale without breaking the promise of decentralization? Waterfall Network argues yes by leaving the linear blockchain model behind. In July 2024, Waterfall Network launched its ...

Abstract: In this talk, I will present a new combinatorial algorithm for maximum flow that is based on running the weighted push-relabel algorithm introduced in [BBST ...

Introduction: Voxel hierarchy on dynamic brain graphs is produced by k-core percolation on functional dynamic amplitude correlation of resting-state fMRI. Methods: Directed graphs and their ...

Department of Mathematics, Michigan State University, East Lansing, Michigan 48824, United States Department of Mathematics, Michigan State University, East Lansing, Michigan 48824, United States ...

A set of vertices with each vertex having zero or more labels and zero or more properties/attributes. A set of edges with each edge being directed from one vertex to another vertex. Each edge has zero ...

Directed graphs are crucial in modeling complex real-world systems, from gene regulatory networks and flow networks to stochastic processes and graph metanetworks. Representing these directed graphs ...