SelectedWorks - Amites Sarkar

Contact

Selected Works of Amites Sarkar

Professor, Department of Mathematics

Amites was born, raised and educated in England, and received a PhD from Cambridge University. He then spent five years at Philips Research Laboratories and four years as a postdoc at the University of Memphis. He enjoys reading, running and hiking, and intends to learn to ski.

Works
About

×

About Amites Sarkar

Amites was born, raised and educated in England, and received a PhD from Cambridge University. He then spent five years at Philips Research Laboratories and four years as a postdoc at the University of Memphis. He enjoys reading, running and hiking, and intends to learn to ski.

Present	Faculty Member, Western Washington University ‐ Western Expert
Institution Organization Position Type Position Title Time Period to Options Current Position Affiliate my profile with this Institution
Present	Professor, Mathematics, Western Washington University ‐ Department of Mathematics
Institution Organization Position Type Position Title Time Period to Options Current Position Affiliate my profile with this Institution

Combinatorics, Probablility theory, and Graph theory

Math 125: Calculus and Analytic Geometry II
Math 204: Elementary Linear Algebra
Math 209: Discrete Mathematics
Math 224/225: Multivariable Calculus and Analytic Geometry I/II
Math 226: Limits and Infinite Series
Math 302: ntroduction to Proofs via Number Theory
Math 304: Linear Algebra
Math 309: Introduction to Proof in Discrete Mathematics
Math 331: Ordinary Differential Equations
Math 341: Probability and Statistical Inference
Math 401:Introduction to Abstract Algebra
Math 402/502: Introduction to Abstract Algebra II
Math 409: Putnam Seminar
Math 419: Historical Perspectives of Mathematics
Math 421/521: Methods of Mathematical Analysis I
Math 422/522: Methods of Mathematical Analysis II
Math 438/538: Complex Variables
Math 497E/564: Graph Theory
Math 503: Galois Theory
Math 564: Graph Theory
Math 582: Teaching Core College Mathematics

Phone: (360)650-7569
Fax: (360)650-7788
Office: Bond Hall 216

Email:

Articles (21)

Highly connected subgraphs of graphs with given independence number

European Journal of Combinatorics (2018)

Shinya Fujita, Henry Liu and Amites Sarkar

Let G be a graph on n vertices with independence number α. We prove that if n is sufficiently large ...

Continuum percolation with holes

Statistics & Probability Letters (2017)

A. Sarkar and M. Haenggi

We analyze a mathematical model of a cognitive radio network introduced in Yemini et al. (2016). Our analysis reveals several surprising ...

Unique coverage in Boolean models

Statistics & Probability Letters (2017)

Martin Haenggi and Amites Sarkar

Consider a wireless cellular network consisting of small, densely scattered base stations. A user u is uniquely covered by a base station b if u is the only ...

Rainbow Turán Problems for Paths and Forests of Stars

The Electronic Journal of Combinatorics (2017)

Daniel Johnston, Cory Palmer and Amites Sarkar

For a fixed graph F, we would like to determine the maximum number of edges in a properly edge-colored graph ...

Sentry Selection in Sensor Networks: Theory and Algorithms

International Journal of Sensor Networks (2017)

Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, et al.

We study the geometric aspects of the sentry selection problem for a sensor network with randomly distributed sensors, each of ...

