Related papers: Convergence of distributions on paths
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of this algorithm. We use standard techniques from matrix theory…
Distinguishing between uniform and non-uniform sample distributions is a common problem in directional data analysis; however for many tests, non-uniform distributions exist that fail uniformity rejection. By merging directional statistics…
We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann-distributed limit structure. We demon- strate how this setting encompasses arbitrary weighted…
In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper,…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical distributed computing and simplicial neural networks. Graphs are…
The main result of the article is the rate of convergence to the Rosenblatt-type distributions in non-central limit theorems. Specifications of the main theorem are discussed for several scenarios. In particular, special attention is paid…
This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
We study diffusion and consensus dynamics in a Network of Networks model. In this model, there is a collection of sub-networks, connected to one another using a small number of links. We consider a setting where the links between networks…
Within path sampling framework, we show that probability distribution divergences, such as the Chernoff information, can be estimated via thermodynamic integration. The Boltzmann-Gibbs distribution pertaining to different Hamiltonians is…
This doctoral thesis concerns novel distributed algorithms for weight balancing over directed (communication) topologies. A directed topology (digraph) with nonnegative (or positive) weights assigned on each edge is weight-balanced if, for…
Clustering trajectory data attracted considerable attention in the last few years. Most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying road network…
This paper studies the distribution of a family of rankings, which includes Google's PageRank, on a directed configuration model. In particular, it is shown that the distribution of the rank of a randomly chosen node in the graph converges…
Consensus strategies find a variety of applications in distributed coordination and decision making in multi-agent systems. In particular, average consensus plays a key role in a number of applications and is closely associated with two…
We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…
In this paper, we revisit a well-known distributed projected subgradient algorithm which aims to minimize a sum of cost functions with a common set constraint. In contrast to most of existing results, weight matrices of the time-varying…
On contrary to the customary thought, the well-known ``lemma'' that the distribution function of a collisionless Boltzmann gas keeps invariant along a molecule's path represents not the strength but the weakness of the standard theory. One…
We characterize the classical Boltzmann distribution as the unique solution to a certain combinatorial Hodge theory problem in homological degree zero on a finite graph. By substituting for the graph a CW complex and a degree d, we are able…