Related papers: Interacting Particle Systems on Random Graphs
Lectures presented at the 1st CERN Asia-Europe-Pacific School of High-Energy Physics, Fukuoka, Japan, 14-27 October 2012. A pedagogical selection of topics in probability and statistics is presented. Choice and emphasis are driven by the…
This volume contains a selection of the papers presented at TERMGRAPH 2018, the tenth edition of the international workshop on computing with terms and graphs. Graphs, and graph transformation systems, are used in many areas within Computer…
We study spatial embeddings of random graphs in which nodes are randomly distributed in geographical space. We let the edge probability between any two nodes to be dependent on the spatial distance between them and demonstrate that this…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
$ $[This paper is a (self contained) chapter in a new book, Mathematics and Computation, whose draft is available on my homepage at https://www.math.ias.edu/avi/book ]. We survey some concrete interaction areas between computational…
Temporal graphs represent the dynamic relationships among entities and occur in many real life application like social networks, e commerce, communication, road networks, biological systems, and many more. They necessitate research beyond…
Networks are a widely used and efficient paradigm to model real-world systems where basic units interact pairwise. Many body interactions are often at play, and cannot be modelled by resorting to binary exchanges. In this work, we consider…
A quantitative model of the mobility of functionalized particles at the interface is pivotal to understanding important systems in biology and nanotechnology. In this work, we investigate the emerging dynamics of particles anchored through…
This reports summarizes the three lectures on particle physics instrumentation given during the AEPSHEP school in November 2014 at Puri-India. The lectures were intended to give an overview of the interaction of particles with matter and…
The goal of this paper is to describe the various kinetic equations which arise from scaling limits of interacting particle systems. We provide a formalism which allows us to determine the kinetic equation for a given interaction potential…
We model and compute the probability distribution of the letters in random generated words in a language by using the theory of set partitions, Young tableaux and graph theoretical representation methods. This has been of interest for…
In this paper we study the maximum degree of interaction which may emerge in distributed systems. It is assumed that a distributed system is represented by a graph of nodes interacting over edges. Each node has some amount of data. The…
Graph randomization techniques play a crucial role in network analysis, allowing researchers to assess the statistical significance of observed network properties and distinguish meaningful patterns from random fluctuations. In this survey…
Despite growing interest in probabilistic modeling approaches and availability of learning tools, people with no or less statistical background feel hesitant to use them. There is need for tools for communicating probabilistic models to…
Understanding the topology of the state space has proven to be extremely efficient for dynamical systems with a continuous state space. On the other hand, for particle systems on finite simple graphs, it has not yet been subject to deep…
The probabilistic graphs framework models the uncertainty inherent in real-world domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this…
Many time-evolving systems in nature, society and technology leave traces of the interactions within them. These interactions form temporal networks that reflect the states of the systems. In this work, we pursue a coarse-grained…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
The plenary lectures, parallel talks, oral presentations and panel contributions on Cosmology and Gravitation presented during the XXII Brazilian National Meeting on Particles and Fields are briefly reviewed. Some remarks on the area are…
Our main goal is to examine the role of communities in epidemic spread in a random graph model. More precisely, we consider a random graph model which consists of overlapping complete graphs, representing households, workplaces, school…