Highly Connected Subgraphs of Graphs with Given Independence Number (Extended ...

Electronic Notes in Discrete Mathematics (2016)

Shinya Fujita, Henry Liu and Amites Sarkar

Let G be a graph on n vertices with independence number α. What is the largest k-connected subgraph that G must contain? We prove that if n is sufficiently large (n≥α2k+1 will ...

Secrecy coverage in two dimensions

Advances in Applied Probability (2016)

Working in the infinite plane R2, consider a Poisson process of black points with intensity 1, and an independent Poisson process of red points with ...

Secrecy coverage in two dimensions

2014 Information Theory and Applications Workshop (2014)

Imagine a sensor network consisting of base stations scattered at random over a large circular region R. Suppose that, in ...

Percolation in the Secrecy Graph

Discrete Applied Mathematics (2013)

Amites Sarkar and Martin Haenggi

The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy ...

Secrecy Coverage

Internet Mathematics (2013)

Amites Sarkar and Martin Haenggi

Motivated by information-theoretic secrecy, geometric models for secrecy in wireless networks have begun to receive increased attention. The general question ...

Secrecy Coverage (Conference Proceeding)

44th Asilomar Conference on Signals, Systems, and Computers (2010)

Amites Sarkar and Martin Haenggi

Motivated by information-theoretic secrecy, geometric models for secrecy in wireless networks have begun to receive increased attention. The general question ...

Sentry Selection in Wireless Networks

Advances in Applied Probability (2010)

Paul Balister, Béla Bollobás, Amites Sarkar and Mark Walters

Let P be a Poisson process of intensity one in the infinite plane R2. We surround each point x of ...

The Linus Sequence

Combinatorics Probability & Computing (2010)

Paul Balister, Steven Kalikow and Amites Sarkar

Define the Linus sequence Ln for n ≥ 1 as a 0–1 sequence with L1 = 0, and Ln chosen ...

Highly Connected Random Geometric Graphs

Discrete Applied Mathematics (2009)

Paul Balister, Béla Bollobás, Amites Sarkar and Mark Walters

Let P be a Poisson process of intensity 1 in a square Sn of area n. We construct a random ...

A Critical Constant for the k Nearest-Neighbour Model

Advances in Applied Probability (2009)

Paul Balister, Béla Bollobás, Amites Sarkar and Mark Walters

Let P be a Poisson process of intensity 1 in a square Sn of area n. For a fixed integer ...

Connectivity of a Gaussian Network

International Journal of Ad Hoc and Ubiquitous Computing (2008)

Paul Balister, Béla Bollobás, Amites Sarkar and Mark Walters

Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R² distributed randomly ...

Reliable Density Estimates for Achieving Coverage and Connectivity in Thin ...

MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking (2007)

Amites Sarkar, Paul Balister, Béla Bollobás and Santosh Kumar

Deriving the critical density (which is equivalent to deriving the critical radius or power) to achieve coverage and/or connectivity for ...

Connectivity of Random k-Nearest-Neighbor Graphs

Advances in Applied Probability (2005)

Paul Balister, Béla Bollobás, Amites Sarkar and Mark Walters

Let P be a Poisson process of intensity one in a square Sn of area n. We construct a random ...

Paths of Length Four

Discrete Mathematics (2003)

Béla Bollobás and Amites Sarkar

For each sufficiently large m, we determine the unique graph of size m with the maximum number of paths of ...

Paths in Graphs

Studia Scientiarum Mathematicarum Hungarica (2000)

Béla Bollobás and Amites Sarkar

We prove that if 10 ≦ (k2) ≦ m < (k+12) then the number of paths of length three in ...

Extremal graphs for weights

Discrete Mathematics (1999)

Béla Bollobás, Paul Erdös and Amites Sarkar

Given a graph G = (V,E) and α ∈ R, we write wα(G)=∑xyϵEdG(x)αdG(y)α, and study the function wα(m) = max ...

Contribution to Book

Percolation, Connectivity, Coverage and Colouring of Random Geometric Graphs

Handbook of Large-Scale Random Networks (2009)

Amites Sarkar, Paul Balister and Béla Bollobás

In this review paper, we shall discuss some recent results concerning several models of random geometric graphs, including the Gilbert ...

Unpublished Paper

The Simple Random Walk on a Random Voronoi Tiling

Amites Sarkar and Louigi Addario-Berry

Let P be a Poisson point process in ℝd with intensity 1. We show that the simple random walk on ...