Ayalvadi Ganesh
YOU?
Author Swipe
View article: Hip fractures redefined - ERAS protocol’s impact: the Indian scenario
Hip fractures redefined - ERAS protocol’s impact: the Indian scenario Open
This article delves into the profound impact of enhanced recovery after surgery (ERAS) protocols on the management of hip fractures within the Indian healthcare landscape. Hip fractures, particularly prevalent among the elderly, represent …
View article: Consensus in the Weighted Voter Model with Noise-Free and Noisy Observations
Consensus in the Weighted Voter Model with Noise-Free and Noisy Observations Open
Collective decision-making is an important problem in swarm robotics arising in many different contexts and applications. The Weighted Voter Model has been proposed to collectively solve the best-of-$k$ problem, and analysed in the thermod…
View article: The distribution of the number of isolated nodes in the 1-Dimensional soft random geometric graph
The distribution of the number of isolated nodes in the 1-Dimensional soft random geometric graph Open
We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a Poisson process on the torus of length L (the line segment [0,L] with periodic boundary conditions), and where an edge is present between tw…
View article: A Model of Job Parallelism for Latency Reduction in Large-Scale Systems
A Model of Job Parallelism for Latency Reduction in Large-Scale Systems Open
Processing computation-intensive jobs at multiple processing cores in parallel is essential in many real-world applications. In this paper, we consider an idealised model for job parallelism in which a job can be served simultaneously by $…
View article: The Distribution of the Number of Isolated Nodes in the 1-Dimensional Soft Random Geometric Graph
The Distribution of the Number of Isolated Nodes in the 1-Dimensional Soft Random Geometric Graph Open
We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a Poisson process on the torus of length L (the line segment [0,L] with periodic boundary conditions), and where an edge is present between tw…
View article: Asymptotic Optimality for Decentralised Bandits
Asymptotic Optimality for Decentralised Bandits Open
We consider a large number of agents collaborating on a multi-armed bandit problem with a large number of arms. We present an algorithm which improves upon the Gossip- Insert-Eliminate method of Chawla et al. [3]. We provide a regret bound…
View article: Low latency allcast over broadcast erasure channels
Low latency allcast over broadcast erasure channels Open
Consider n nodes communicating over an unreliable broadcast channel. Each node has a single packet that needs to be communicated to all other nodes. Time is slotted, and a time slot is long enough for each node to broadcast one packet. Eac…
View article: Pigouvian Tolls and Welfare Optimality with Parallel Servers and Heterogeneous Customers
Pigouvian Tolls and Welfare Optimality with Parallel Servers and Heterogeneous Customers Open
Congestion externalities are a well-known phenomenon in transportation and communication networks, healthcare etc. Optimization by self-interested agents in such settings typically results in equilibria which are sub-optimal for social wel…
View article: Connectivity in one-dimensional soft random geometric graphs
Connectivity in one-dimensional soft random geometric graphs Open
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…
View article: Social Learning in Multi Agent Multi Armed Bandits
Social Learning in Multi Agent Multi Armed Bandits Open
Motivated by emerging need of learning algorithms for large scale networked and decentralized systems, we introduce a distributed version of the classical stochastic Multi-Arm Bandit (MAB) problem. Our setting consists of a large number of…
View article: The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits
The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits Open
We consider a decentralized multi-agent Multi Armed Bandit (MAB) setup consisting of $N$ agents, solving the same MAB instance to minimize individual cumulative regret. In our model, agents collaborate by exchanging messages through pairwi…
View article: Functional Large Deviations for Cox Processes and $Cox/G/\\infty$ Queues,\n with a Biological Application
Functional Large Deviations for Cox Processes and $Cox/G/\\infty$ Queues,\n with a Biological Application Open
We consider an infinite-server queue into which customers arrive according to\na Cox process and have independent service times with a general distribution.\nWe prove a functional large deviations principle for the equilibrium queue\nlengt…
View article: Functional Large Deviations for Cox Processes and $Cox/G/\infty$ Queues, with a Biological Application
Functional Large Deviations for Cox Processes and $Cox/G/\infty$ Queues, with a Biological Application Open
We consider an infinite-server queue into which customers arrive according to a Cox process and have independent service times with a general distribution. We prove a functional large deviations principle for the equilibrium queue length p…
View article: The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs
The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs Open
Web crawlers are used by internet search engines to gather information about the web graph. In this paper we investigate a simple process which models such software by walking around the vertices of a graph. Once initial random vertex weig…
View article: The Robot Crawler Model on Complete k-Partite and Erd\H{o}s-R\'enyi Random Graphs
The Robot Crawler Model on Complete k-Partite and Erd\H{o}s-R\'enyi Random Graphs Open
Web crawlers are used by internet search engines to gather information about the web graph. In this paper we investigate a simple process which models such software by walking around the vertices of a graph. Once initial random vertex weig…
View article: Controller placement methods analysis
Controller placement methods analysis Open
Software-Defined Networking (SDN) offers flexibility and programmability to the network infrastructure through the introduction of a controller. However, the controller introduces extra delay into the system as new data flows must query th…